A recursion and a combinatorial formula for Jack polynomials
Friedrich Knop, Siddhartha Sahi
Abstract
Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the non-symmetric ones. These formulas are then implemented by a closed expression of symmetric and non-symmetric Jack polynomials in terms of certain tableaux. The main application is a proof of a conjecture of Macdonald stating certain integrality and positivity properties 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