Metraipolis › archive › dc_c856c16a80de
The Area Asymptotics of $(sn,n)$-Dyck Paths — arXiv:2610.07671
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07671
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:08.934Z
- SHA-256 of the archived text
91eedca5e4cf327beda01e08be70c115c18a05dc08c331ea3c11da302fd3e1f0- Stable URL of this page
https://metraipolis.com/documento/dc_c856c16a80de
How to cite
The Area Asymptotics of $(sn,n)$-Dyck Paths — arXiv:2610.07671 — arXiv (en), https://arxiv.org/abs/2610.07671 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c856c16a80de (Metraipolis archive dc_c856c16a80de, sha256 91eedca5e4cf327beda01e08be70c115c18a05dc08c331ea3c11da302fd3e1f0)
BibTeX
@misc{dcc856c16a80de,
title = {The Area Asymptotics of $(sn,n)$-Dyck Paths — arXiv:2610.07671},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07671},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c856c16a80de; sha256 91eedca5e4cf327beda01e08be70c115c18a05dc08c331ea3c11da302fd3e1f0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07671. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the total and average area of $(sn,n)$-Dyck paths: lattice paths from $(0,0)$ to $(sn,n)$ that stay weakly below the line $x=sy$, counted by the Fuss-Catalan numbers. Generalizing a result of Merlini, Sprugnoli, and Verri for the case $s=1$, we derive an exact formula for the total area over all such paths. From this we obtain explicit upper and lower bounds for both the total and the average area, together with the corresponding asymptotics: for fixed $s$, the average area is asymptotic to $\sqrt{\pi s(s+1)/8} \cdot n^{3/2}$, while for fixed $n$ it is asymptotic to $sn \cdot Q(n)/2$ as $s$ grows large, where $Q(n)$ denotes Ramanujan's $Q$-function. Along the way, we confirm a conjecture of Kotesovec on the asymptotics of a binomial sum that also arises in several other enumeration problems.
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/2610.07671 — 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-07T11:22:09.546Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).