pith. sign in

arxiv: 1904.06804 · v1 · pith:K4PWIEMXnew · submitted 2019-04-15 · 🧮 math-ph · math.CO· math.MP· math.RT

Nonsymmetric Macdonald polynomials via integrable vertex models

classification 🧮 math-ph math.COmath.MPmath.RT
keywords functionspartitioncombinatorialensemblesintegrablemacdonaldmodelnonsymmetric
0
0 comments X
read the original abstract

Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $\mu = (\mu_1,\dots,\mu_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that acts on our partition functions, we show that they are eigenfunctions of the Cherednik-Dunkl operators $Y_i$ for all $1 \leq i \leq n$, and are thus equal to nonsymmetric Macdonald polynomials $E_{\mu}$. Our partition functions have the combinatorial interpretation of ensembles of coloured lattice paths which traverse a cylinder. Applying a simple bijection to such path ensembles, we show how to recover the well-known combinatorial formula for $E_{\mu}$ due to Haglund-Haiman-Loehr.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.