Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions (Q2568969): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028946175 / rank
 
Normal rank

Revision as of 20:25, 19 March 2024

scientific article
Language Label Description Also known as
English
Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions
scientific article

    Statements

    Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions (English)
    0 references
    0 references
    0 references
    17 October 2005
    0 references
    The paper under review focuses on \(k\) bounded partitions -- those whose largest part is less than or equal to \(k\). These partitions have associated to them a \(k\)-Young lattice and \(k\)-Schur functions, and the related \(k\)-tableaux are defined in terms of \(k+1\)-cores. These objects originated in the study of Macdonald polynomials [\textit{L. Lapointe, A. Lascoux} and \textit{J. Morse}, Duke J. Math. 116, 103--146 (2003; Zbl 1020.05069); \textit{L. Lapointe} and \textit{J. Morse}, J. Comb. Theory, Ser. A 101, No.~2, 191--224 (2003; Zbl 1018.05101)]. The main result here establishes a bijection between particular saturated chains in the \(k\)-Young lattice and standard \(k\)-tableaux of particular shape. These \(k\)-tableaux are then conjectured to enumerate certain terms in the \(k\)-Schur function expansion of the Macdonald polynomials.
    0 references
    \(k\)-Schur functions
    0 references
    \(k\)-cores
    0 references
    Macdonald polynomials
    0 references

    Identifiers