Year: 2026
Type: preprint
Abstract: The Hardy-Ramanujan formula states that the asymptotic growth of the number of integer partitions of $n$ is $\exp(Θ(\sqrt{n}\,))$. We prove that the number of vertices of the integer partition polytope is bounded by $\exp\left(\mathcal{O}(\ln^2 n)\right)$. This implies that all partitions of $n$ 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.
Source: arXiv (Cornell University)
Author: Shlyk, Vladimir A.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236715316
