Levelness of Order Polytopes
From MaRDI portal
Publication:6301313
DOI10.1137/19M1292345arXiv1805.02967MaRDI QIDQ6301313FDOQ6301313
Florian Kohl, Christian Haase, Akiyoshi Tsuchiya
Publication date: 8 May 2018
Abstract: Since their introduction by Stanley~cite{StanleyOrderPoly} order polytopes have been intriguing mathematicians as their geometry can be used to examine (algebraic) properties of finite posets. In this paper, we follow this route to examine the levelness property of order polytopes. The levelness property was also introduced by Stanley~cite{Stanley-CM-complexes} and it generalizes the Gorenstein property. This property has been recently characterized by Miyazaki~cite{Miyazaki} for the case of order polytopes. We provide an alternative characterization using weighted digraphs. Using this characterization, we give a new infinite family of level posets and show that determining levelness is in . This family can be used to create infinitely many examples illustrating that the levelness property can not be characterized by the -vector. We then turn to the more general family of alcoved polytopes. We give a characterization for levelness of alcoved polytopes using the Minkowski sum. Then we study several cases when the product of two polytopes is level. In particular, we provide an example where the product of two level polytopes is not level.
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Algebraic aspects of posets (06A11)
This page was built for publication: Levelness of Order Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301313)
