2000 character limit reached
Shellability of Kohnert posets (2404.17432v1)
Published 26 Apr 2024 in math.CO
Abstract: In this paper, we are concerned with identifying among the family of posets associated with Kohnert polynomials, those whose order complex has a certain combinatorial property. In particular, for numerous families of Kohnert polynomials, including key polynomials, we determine when the associated Kohnert posets are (EL-)shellable. Interestingly, under certain diagram restrictions, (EL-)shellability of a Kohnert poset is equivalent to multiplcity freeness of the associated Kohnert polynomial.
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.