arXiv:2212.04032 [math.CO]AbstractReferencesReviewsResources
Monk rules for type $GL_n$ Macdonald polynomials
Published 2022-12-08Version 1
In this paper we give Monk rules for Macdonald polynomials which are analogous to the Monk rules for Schubert polynomials. These formulas are similar to the formulas given by Baratta (2008), but our method of derivation is to use Cherednik's interwiners. Deriving Monk rules by this technique addresses the relationship between the work of Baratta and the product formulas of Yip (2010). Specializations of the Monk formula's at $q=0$ and/or $t=0$ provide Monk rules for Iwahori-spherical polynomials and for finite and affine key polynomials.
Related articles: Most relevant | Search more
arXiv:0803.1146 [math.CO] (Published 2008-03-05)
A combinatorial formula for Macdonald polynomials
arXiv:0804.4716 [math.CO] (Published 2008-04-30)
On Combinatorial Formulas for Macdonald Polynomials
arXiv:1106.3296 [math.CO] (Published 2011-06-16)
From Macdonald Polynomials to a Charge Statistic beyond Type A