2000 character limit reached
Monk rules for type $GL_n$ Macdonald polynomials
Published 8 Dec 2022 in math.CO and math.RT | (2212.04032v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.