Abstract
We describe properties of the affine graph underlying the recursions between the different varieties of nonsymmetric Macdonald and Jack polynomials. We use an arbitrary function of one variable in the definition of affine edges, and of Cherednik's elements, to unify the different theories. We describe the symmetrizing operators furnishing the symmetric polynomials from the nonsymmetric ones.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
