Search arXivSearch

arXiv · 2602.13492

A probabilistic interpretation for interpolation Macdonald polynomials

Abstract

Previous work of Ayyer, Martin, and Williams gave a probabilistic interpretation of the Macdonald polynomials $P_λ(x_1,\dots,x_n;1,t)$ at $q=1$ in terms of a Markov chain called the multispecies $t$-Push TASEP, a Markov chain involving particles of types $λ_1,\dots,λ_n$ hopping around a ring. In particular, they showed that for each composition $η$ obtained by permuting the parts of $λ$, the stationary probability of being in state $η$ is proportional to the ASEP polynomial $F_η(x_1,\dots,x_n; 1,t)$, and the normalizing constant (or partition function) is $P_λ(x_1,\dots,x_n; 1,t)$. There is an inhomogeneous generalization of Macdonald polynomials due to Knop and Sahi called interpolation Macdonald polynomials $P^*_λ(x_1,\dots,x_n;q,t)$, as well as an inhomogeneous generalization of ASEP polynomials called interpolation ASEP polynomials $F^*_η(x_1,\dots,x_n;q,t)$ that we introduced in previous work. In this article we introduce a new Markov chain called the interpolation $t$-Push TASEP, and show that its steady state probabilities and partition function are given by the interpolation ASEP polynomials and the interpolation Macdonald polynomial, evaluated at $q=1$. This generalizes the previous result of Ayyer, Martin, and Williams.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Houcine Ben Dali, Lauren Williams. 2026-02-13. A probabilistic interpretation for interpolation Macdonald polynomials. https://arxiv.org/abs/2602.13492

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