A combinatorial formula for Interpolation Macdonald polynomials
Abstract
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these interpolation Macdonald polynomials are closely connected to the Hecke algebra, and admit nonsymmetric versions, which generalize the nonsymmetric Macdonald polynomials. In this paper we give a combinatorial formula for interpolation Macdonald polynomials in terms of signed multiline queues; this formula generalizes the combinatorial formula for Macdonald polynomials in terms of multiline queues given by Corteel-Mandelshtam-Williams.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.