Metraipolis › archive › dc_dc7bdd294648
Entry and position statistics in alternating permutations and Young tableaux — arXiv:2611.00872
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00872
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:32.504Z
- SHA-256 of the archived text
7e612dae994eaf769ca053529009554039d9d217b14869fdf51d54fee27ce209- Stable URL of this page
https://metraipolis.com/documento/dc_dc7bdd294648
How to cite
Entry and position statistics in alternating permutations and Young tableaux — arXiv:2611.00872 — arXiv (en), https://arxiv.org/abs/2611.00872 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc7bdd294648 (Metraipolis archive dc_dc7bdd294648, sha256 7e612dae994eaf769ca053529009554039d9d217b14869fdf51d54fee27ce209)
BibTeX
@misc{dcdc7bdd294648,
title = {Entry and position statistics in alternating permutations and Young tableaux — arXiv:2611.00872},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00872},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc7bdd294648; sha256 7e612dae994eaf769ca053529009554039d9d217b14869fdf51d54fee27ce209},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00872. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study entry and position statistics in alternating permutations and standard Young tableaux using linear extensions and generating functions. For alternating permutations, we give explicit formulas for the mean and variance of the first entry and of the position of any fixed value. For standard Young tableaux, we express the sum of the lower-left entries as the number of tableaux of an associated skew shape. For two-row shapes, we determine the distribution of the entry in each cell of the second row, and for the shape $(n,n)$ we give a closed formula for its sum over all tableaux, which recovers a limit formula of Stanley. Through a bijection of Lewis, the results for the shape $(n,n)$ describe the entries of a random $321$-avoiding down-up permutation of even length. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.00872 — 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-11-03T18:15:38.052Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).