An area-bounce exchanging bijection on a large subset of Dyck paths
Arvind Ayyer, Naren Sundaravaradan
TL;DR
This work tackles the long-standing problem of a bijection exchanging area and bounce on Dyck paths by constructing an explicit bijection that is natural on a large, exponentially rich subset of paths. The approach hinges on a calculus of path operators and AB-pairs, assembling a flip map $oldsymbol{ ext{Phi}}$ between two structured families and proving a symmetrical distribution $G_n(q,t)=G_n(t,q)$ on that subfamily. The authors further extend the construction via a two-parameter framework to broaden the AB-pair landscape and develop area-minimal and bounce-minimal theory, including operators $U_i$ and $D_i$ and results about intermediate ab-values. Finally, they connect the distinct sums $oldsymbol{a}( au)+oldsymbol{b}( au)$ to Johnson's $q$-Bell polynomial, showing the number of distinct sums equals the number of nonzero coefficients in $B_n(q)$, thereby linking Dyck-path statistics to a classical $q$-analogue and advancing Haglund's open problem with a concrete combinatorial bridge.
Abstract
It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-minimal paths to area-minimal paths. As a consequence of the proof ideas, we show combinatorially that a path with area $a$ and bounce $b$ exists if and only if a path with area $b$ and bounce $a$ exists. We finally show that the number of distinct values of the sum of the area and bounce statistics is the number of nonzero coefficients in Johnson's $q$-Bell polynomial.
