Combinatorially rigid simple polytopes with d+3 facets

2015/11/29 by Bosio, Frédéric
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1511.09039

Abstract

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

Related

• Polytopes with few vertices and few facets
• A classification of polyhedral graph by combinatorially rigid vertices
• Counterexample to a conjecture of Ziegler concerning a simple polytope and its dual
• A Classification of Non-Compact Coxeter Polytopes with n+3 Facets and One Non-Simple Vertex
• Rigidity of polytopes with edge length and coplanarity constraints