The binomial formula for nonsymmetric Macdonald polynomials
Siddhartha Sahi
Abstract
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a multivariable generalization of the q-binomial theorem. It is becoming clear that many interesting results in the symmetric setting can also be established in the nonsymmetric setting. In this paper, we prove the nonsymmetric analogue the binomial formula, and also discuss the limiting case of Jack polynomials.
Create a lesson
Related papers
Coherence Constraints for Operads, Categories and Algebras
Martin Markl, Steve Shnider
Affine Sergeev Algebra and q-Analogues of the Young Symmetrizers for Projective Representations of the Symmetric Group
Andrew Jones, Maxim Nazarov
Nonsymmetric Koornwinder polynomials and duality
Siddhartha Sahi
Capelli Identities for Classical Lie Algebras
Alexander Molev, Maxim Nazarov
On modules associated to coalgebra Galois extensions
Tomasz Brzezinski
Web bases for sl(3) are not dual canonical
Mikhail Khovanov, Greg Kuperberg