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.












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)