Indexed metadata

The Area Asymptotics of (sn,n)(sn,n)-Dyck Paths

Evan Conway, James Harbour

Source record

Source: arXiv

Published: Oct 6, 2026

arXiv: 2610.07671

Open original source ↗

Source abstract

We study the total and average area of (sn,n)(sn,n)-Dyck paths: lattice paths from (0,0)(0,0) to (sn,n)(sn,n) that stay weakly below the line x=syx=sy, counted by the Fuss-Catalan numbers. Generalizing a result of Merlini, Sprugnoli, and Verri for the case s=1s=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 ss, the average area is asymptotic to πs(s+1)/8⋅n3/2\sqrt{πs(s+1)/8} \cdot n^{3/2}, while for fixed nn it is asymptotic to sn⋅Q(n)/2sn \cdot Q(n)/2 as ss grows large, where Q(n)Q(n) denotes Ramanujan's QQ-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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The Area Asymptotics of $(sn,n)$-Dyck Paths — Mathematical Frontier Network