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
Recommendations
Cites work
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 3842627 (Why is no real title available?)
- scientific article; zbMATH DE number 4067064 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- scientific article; zbMATH DE number 718851 (Why is no real title available?)
- scientific article; zbMATH DE number 1033392 (Why is no real title available?)
- scientific article; zbMATH DE number 1182906 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- A monotonicity property of h-vectors and h^*-vectors
- Anti-blocking polyhedra
- Birkhoff's theorem and convex hulls of Coxeter groups
- Blocking and anti-blocking pairs of polyhedra
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- Classes of perfect graphs
- Classification of reflexive polyhedra in three dimensions
- Combinatorial Reciprocity Theorems
- Combinatorics of Coxeter Groups
- Complete classification of reflexive polyhedra in four dimensions
- Compressed polytopes and statistical disclosure limitation
- Computing the Continuous Discretely
- Convex Bodies The Brunn-MinkowskiTheory
- Convex Bodies, Graphs and Partial Orders
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Decompositions of Rational Convex Polytopes
- Delannoy orthants of Legendre polytopes
- Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties
- Dual polytopes of rational convex polytopes
- Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley
- Ehrhart series of polytopes related to symmetric doubly-stochastic matrices
- Enriched chain polytopes
- Face numbers of centrally symmetric polytopes produced from Split graphs
- Faces of Birkhoff Polytopes
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Geometric algorithms and combinatorial optimization.
- Geometry of isotropic convex bodies
- Gorenstein algebras of Veronese type
- Gorenstein cut polytopes
- Gorenstein polytopes obtained from bipartite graphs
- Grid graphs, Gorenstein polytopes, and domino stackings
- Hilbert functions of graded algebras
- Hodge theory for combinatorial geometries
- Ideals, Varieties, and Algorithms
- Kernels in perfect line-graphs
- Lectures on Polytopes
- Maximal chains and antichains
- Minimal Volume-Product in Banach Spaces with a 1-Unconditional Basis
- Mirror symmetry and polar duality of polytopes
- Normal hypergraphs and the perfect graph conjecture
- Normality and covering properties of affine semigroups
- On Kalai's conjectures concerning centrally symmetric polytopes
- On graphs whose maximal cliques and stable sets intersect
- Polytopes, Rings, and K-Theory
- Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes
- Simion's type \(B\) associahedron is a pulling triangulation of the Legendre polytope
- Special simplices and Gorenstein toric rings.
- The Ehrhart polynomial of the Birkhoff polytope
- The Martin Gardner Polytopes
- The asymptotic volume of the Birkhoff polytope
- Triangulations. Structures for algorithms and applications
- Two double poset polytopes
- Two poset polytopes
- Une caractérisation volumique de certains espaces normés de dimension finie. (A volume characterization of some finite dimensional normed spaces)
- Vertex-transitive CIS graphs
- h-vectors of Gorenstein polytopes
Cited in
(8)- Reflexive polytopes arising from partially ordered sets and perfect graphs
- Partial permutation and alternating sign matrix polytopes
- Two enriched poset polytopes
- Reflexive polytopes arising from edge polytopes
- The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
- Reflexive polytopes arising from perfect graphs
- Kalai's \(3^d\) conjecture for unconditional and locally anti-blocking polytopes
- Weighted Ehrhart series and a type-\(\mathsf{B}\) analogue of a formula of MacMahon
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)
