Determinantal expression and recursion for Jack polynomials (Q1964487): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161526
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lascoux, Alain / rank
 
Normal rank

Revision as of 21:24, 9 February 2024

scientific article
Language Label Description Also known as
English
Determinantal expression and recursion for Jack polynomials
scientific article

    Statements

    Determinantal expression and recursion for Jack polynomials (English)
    0 references
    0 references
    0 references
    0 references
    17 February 2000
    0 references
    The Jack polynomials \(J_{\lambda}[x_1,\ldots,x_N;\alpha]\) form a basis for the space of symmetric polynomials in \(N\) variables; the specialization \(\alpha=1\) in \(J_{\lambda}[x;\alpha]\) gives the Schur function \(s_{\lambda}[x]\). The main purpose of the paper under review is to give a matrix with determinant equal to \(J_{\lambda}[x;\alpha]\). The matrix under consideration has only one nonzero subdiagonal. This gives rise to a simple recursion which may be used for the rapid computation of Jack polynomials. As a consequence of these results the authors obtain a new determinantal form for the Schur functions and a recursion for the Kostka numbers which express the coefficients of the Schur functions in terms of the monomial basis. The authors illuminate their results with successfully selected examples.
    0 references
    0 references
    symmetric functions
    0 references
    Schur functions
    0 references
    Jack polynomials
    0 references
    Kostka numbers
    0 references