2000 character limit reached
Five-term relation and Macdonald polynomials
Published 29 Apr 2016 in math.CO, math.QA, and math.RT | (1604.08655v2)
Abstract: The non-commutative five-term relation $T_{1,0} T_{0,1} = T_{0,1} T_{1,1} T_{1,0}$ is shown to hold for certain operators acting on symmetric functions. The "generalized recursion" conjecture of Bergeron and Haiman is a corollary of this result.
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.