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

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.