Pith. sign in

REVIEW

On ranked and bounded Kohnert posets

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.07747 v1 pith:7NHDOURQ submitted 2023-09-14 math.CO

Laura Colmenarejo , Felix Hutchins , Nicholas Mayers , Etienne Phillips This is my paper · ORCID
classification math.CO
keywords kohnertposetswhenboundedrankedassociatedconditionsthey
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools