A recursion and a combinatorial formula for Jack polynomials

dc.creatorKnop, Friedrich
dc.creatorSahi, Siddhartha
dc.date1996-10-15
dc.date.accessioned2026-07-07T09:17:17Z
dc.date.available2026-07-07T09:17:17Z
dc.descriptionHeckman 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.
dc.descriptionPreprint March 1996, to appear in Invent. Math., 15 pages, Plain TeX
dc.identifierhttps://arxiv.org/abs/q-alg/9610016
dc.identifierhttp://arxiv.org/abs/q-alg/9610016
dc.identifierInvent. Math. 128 (1997), 9-22
dc.identifierdoi:10.1007/s002220050134
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/153611
dc.subjectQuantum Algebra
dc.subject05Exx, 33Cxx
dc.titleA recursion and a combinatorial formula for Jack polynomials
dc.typetext

Files

Collections