Intervals in Dyck paths and the wreath conjecture

Abstract: Let $\iota_{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 $\iota_{k}(m,l)$ and show that $\iota_{k}(k,l)=\binom{k}{l}<sup>2$. Motivated by this, we propose two stronger variants of the wreath conjecture due to Baranyai for $n=2k+1$.