---
title: Macdonald–Torrilhon Interpolants
url: https://www.emergentmind.com/topics/mcdonald-torrilhon-interpolants
type: topic
---

# Macdonald–Torrilhon Interpolants

The Macdonald–Torrilhon interpolants, also known as interpolation Macdonald polynomials in the literature of Knop and Sahi, arise as inhomogeneous generalizations of Macdonald polynomials. They are uniquely characterized by normalization and vanishing properties at explicit interpolation points indexed by compositions, and at $q=1$ admit a probabilistic interpretation as partition functions of an inhomogeneous multispecies $t$-Push TASEP Markov chain. These polynomials, together with their nonsymmetric companions (the interpolation ASEP polynomials), link algebraic combinatorics with interacting particle systems and generalize earlier work connecting Macdonald polynomials to integrable Markov chains [2602.13492].

## 1. Definition and Characterization

The Knop–Sahi interpolation Macdonald polynomials $P^*_\lambda(x_1,\dots,x_n;q,t)$ are defined for a partition $\lambda=(\lambda_1\ge\cdots\ge\lambda_n\ge0)$, with $m_\lambda(x_1,\dots,x_n)$ the associated monomial symmetric function. For any composition $\nu=(\nu_1,\dots,\nu_n)$, the evaluation point is
\[
\overline\nu = (q^{\nu_1} t^{-k_1(\nu)},\, \dots,\, q^{\nu_n} t^{-k_n(\nu)}),
\]
where
\[
k_i(\nu) = \#\{\,j<i:\nu_j>\nu_i\} + \#\{\,j>i:\nu_j\ge\nu_i\}.
\]
The defining conditions are:

- **Normalization:** The coefficient of $m_\lambda$ in $P^*_\lambda$ is $1$.
- **Vanishing:** For any partition $\nu\ne\lambda$ with $|\nu|\le|\lambda|$, the interpolant vanishes at the evaluation point: $P^*_\lambda(\overline\nu) = 0$.
- **Homogeneous Limit:** The top homogeneous component is the usual Macdonald polynomial $P_\lambda(x;q,t)$.

At $q=t$, these polynomials yield interpolation Schur functions via a determinantal formula; in general, tableaux-sum formulas of Okounkov type apply.

## 2. Interpolation ASEP Polynomials and Symmetrization

Given $\lambda$ as above, for each composition $\mu$ in the $S_n$-orbit of $\lambda$ (that is, each composition of $\lambda$ obtained by permuting parts), there exists a uniquely defined interpolation ASEP polynomial
\[
F^*_\mu(x_1,\dots,x_n;q,t) \in \mathbb{Q}(q,t)[x_1,\dots,x_n]
\]
of total degree $|\lambda|$. The defining conditions are:

- **Monomial Normalization:** $[x^\mu]\,F^*_\mu = 1$.
- **Vanishing:** For every $\nu\notin S_n(\lambda)$ with $|\nu|\le|\lambda|$, $F^*_\mu(\overline\nu)=0$.

These $F^*_\mu$ interpolate the homogeneous ASEP/Macdonald–basement polynomials $F_\mu(x;q,t)$ at leading degree. The symmetrization relation holds:
\[
P^*_\lambda(x;q,t) = \sum_{\mu\in S_n(\lambda)} F^*_\mu(x;q,t).
\]

## 3. Probabilistic Interpretation at \texorpdfstring{$q=1$}{q=1} via Markov Chains

Specializing to $q=1$, the polynomials $F^*_\mu(x;1,t)$ and $P^*_\lambda(x;1,t)$ acquire a probabilistic interpretation via the interpolation $t$-Push TASEP Markov chain defined on the finite state space $S_n(\lambda)$:
\[
S_n(\lambda) = \{\mu \mid \mu\text{ is a permutation of }\lambda\}.
\]
The transition mechanism, parameterized by $x_1,\dots,x_n$ and $0<t<1$, consists of:

