Polytopes close to being simple

DOI10.1007/S00454-018-00053-YzbMATH Open1441.52010arXiv1704.00854OpenAlexW2613641366WikidataQ128777344 ScholiaQ128777344MaRDI QIDQ2189745FDOQ2189745

Authors: Guillermo Pineda-Villavicencio, Julien Ugon, David Yost 

Publication date: 16 June 2020

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and $d-2$, showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for $d$-polytopes with $d+k$ vertices and at most $d-k+3$ nonsimple vertices, provided $kge5$. For $kle4$, the same conclusion holds under a slightly stronger assumption. Another measure of deviation from simplicity is the {it excess degree} of a polytope, defined as $xi(P):=2f_1-d{f}_0$, where $f_k$ denotes the number of $k$-dimensional faces of the polytope. Simple polytopes are those with excess zero. We prove that polytopes with excess at most $d-1$ are reconstructible from their graphs, and this is best possible. An interesting intermediate result is that $d$-polytopes with less than $2d$ vertices, and at most $d-1$ nonsimple vertices, are necessarily pyramids.

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

Recommendations

• On simple polytopes
• Publication:4720332
• The almost simple cubical polytopes
• On polytopes that are simple at the edges
• On the faces of simple polytopes
• scientific article; zbMATH DE number 1368684
• Polytopes
• Simple 0/1-polytopes

zbMATH Keywords

simple polytope\(k\)-skeletonreconstructibility from graphs

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• polymake: a framework for analyzing convex polytopes
• Complete enumeration of small realizable oriented matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Polytopes
• A simple way to tell a simple polytope from its graph
• More indecomposable polyhedra
• Decomposable convex polyhedra
• Puzzles and polytope isomorphisms
• On the graph structure of convex polyhedra in \(n\)-space
• Title not available (Why is that?)
• The excess degree of a polytope
• Lower bound theorems for general polytopes
• On the reconstruction of polytopes

Cited In (9)

• Simplest polymetric geometries
• Minimum number of edges of polytopes with \(2d+2\) vertices
• The excess degree of a polytope
• A family of easy polyhedra
• Reconstructing simplicial polytopes from their graphs and affine 2-stresses
• On the reconstruction of polytopes
• The lower bound theorem for \(d\)-polytopes with \(2d+1\) vertices
• On the faces of simple polytopes
• Reconstructibility of matroid polytopes

Uses Software

• polymake

This page was built for publication: Polytopes close to being simple

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