Intervals in Dyck paths and the wreath conjecture
Jan Petr, Pavel Turek
TL;DR
The paper counts intervals of length $m$ containing exactly $l$ falls across all Dyck paths of semilength $k$, denoted $\iota_k(m,l)$. It derives a closed-form expression for $\iota_k(m,l)$ in terms of binomial coefficients, including an alternative form, and proves the special case $\iota_k(k,l)=\binom{k}{l}^2$. Motivated by this combinatorial data, the authors propose strengthened variants of Baranyai–Katona's wreath conjecture for $n=2k+1$ and show that the corollary provides a necessary condition for these conjectures; they verify the conjectures computationally for small $k$ and develop a NE upper-path and ballot-number framework to support the enumeration results.
Abstract
Let $ι_{k}(m,l)$ denote the total number of intervals of length $m$ across all Dyck paths of semilength $k$ such that each interval contains precisely $l$ falls. We give the formula for $ι_{k}(m,l)$ and show that $ι_{k}(k,l)=\binom{k}{l}^2$. Motivated by this, we propose two stronger variants of the wreath conjecture due to Baranyai for $n=2k+1$.
