WorksMathematics
A combinatorial proof of a symmetric joint distribution on strict binary trees
Abstract
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.