A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. 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öbner bases for unconditional reflexive polytopes coming from partially ordered sets.Peer reviewe
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
We introduce a new notion that connects the combinatorial concept of regularity with the geometrical...
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hype...
Abstract. We introduce reflexive polytopes of index l as a natural generalisation of the notion of a...
For a $d$-dimensional convex lattice polytope $P$, a formula for the boundary volume $\vol{\partial ...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
AbstractWe suggest defining the structure of an unoriented graph Rd on the set of reflexive polytope...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive...
We suggest defining the structure of an unoriented graph Rd on the set of reflexive polytopes of a f...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Abstract. The concept of perfection of a polytope was introduced by S. A. Robertson. Intuitively spe...
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
We introduce a new notion that connects the combinatorial concept of regularity with the geometrical...
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hype...
Abstract. We introduce reflexive polytopes of index l as a natural generalisation of the notion of a...
For a $d$-dimensional convex lattice polytope $P$, a formula for the boundary volume $\vol{\partial ...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
AbstractWe suggest defining the structure of an unoriented graph Rd on the set of reflexive polytope...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive...
We suggest defining the structure of an unoriented graph Rd on the set of reflexive polytopes of a f...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Abstract. The concept of perfection of a polytope was introduced by S. A. Robertson. Intuitively spe...
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
We introduce a new notion that connects the combinatorial concept of regularity with the geometrical...