betaFeedback

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 nn is exp⁡(Θ(n ))\exp(Θ(\sqrt{n}\,)). We prove that the number of vertices of the integer partition polytope is bounded by exp⁡(O(ln⁡2n))\exp\left(\mathcal{O}(\ln^2 n)\right). This implies that all partitions of nn 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.

Paper details

vlnc:W_f6362uq8
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT

View statement
Looking for related papers…