2000 character limit reached
Multiplicity-free key polynomials
Published 17 Jul 2020 in math.CO | (2007.09229v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.