← 研踪 PaperTrailarXiv:2611.24504 · v1
A combinatorial proof of a symmetric joint distribution on strict binary trees
首次提交 2026-11-18 22:30
版本更新 2026-11-18 22:30
雷达观测 2026-11-19 15:04
摘要
Nonplanar strict binary trees on vertices are enumerated by the reduced tangent numbers , whose entries are refined by Poupard's triangle. Poupard defined the end of the minimal chain () and the parent of the maximum leaf () on these trees, proving that and share this triangular distribution. Foata and Han subsequently showed via tree calculus and partial difference equations that the joint distribution of is symmetric. By introducing an auxiliary tree statistic dual to , we give a bijective proof of this symmetry. Our proof composes a recursive bijection on strict binary trees, a bijection to alternating André permutations, and the reverse-complement involution on permutations.
作者备注:11 pages, 2 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 22:30 · 最新观测版本
A combinatorial proof of a symmetric joint distribution on strict binary trees
Nonplanar strict binary trees on vertices are enumerated by the reduced tangent numbers , whose entries are refined by Poupard's triangle. Poupard defined the end of the minimal chain () and the parent of the maximum leaf () on these trees, proving that and share this triangular distribution. Foata and Han subsequently showed via tree calculus and partial difference equations that the joint distribution of is symmetric. By introducing an auxiliary tree statistic dual to , we give a bijective proof of this symmetry. Our proof composes a recursive bijection on strict binary trees, a bijection to alternating André permutations, and the reverse-complement involution on permutations.
查看此版本解读 →查看此版本原文 ↗