Unconditional reflexive polytopes

From MaRDI portal
Publication:2197693



Abstract: A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties. In particular, we characterize unconditional reflexive polytopes in terms of perfect graphs. As a prime example, we study the signed Birkhoff polytope. Moreover, we derive constructions for Gale-dual pairs of polytopes and we explicitly describe Gr"obner bases for unconditional reflexive polytopes coming from partially ordered sets


A convex polytope \(P \subset \mathbb{R}^d\) is called \textit{unconditional} if \((\sigma_1 p_1 , \dots, \sigma_d p_d) \in P\) for all \((p_1,\dots,p_d) \in P\) and all \((\sigma_1,\dots,\sigma_d)\in \{\pm 1\}^d\). The paper under review studies unconditional polytopes from the viewpoint of discrete geometry and combinatorial commutative algebra. In particular, it is shown that a lattice polytope \(P\) is an unconditional reflexive polytope if and only if \(P\) is obtained from the stable set polytope of a perfect graph. As examples, some special lattice polytopes are studied: type-B Birkhoff polytopes, signed Birkhoff polytopes, lattice polytopes arising from perfect CIS graphs, and unconditional chain polytopes of posets. Note that unconditional chain polytopes of posets were independently introduced in [\textit{H. Ohsugi} and \textit{A. Tsuchiya}, Isr. J. Math. 237, No. 1, 485--500 (2020; Zbl 1453.52013)] under the name ``enriched chain polytopes, and the same Gröbner bases of such polytopes were constructed there.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Unconditional reflexive polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197693)