Macdonald polynomials at t = 0 through twisted multiline queues
Olya Mandelshtam, Jer\'onimo Valencia-Porras

TL;DR
This paper introduces new combinatorial formulas for Macdonald and related polynomials at t=0 using twisted multiline queues, extending existing algorithms and connecting to crystal theory.
Contribution
It defines a new maj statistic on GMLQs, extends formulas for q-Whittaker polynomials, and links collapsing procedures to crystal operators, providing a unified combinatorial framework.
Findings
New formulas for q-Whittaker polynomials indexed by compositions.
Extension of Ferrari--Martin algorithm to twisted multiline queues.
Recovery of classical charge and Cauchy identities for symmetric functions.
Abstract
Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of Corteel--Mandelshtam--Williams (2018) to the case yields a formula for the -Whittaker polynomials through the Ferrari--Martin (2007) algorithm with a major index () statistic. In this paper, we reinterpret the statistic as a statistic on reading words, thereby bypassing the Ferrari--Martin algorithm to obtain an elegant formula for the -Whittaker polynomials. Our methods naturally extend to the case of bosonic multiline queues, with which we obtain analogous results for the modified Hall--Littlewood polynomials using a statistic on reading words. Twisted multiline queues…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Polynomial and algebraic computation
