Polytopes with few vertices and few facets

2015/03/13 by Padrol, Arnau
#Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.1503.04129

Abstract

In this note we prove that the number of combinatorial types of d-polytopes with d+1+α vertices and d+1+β facets is bounded by a constant independent of d.

Related

• A lower bound theorem for d-polytopes with at most 3d-1 vertices
• A lower bound theorem for d-polytopes with 2d+1 vertices
• The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices
• A lower bound theorem for d-polytopes with 2d+2 vertices
• All 2-neighborly d-polytopes with at most d + 9 facets