Elementary moves on lattice polytopes

DOI10.1016/J.JCTA.2019.105200zbMATH Open1433.05084arXiv1810.00185OpenAlexW2893331493WikidataQ126348323 ScholiaQ126348323MaRDI QIDQ2299641FDOQ2299641

Rado Rakotonarivo, Lionel Pournin, Julien David

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either inserting or deleting a vertex, while keeping their vertex sets otherwise unaffected. We prove several results on the connectivity of this graph, and on a number of its subgraphs. We are especially interested in several families of subgraphs induced by lattice polytopes, such as the subgraphs induced by the lattice polytopes with $n$ or $n+1$ vertices, that turn out to exhibit intriguing properties.

Full work available at URL: https://arxiv.org/abs/1810.00185

Recommendations

• Extremal edge polytopes
• scientific article; zbMATH DE number 3929064
• A short proof of the \(d\)-connectedness of \(d\)-polytopes
• A simple way to tell a simple polytope from its graph
• On linkages in polytope graphs

zbMATH Keywords

lattice polytopesconvex hullsgraph connectivityelementary transformationsflip-graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)

Cites Work

• Enumeration of lattice 3-polytopes by their number of lattice points
• Non-spanning lattice 3-polytopes
• Finitely many smooth \(d\)-polytopes with \(n\) lattice points
• Projecting lattice polytopes without interior lattice points
• Quantum jumps of normal polytopes
• Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• On the diameter of convex polytopes
• The Hirsch conjecture is true for (0,1)-polytopes
• On the diameter of lattice polytopes
• Lattice points in simple polytopes
• On the maximal width of empty lattice simplices
• Title not available (Why is that?)
• On empty lattice simplices in dimension 4
• The convex hull of the integer points in a large ball
• Classifying smooth lattice polytopes via toric fibrations
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• On the width of lattice-free simplices
• Improved bounds on the diameter of lattice polytopes
• On the Number of Convex Lattice Polygons
• Primitive zonotopes
• Eventual quasi-linearity of the Minkowski length
• On the number of lattice free polytopes
• Lattice-free polytopes and their diameter
• Flip-graph moduli spaces of filling surfaces
• Classification of empty lattice 4-simplices of width larger than two
• On the realization space of the cube

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Elementary moves on lattice polytopes

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