The largest small polytopes

2002/12/19 by Andreas Klein, Klein, Andreas, Markus Wessler +1
Engineering · Mathematics · #Mathematics and Applications #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.math/0212262

9 pages

arxiv created 2002/12/19 · arxiv updated 2009/11/30

Abstract

The aim of this paper is the determination of the largest n-dimensional polytope with n+3 vertices of unit diameter. This is a special case of a more general problem proposed by Graham.

Related

• Computational determination of the largest lattice polytope diameter
• Maximum volume polytopes inscribed in the unit sphere
• Max/Min Puzzles in Geometry IV
• More bounds on the diameters of convex polytopes
• A bound for the number of vertices of a polytope with applications