On the Vertex Growth Rate of Integer Partition Polytopes and Their Non-Vertex Structure
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.
Authors
- В. А. Шлык (ORCID: https://orcid.org/0000-0002-0869-3724)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24835
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint