Searcharxiv⌕ Search

arXiv · 2610.26596

Rational Dyck Excursion Counts as Sums of Generalized Fuss-Catalan Products

Abstract

For walks with jumps +p and -q, where p,q are coprime positive integers, we express the weak and strict rational Dyck excursion counts as finite weighted sums of generalized Fuss-Catalan products. Both sums run over the same partitions of q for every path size. Reversing the order of the steps and changing their signs transforms a returning walk with jumps +p and -q into one with jumps +q and -p, with the same heights in reverse order. This preserves both weak and strict excursions. Applying the formulas with p and q exchanged therefore gives sums over partitions of p, so we can choose the smaller of the two jump magnitudes. The indices of the Fuss-Catalan factors satisfy certain divisibility conditions that are determined by the jump magnitudes and the partition parts. The weak formula alternates in sign with the number of parts, whereas every term in the strict formula is positive. We prove both formulas by cutting unrestricted walks at their first and last visits to their lowest height. Expanding the resulting factors produces the partitions of q and the different signs. We also give equivalent binomial convolutions. Multiplying each Fuss-Catalan factor by q in the weak formula or p in the strict formula gives a positive integer. For q=1, the weak and strict counts reduce to Fuss-Catalan and shifted Raney numbers, respectively; for q=2 and q=3, the formulas yield explicit convolution identities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brecht Verbeken, Arne Vanhoyweghen, Vincent Ginis. 2026-10-19. Rational Dyck Excursion Counts as Sums of Generalized Fuss-Catalan Products. https://arxiv.org/abs/2610.26596

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗

The exact Erdős-Ko-Rado Theorem for 3-wise $t$-intersecting uniform families

One of the central problems in extremal set theory is the determination of the maximum size of an $r$-wise $t$-intersecting $k$-graph on $n$ vertices. For $r=2$ after decades of effort, a complete solution was given by the Complete Intersection Theorem (\cite{AK0}). However the case $r\geq 3$ remains wide open. The $t$-star consisting of all $k$-sets containing a fixed $t$-set provides a lower bound. For $r=3$ and $k\geq t+2\geq44$, we determine the exact threshold for which it is optimal for $n>k$. The condition is essentially $n\geq \sqrt{t}k$. For $k\geq t+2\geq47$ and $n\geq\frac{\sqrt{4t+9}-1}{2}k$, we also establish the corresponding Hilton-Milner-type stability result.

math.CO↗

A Littlewood-Richardson Rule for Forest Polynomials

The forest polynomials $\mathfrak{P}_a$ of Nadeau-Tewari form a $\mathbb{Z}$-basis of $\mathbb{Z}[x_1,x_2,\ldots]$ whose role for the cohomology of the quasisymmetric flag variety parallels that of Schubert polynomials for the classical flag variety. Nonnegativity of the structure constants $β_{a,b}^c$ in $\mathfrak{P}_a \mathfrak{P}_b = \sum_c β_{a,b}^c \mathfrak{P}_c$ is known, but no Littlewood-Richardson-style enumerative rule has been available. We give such a rule: $β_{a,b}^c$ counts pairs of forest RC graphs of forest-codes $a$ and $b$ whose lift product lands on a forest RC graph of forest-code and weight both equal to $c$. The same rule descends to the cup product on $H^\bullet(\mathrm{QFl}_n)$. The proof introduces a squash product $\boxtimes$ on RC graphs, which on full Grassmannian RC graphs of a fixed height recovers the plactic monoid, a multiplactic algebra $\mathcal{M}_n$ that models Schubert polynomial multiplication, and a lift product $*$ on RC graphs whose quasi-crystal structure, in the framework of Cain-Guilherme-Malheiro, transports the Nadeau-Tewari forest equivalence through the computation. The row-decomposition machinery on RC graphs that underlies these constructions is developed in a companion paper.

math.CO↗