This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have minimal and maximal volume. We give a combinatorial characterization of the circuits in these order polytopes and then conclude that every triangulation is unimodular. For a generalized snake word, we count the number of flips for the canonical triangulation of these order polytopes. We determine that the flip graph of the order polytope of the poset whose lattice of filters comes from a ladder is the Cayley graph of a symmetric group. Lastly, we introduce an operation on triangulations called twists and prove that twists preserve regular triangulations.
|Journal||Seminaire Lotharingien de Combinatoire|
|State||Published - 2022|
Bibliographical noteFunding Information:
∗email@example.com. Partially supported by the National Science Foundation under Award DMS-1953785. †firstname.lastname@example.org. Partially supported by the National Science Foundation under Award DMS-2102921.
© 2022, Seminaire Lotharingien de Combinatoire. All Rights Reserved.
- generalized snake poset
- order polytope
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics