Search arXivSearch

arXiv · 2407.05362

Macdonald polynomials at t = 0 through twisted multiline queues

Abstract

Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of Corteel--Mandelshtam--Williams (2018) to the $t=0$ case yields a formula for the $q$-Whittaker polynomials through the Ferrari--Martin (2007) algorithm with a major index ($\texttt{maj}$) statistic. In this paper, we reinterpret the $\texttt{maj}$ statistic as a $\texttt{charge}$ statistic on reading words, thereby bypassing the Ferrari--Martin algorithm to obtain an elegant formula for the $q$-Whittaker polynomials. Our methods naturally extend to the case of bosonic multiline queues, with which we obtain analogous results for the modified Hall--Littlewood polynomials using a $\texttt{cocharge}$ statistic on reading words. Twisted multiline queues (GMLQs) are obtained from the action of the symmetric group on the rows of a multiline queue. The Ferrari--Martin algorithm was extended to GMLQs by Arita--Ayyer--Mallick--Prolhac (2011), and Aas--Grinberg--Scrimshaw (2020) showed it is preserved under this action. We extend these results by defining a $\texttt{maj}$ statistic on GMLQs that is also preserved under this action. This yields a novel family of formulas, indexed by compositions, for the $q$-Whittaker polynomials. Additionally, we define a procedure on both GMLQs and bosonic multiline queues that we call collapsing, which can can be realized via the Kashiwara (crystal) operators on type-A Kirillov--Reshetikhin crystals. As an application, we naturally recover the Lascoux--Schützenberger $\texttt{charge}$ formula for the $q$-Whittaker and modified Hall--Littlewood polynomials, and the classical and dual Cauchy identities for Schur functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olya Mandelshtam, Jerónimo Valencia-Porras. 2025-09-03. Macdonald polynomials at t = 0 through twisted multiline queues. https://arxiv.org/abs/2407.05362

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO