加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本