betaFeedback

WorksMathematics

A combinatorial proof of a symmetric joint distribution on strict binary trees

Abstract

Nonplanar strict binary trees on 2n+12n+1 vertices are enumerated by the reduced tangent numbers T2n+1/2nT_{2n+1}/2^n, whose entries are refined by Poupard's triangle. Poupard defined the end of the minimal chain (eoc\mathrm{eoc}) and the parent of the maximum leaf (pom\mathrm{pom}) on these trees, proving that eoc\mathrm{eoc} and pom+1\mathrm{pom}+1 share this triangular distribution. Foata and Han subsequently showed via tree calculus and partial difference equations that the joint distribution of (eoc,2n+1−pom)(\mathrm{eoc}, 2n+1-\mathrm{pom}) is symmetric. By introducing an auxiliary tree statistic dual to eoc\mathrm{eoc}, 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.

Paper details

vlnc:W_qemsvmgu
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 4

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…