A probabilistic interpretation for interpolation Macdonald polynomials

This paper introduces the interpolation $t$-Push TASEP Markov chain to provide a probabilistic interpretation of interpolation Macdonald polynomials at $q=1$ as partition functions, thereby generalizing the earlier result linking standard Macdonald polynomials to the multispecies $t$-Push TASEP.

The Gist

Imagine a giant, circular racetrack. On this track, there are several cars of different colors (let's say Red, Blue, Green, and White). These cars don't just drive randomly; they follow very specific, quirky rules about how they overtake each other, how they stop, and how they interact with the "bells" ringing at different spots on the track.

This paper is about a new, super-complex version of this racetrack game, and the authors have discovered a magical secret: The long-term pattern of where these cars end up is exactly the same as a famous, complicated mathematical formula.

Here is the breakdown of the paper using simple analogies:

1. The Game: The "Interpolation t-Push TASEP"

Think of the racetrack as a ring of $n$ spots.

• The Players: There are cars (particles) with different "species" or labels (like 0, 1, 2, 3...).
• The Bell: At any moment, a bell rings at a random spot on the track.
• The Move: When the bell rings at spot $j$, the car there gets excited. It starts driving clockwise.
  • If it sees a "weaker" car (a lower number), it might push that car out of the way and take its spot.
  • If it sees a "stronger" car (a higher number), it might skip over it or push it, depending on a special probability rule involving a variable called $t$ and the specific location on the track ($x_1, x_2, \dots$).
• The Twist: In previous versions of this game, cars could only push weaker cars. In this new "Interpolation" version, cars can push anyone, and the rules change depending on exactly where you are on the track. This makes the game "inhomogeneous" (uneven).

2. The Mystery: Macdonald Polynomials

Mathematicians have been obsessed with a family of formulas called Macdonald Polynomials for decades. They are like the "Periodic Table" of algebraic shapes. They are incredibly complex, involving many variables ($x$) and parameters ($q, t$).

• The Old Discovery: A few years ago, researchers found that if you play a simpler version of the racetrack game (where the rules are the same everywhere), the probability of the cars ending up in a specific arrangement is given by a simpler version of these formulas.
• The New Discovery: This paper asks: What if the rules change depending on where you are on the track? (This is the "Interpolation" part). The authors built a new racetrack game (the Interpolation t-Push TASEP) and proved that the long-term probability of the cars settling into a specific pattern is given by the Interpolation Macdonald Polynomials.

3. The Secret Decoder: Multiline Queues

How did they prove this? They didn't just simulate the game on a computer; they built a bridge between the game and the math using a concept called Multiline Queues.

Imagine a stack of conveyor belts.

• The Bottom Belt: Represents the current state of the racetrack (where the cars are).
• The Top Belt: Represents the next state.
• The Strands: Imagine strings connecting a car on the bottom belt to a car on the top belt. These strings represent the "pushing" and "moving" actions.
• The Magic: The authors showed that if you count all the possible ways to draw these strings (with specific weights attached to them), the total count is exactly equal to the probability of that car arrangement happening in the game.

It's like saying: "If you count every possible way a domino can fall in a specific pattern, that number is exactly the same as the chance of a specific car arrangement on the track."

4. Why Does This Matter?

You might ask, "So what? It's just a game with math formulas."

• It Unifies Two Worlds: This paper connects Probability Theory (randomness, cars, traffic) with Algebraic Combinatorics (complex polynomials). It shows that deep, abstract mathematical structures actually govern random physical systems.
• It Solves a Hard Problem: The "Interpolation" polynomials were defined by mathematicians Knop and Sahi years ago, but they were just abstract definitions. This paper gives them a physical meaning. Now, instead of just being a formula on a page, they represent the steady-state of a real, moving system.
• It's a Generalization: This isn't just a one-off trick. It proves that a whole family of these formulas works for these types of particle systems, generalizing previous work.

The Big Picture Analogy

Imagine you are watching a busy city intersection.

• The Math: You have a giant, complex equation that predicts exactly how many red, blue, and green cars will be at each corner after an hour.
• The Paper: The authors realized that if you set up a specific set of traffic lights and rules for how cars merge (the "Interpolation t-Push TASEP"), the traffic flow naturally settles into the pattern predicted by that equation.
• The Takeaway: They didn't just guess the equation; they built the traffic system that creates the equation.

In short: The authors invented a new, slightly chaotic game of musical chairs with particles on a ring. They proved that the "final score" of this game is written in the language of advanced algebra, specifically the "Interpolation Macdonald Polynomials." This gives us a new way to understand these complex formulas by watching particles dance.

Technical Summary

1. Problem Statement

The paper addresses the challenge of providing a probabilistic interpretation for Interpolation Macdonald Polynomials ($P^*_\lambda$) and Interpolation ASEP Polynomials ($F^*_\eta$).

• Background: Previous work (Ayyer, Martin, Williams) established that standard Macdonald polynomials $P_\lambda$ (specialized at $q=1$) and ASEP polynomials $F_\eta$ arise as the partition function and stationary probabilities, respectively, of the multispecies $t$-Push TASEP (Totally Asymmetric Simple Exclusion Process) on a ring.
• The Gap: Interpolation Macdonald polynomials, introduced by Knop and Sahi, are inhomogeneous generalizations of standard Macdonald polynomials. They are defined by specific vanishing conditions rather than just homogeneity. While combinatorial formulas for these polynomials existed (via signed multiline queues), a corresponding Markov chain (stochastic process) whose stationary distribution is governed by these polynomials had not been constructed.
• Goal: Construct a new Markov chain, the Interpolation $t$-Push TASEP, such that its stationary distribution and partition function are exactly the Interpolation ASEP and Interpolation Macdonald polynomials evaluated at $q=1$.

2. Methodology

The authors employ a multi-step strategy combining probabilistic modeling, combinatorial queue theory, and algebraic properties of symmetric functions.

A. Defining the Markov Chain: Interpolation $t$-Push TASEP

The authors define a new Markov chain on the state space of compositions $\eta$ obtained by permuting the parts of a partition $\lambda$. The system consists of particles of various "species" (types) moving on a ring.

• Dynamics: The chain operates in three steps per transition:
  1. Bell Ringing: A position $j$ is selected with a probability $P_j$ dependent on the parameters $x_i$ and $t$.
  2. Step 1 (Standard $t$-Push): The particle at $j$ moves clockwise, pushing weaker particles (lower species or vacancies) according to standard $t$-Push TASEP rules. This step creates a vacancy at $j$.
  3. Step 2 (Return to Bell): The "vacancy" (now treated as a particle of type 0) travels clockwise from position 1 back to $j$. Crucially, unlike the standard model, this particle can displace particles of higher or lower species with probabilities dependent on the inhomogeneous parameters $x_k$. This step restores the vacancy to position $j$, completing the cycle.
• Key Feature: The transition probabilities in Step 2 are site-dependent and involve the parameters $x_i$, allowing the chain to encode the inhomogeneity of the interpolation polynomials.

B. Combinatorial Connection: Signed Multiline Queues

To prove the connection between the Markov chain and the polynomials, the authors utilize signed multiline queues, a combinatorial object introduced in their previous work [BDW25].

• Encoding Transitions: They demonstrate that the transition probabilities of the Markov chain correspond to the generating functions of signed two-line queues.
  • Step 1 corresponds to classical two-line queues (generating functions $a^\mu_\rho$).
  • Step 2 corresponds to signed two-line queues (generating functions $c^\rho_\nu$).
• Weighting: The weights assigned to these queues (involving factors like $x_k$ and $t$) are carefully constructed to match the transition rates $P_j, P^{(1)}_j, P^{(2)}_j$ of the Markov chain.

C. Algebraic Strategy: Recoloring and Lumping

The proof is divided into two phases:

1. Restricted Case (Distinct Parts): First, the theorem is proven for partitions $\lambda$ where all parts are distinct (and satisfy specific size constraints). In this case, the mapping between queue configurations and state transitions is bijective and unique, allowing a direct combinatorial proof that the stationary distribution is proportional to $F^*_\mu$.
2. General Case (Arbitrary Parts): To extend the result to partitions with repeated parts, the authors use a lumping (projection) argument.
   • They define a weakly order-preserving function $\phi: \mathbb{N} \to \mathbb{N}$.
   • Applying $\phi$ to the particle types "recolors" a fine-grained chain (distinct parts) into a coarser chain (repeated parts).
   • They prove that the stationary distribution of the coarse chain is the sum of the stationary distributions of the fine chain states that map to it.
   • Simultaneously, they prove an algebraic identity for the interpolation polynomials under this recoloring (Theorem 4.4), showing that the polynomials satisfy the same summation property.

3. Key Contributions

1. Construction of the Interpolation $t$-Push TASEP: The introduction of a novel Markov chain that generalizes the multispecies $t$-Push TASEP by incorporating site-dependent jump rates and a "return" mechanism (Step 2) that allows displacement of stronger particles.
2. Probabilistic Interpretation of Interpolation Polynomials: The main theorem (Theorem 1.10) establishes that:
   • The partition function of the chain is the Interpolation Macdonald Polynomial $P^*_\lambda(x; 1, t)$.
   • The stationary probability of a state $\mu$ is the Interpolation ASEP Polynomial $F^*_\mu(x; 1, t)$ normalized by the partition function.
3. Combinatorial Bridge: The rigorous demonstration that the transition probabilities of this complex stochastic process are exactly the generating functions of signed multiline queues.
4. Density Formulas: The derivation of explicit formulas for the particle density at specific sites (e.g., site 1 and site $n$) in terms of $t$-interpolation Schur polynomials and elementary interpolation polynomials.

4. Results

• Theorem 1.10: For the Interpolation $t$-Push TASEP with content $\lambda$ and parameters $x, t$, the stationary distribution $\pi^*_\lambda(\mu)$ is given by:
  $$\pi^*_\lambda(\mu) = \frac{F^*_\mu(x; 1, t)}{P^*_\lambda(x; 1, t)}$$
• Corollary 1.11: The distribution of the bottom line of signed multiline queues (with $q=1$) is identical to the stationary distribution of the Interpolation $t$-Push TASEP.
• Theorem 4.4: Establishes a compatibility relation for interpolation polynomials under weakly order-preserving maps (recoloring), which is essential for the lumping argument.
• Density Formulas (Section 6): Explicit expressions for the expected density of particles at the boundaries of the ring are derived, linking them to $t$-interpolation Schur polynomials.

5. Significance

• Unification of Algebra and Probability: This work bridges the gap between the algebraic theory of inhomogeneous symmetric functions (Knop-Sahi polynomials) and interacting particle systems. It confirms that the "inhomogeneity" in these polynomials has a natural physical interpretation as site-dependent jump rates in a stochastic process.
• Generalization of Existing Models: It generalizes the seminal results of Ayyer, Martin, and Williams (who connected standard Macdonald polynomials to the $t$-Push TASEP) to the broader class of interpolation polynomials.
• New Tools for Analysis: The introduction of the "Step 2" mechanism (Return to Bell TASEP) provides a new tool for studying particle systems where particles can interact non-monotonically (displacing stronger particles), which may have applications in other areas of statistical mechanics.
• Combinatorial Insight: By linking the Markov chain to signed multiline queues, the paper provides a concrete combinatorial model for calculating these polynomials, potentially leading to new algorithms for their evaluation and new identities in the theory of symmetric functions.

In summary, the paper successfully constructs a stochastic model that "realizes" the interpolation Macdonald polynomials, offering a probabilistic lens through which to view these complex algebraic objects and extending the reach of the TASEP framework to inhomogeneous settings.