- **Step 0:** Randomly select site $j$ with explicit probability $P_j$ as a function of inhomogeneities.
- **Step 1:** The particle at $j$ initiates the $t$-Push TASEP dynamic, displacing weaker particles or vacancies cyclically with probability depending on $t$.
- **Step 2:** The vacancy attempts to displace other particles as it traverses the ring, with displacement rates depending on the $x_i$ and $t$.

It is established that the Markov chain is irreducible and admits a unique stationary measure. The stationary probability for $\mu$ is
\[
\pi^*(\mu) = \frac{F^*_\mu(x_1,\dots,x_n;1,t)}{P^*_\lambda(x_1,\dots,x_n;1,t)},
\]
rendering $P^*_\lambda(x;1,t)$ as the partition function. This generalizes prior interpretations of symmetric Macdonald polynomials $P_\lambda(x;1,t)$ via homogeneous multispecies $t$-Push TASEP [2602.13492].

## 4. Illustrative Special Cases

Certain concrete partitions yield closed forms for the polynomials and the Markov chain rates:

- **One-Column Partition $\lambda=(1^m,0^{n-m})$:** Here, 
  \[
  F^*_\mu(x;1,t) = \prod_{i\in S_\mu} \left(x_i - t^{|\{j<i:\mu_j=0\}|}/t^{n-1}\right),
  \]
  and
  \[
  P^*_\lambda(x;1,t) = \sum_{\mu\in S_n(\lambda)} F^*_\mu(x;1,t) = e^*_m(x_1,\dots,x_n;t),
  \]
  where $e^*_m$ is a deformed elementary symmetric function. The corresponding chain is the inhomogeneous Push-TASEP for a single species.

- **One-Row Partition $\lambda=(d,0,\dots,0)$:** The interpolation polynomial admits
  \[
  P^*_{(d,0,\dots,0)}(x;1,t) = \sum_{S\subseteq\{1,\dots,n\},\,|S|=d} \prod_{i\in S}(x_i-t^{-(n-1)}) \prod_{j\notin S}(1-t\,x_j\,t^{n-2}),
  \]
  and the corresponding $F^*_\mu$ share this structure across $\mu$. This case gives explicit closed forms for stationary distributions in the single-type limit of the Markov chain.

## 5. Structural and Theoretical Implications

The Macdonald–Torrilhon interpolants establish an explicit Markov-chain framework for interpolated symmetric functions and polynomials. The sum-to-symmetrization property relates the combinatorially defined $F^*_\mu$ to their symmetric sum $P^*_\lambda$, reflecting deep connections between inhomogeneous interacting particle systems (such as the $t$-Push TASEP) and modern algebraic combinatorics. Setting all $x_i\to\infty$ recovers the homogeneous case, bridging interpolation Macdonald theory and classic symmetric function results.

A significant open direction is to realize a $q$-deformed Markov chain that yields the full two-parameter polynomials $F^*_\mu(x;q,t)$ in the stationary distribution, or to find an algebraic structure underlying such dynamics. Such a development would extend the intertwining of probability and symmetric function theory to completely general Macdonald–Torrilhon interpolants.

## 6. Research Context and Further Directions

The construction and interpretation of Macdonald–Torrilhon interpolants in terms of inhomogeneous Markov dynamics continue an active research trajectory connecting integrable probability, algebraic combinatorics, and representation theory. This approach builds on the work of Knop, Sahi, Okounkov (tableaux-formulas), and recent connections by Ayyer, Martin, Williams, and Ben Dali and Williams, who provide the explicit Markov chain realization and explore its consequences [2602.13492]. The possibility of further generalizing these connections to the full $(q,t)$ parameter regime, and to broader classes of stochastic vertex models or quantum integrable systems, remains an inviting direction for current research.

Source: https://www.emergentmind.com/topics/mcdonald-torrilhon-interpolants