Tableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions

@article{Lapointe2005TableauxOK,
  title={Tableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions},
  author={Luc Lapointe and Jennifer Morse},
  journal={J. Comb. Theory, Ser. A},
  year={2005},
  volume={112},
  pages={44-81}
}

Figures from this paper

Order Ideals in Weak Subposets of Young’s Lattice and Associated Unimodality Conjectures

AbstractThe k-Young lattice Yk is a weak subposet of the Young lattice containing partitions whose first part is bounded by an integer k > 0. The Yk poset was introduced in connection with

k-SHAPE POSET AND BRANCHING OF k-SCHUR FUNCTIONS

We give a combinatorial expansion of a Schubert homology class in the affine Grassmannian GrSLk into Schubert homology classes in GrSLk+1 . This is achieved by studying the combinatorics of a new

Charge on tableaux and the poset of k-shapes

Skew-Linked Partitions and a Representation-Theoretic Model for k-Schur Functions

Author(s): Chen, Li-Chung | Advisor(s): Haiman, Mark D | Abstract: In 2001, Lapointe, Lascoux, and Morse discovered a class of symmetric functions called k-Schur functions. These functions have many

Affine dual equivalence and $k$-Schur functions

The k-Schur functions were first introduced by Lapointe, Lascoux and Morse [18] in the hopes of refining the expansion of Macdonald polynomials into Schur functions. Recently, an alternative

K-theoretic Catalan functions

Closed $k$-Schur Katalan functions as $K$-homology Schubert representatives of the affine Grassmannian

Recently, Blasiak-Morse-Seelinger introduced symmetric functions called Katalan functions, and proved that the K -theoretic k -Schur functions due to Lam-Schilling-Shimozono form a subfamily of the
...

References

SHOWING 1-10 OF 23 REFERENCES

Order Ideals in Weak Subposets of Young’s Lattice and Associated Unimodality Conjectures

AbstractThe k-Young lattice Yk is a weak subposet of the Young lattice containing partitions whose first part is bounded by an integer k > 0. The Yk poset was introduced in connection with

Schur function analogs for a filtration of the symmetric function space

Hilbert schemes, polygraphs and the Macdonald positivity conjecture

We study the isospectral Hilbert scheme X_n, defined as the reduced fiber product of C^2n with the Hilbert scheme H_n of points in the plane, over the symmetric power S^n C^2. We prove that X_n is

Upper Bounds in Affine Weyl Groups under the Weak Order

It is determined that the question of which pairs of elements of W have upper bounds can be reduced to the analogous question within a particular finite subposet within an affine Weyl group W0.

CRANKS AND T -CORES

New statistics on partitions (called cranks) are defined which combinatorially prove Ramanujan’s congruences for the partition function modulo 5, 7, 11, and 25. Explicit bijections are given for the

Algebraic Combinatorics And Quantum Groups

* Uno's Conjecture on Representation Types of Hecke Algebras (S Ariki) * Quiver Varieties, Afine Lie Algebras, Algebras of BPS States, and Semicanonical Basis (I Frenkel et al.) * Divided Differences

Young Tableaux: With Applications to Representation Theory and Geometry

Part I. Calculus Of Tableux: 1. Bumping and sliding 2. Words: the plactic monoid 3. Increasing sequences: proofs of the claims 4. The Robinson-Schensted-Knuth Correspondence 5. The

A graded representation model for Macdonald's polynomials.

  • A. GarsiaM. Haiman
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1993
We define doubly graded Sn modules Rmu for which we conjecture that the multiplicities of irreducible representations in various bi-degrees are given by the Macdonald coefficients Klambdamu. Assuming

Tableaux statistics for two part Macdonald polynomials

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they

Affine permutations of type A

We study combinatorial properties, such as inversion table, weak order and Bruhat order, for certain infinite permutations that realize the affine Coxeter group $\tilde{A}_{n}$.