Papers
Topics
Authors
Recent
Search
2000 character limit reached

On ranked and bounded Kohnert posets

Published 14 Sep 2023 in math.CO | (2309.07747v1)

Abstract: In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for when they are ranked. Moreover, we apply the aforementioned conditions to find complete characterizations of when Kohnert posets are bounded and when they are ranked in special cases, including those associated with Demazure characters.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.