Multiplicity-free key polynomials
From MaRDI portal
Publication:6170067
Abstract: The key polynomials, defined by A. Lascoux-M.-P. Sch"utzenberger, are characters for the Demazure modules of type A. We classify multiplicity-free key polynomials. The proof uses two combinatorial models for key polynomials. The first is due to A. Kohnert. The second is by S. Assaf-D. Searles, in terms of quasi-key polynomials. Our argument proves a sufficient condition for a quasi-key polynomial to be multiplicity-free.
Recommendations
Cites work
- An explicit construction of type A Demazure atoms
- Coxeter combinatorics and spherical Schubert geometry
- scientific article; zbMATH DE number 14020 (Why is no real title available?)
- Key polynomials and a flagged Littlewood-Richardson rule
- Kohnert Polynomials
- Kohnert tableaux and a lifting of quasi-Schur functions
- Kohnert's rule for flagged Schur modules
- Nonsymmetric Macdonald polynomials and Demazure characters.
- Polynomial bases: positivity and Schur multiplication
- Zero-one Schubert polynomials
Cited in
(10)- Slide multiplicity free key polynomials
- Key polynomials
- Locks fit into keys: a crystal analysis of lock polynomials
- Lattice points in the Newton polytopes of key polynomials
- Monk's rule for Demazure characters of the general linear group
- Classification of Levi-spherical Schubert varieties
- Upper bounds of dual flagged Weyl characters
- On ranked and bounded Kohnert posets
- Shellability of Kohnert posets
- Kohnert posets and polynomials of northeast diagrams
This page was built for publication: Multiplicity-free key polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170067)