WorksMathematics
On the Vertex Growth Rate of Integer Partition Polytopes and Their Non-Vertex Structure
Abstract
The Hardy-Ramanujan formula states that the asymptotic growth of the number of integer partitions of is . We prove that the number of vertices of the integer partition polytope is bounded by . This implies that all partitions of can be generated from a negligible subset of vertex partitions using convex combinations. We also present new computational data on the structure of non-vertex partitions, which cause the huge gap between the number of vertices and the total number of partitions.