跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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.

作者备注:11 pages, 2 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 22:30 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