Metraipolis › archive › dc_dcac85f3d57e

Bijective proofs of several conjectures on Jacobi permutations — arXiv:2608.11771

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11771
License (as archived)
CC0-1.0
Archived
2026-10-19T05:47:44.029Z
SHA-256 of the archived text
18d2cd902bae0437ca6e6d342e01d19d1aef21dd01178e3d88c65bbd5a69f52c
Stable URL of this page
https://metraipolis.com/documento/dc_dcac85f3d57e

How to cite

Bijective proofs of several conjectures on Jacobi permutations — arXiv:2608.11771 — arXiv (en), https://arxiv.org/abs/2608.11771 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dcac85f3d57e (Metraipolis archive dc_dcac85f3d57e, sha256 18d2cd902bae0437ca6e6d342e01d19d1aef21dd01178e3d88c65bbd5a69f52c)
BibTeX
@misc{dcdcac85f3d57e,
  title = {Bijective proofs of several conjectures on Jacobi permutations — arXiv:2608.11771},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11771},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dcac85f3d57e; sha256 18d2cd902bae0437ca6e6d342e01d19d1aef21dd01178e3d88c65bbd5a69f52c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11771. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Jacobi permutations, invented by Viennot in the context of the Jacobi elliptic functions, are counted by the Euler numbers. Recently, Henke, Hoffman, Stephens, Yuan, and Zhuang studied refined enumerations of Jacobi permutations and proposed three conjectures concerning the distribution of several statistics on Jacobi permutations. In this paper, we prove these conjectures by establishing explicit bijections involving increasing even trees, increasing binary trees, alternating permutations, and André permutations. One highlight of our results is a bijection between Jacobi permutations and André I permutations that transforms the pair of statistics $(\Ascbot, \last)$ to the pair of statistics $(\Desbot, \first)$. Here the statistic $\Ascbot$ (resp., $\Desbot$) denotes the set of ascent bottoms (resp., descent bottoms) of permutations, and the statistic $\first$ (resp., $\last$) denotes the first (resp., $\last$) letter of permutations. Furthermore, we investigate pairs of statistics on André permutations and simsun permutations that are equidistributed with the pair $(\asc, \last)$ on Jacobi permutations, where $\asc$ denotes the number of ascents of permutations. Finally, we obtain a closed-form formula for the trivariate exponential generating function of Jacobi permutations with respect to the number of ascents and the numbers of letters smaller and larger than the last letter.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.11771 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:40:33.651Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).