Search for: All records

We prove and extend the longest-standing conjecture in ‘ $q,t$-Catalan combinatorics,’ namely, the combinatorial formula for ${\mathrm{\nabla <\#comment/>}}^m{s}_{\mathrm{\mu <\#comment/>}}$conjectured by Loehr and Warrington, where $s_{\mathrm{\mu <\#comment/>}}$is a Schur function and $\mathrm{\nabla <\#comment/>}$is an eigenoperator on Macdonald polynomials. Our approach is to establish a stronger identity of infinite series of $G{L}_l$characters involvingSchur Catalanimals; these were recently shown by the authors to represent Schur functions $s_{\mathrm{\mu <\#comment/>}}[-<\#comment/>M{X}^{m,n}]$in subalgebras $\mathrm{\Lambda <\#comment/>}\left(X^{m,n}\right)\subset <\#comment/>\mathcal{E}$isomorphic to the algebra of symmetric functions $\mathrm{\Lambda <\#comment/>}$over $\mathbb{Q}(q,t)$, where $\mathcal{E}$is the elliptic Hall algebra of Burban and Schiffmann. We establish a combinatorial formula for Schur Catalanimals as weighted sums of LLT polynomials, with terms indexed by configurations of nested lattice paths callednests, having endpoints and bounding constraints controlled by data called aden. The special case for $\mathrm{\Lambda <\#comment/>}\left(X^{m,1}\right)$proves the Loehr-Warrington conjecture, giving ${\mathrm{\nabla <\#comment/>}}^m{s}_{\mathrm{\mu <\#comment/>}}$as a weighted sum of LLT polynomials indexed by systems of nested Dyck paths. In general, for $\mathrm{\Lambda <\#comment/>}\left(X^{m,n}\right)$our formula implies a new $(m,n)$version of the Loehr-Warrington conjecture. In the case where each nest consists of a single lattice path, the nests in a den formula reduce to our previous shuffle theorem for paths under any line. Both this and the $(m,n)$Loehr-Warrington formula generalize the $(km,kn)$shuffle theorem proven by Carlsson and Mellit (for $n=1$) and Mellit. Our formula here unifies these two generalizations.