Search arXivSearch

arXiv · 2508.04666

New formulas for Macdonald polynomials via the multispecies exclusion and zero range processes

Abstract

We describe some recently discovered connections between one-dimensional interacting particle models and Macdonald polynomials. The first such model is the multispecies asymmetric simple exclusion process (ASEP) on a ring, linked to the symmetric Macdonald polynomial $P_λ(X;q,t)$ through its partition function. Through this connection, a new formula was found for $P_λ$ by generalizing multiline queues, which were introduced by Martin in 2018 to compute stationary probabilities of the ASEP. The second particle model is the multispecies totally asymmetric zero range process (TAZRP) on a ring, which was very recently found to have an analogous connection to the modified Macdonald polynomial $\widetilde{H}_λ(X;q,t)$ through its partition function. This discovery coincided with a new formula for $\widetilde{H}_λ$, this time in terms of tableaux with a queue inversion statistic, which also compute stationary probabilities of the TAZRP. We explain the plethystic relationship between multiline queues and queue inversion tableaux, and along the way, derive a new formula for $P_λ$ using the queue inversion statistic. This plethystic correspondence is closely related to fusion in the setting of integrable systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olya Mandelshtam. 2025-08-06. New formulas for Macdonald polynomials via the multispecies exclusion and zero range processes. https://doi.org/10.1090/conm%2F815%2F16316

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