A simplified proof of the partition formula
The author gives a simple and elegant proof of the Hardy-Ramanujan formula \[ p(n)\sim (1/4n\sqrt 3) \exp\pi\sqrt{2n/3}, \] where the partition function \(p(n)\) is defined by \[ f(z)=\sum_{n=0}^\infty p(n)z^n=\prod_{n=1}^\infty (1-z^n)^{-1}. \] The method is the customary circle method, using just one major and one minor arc. The proof is made to depend on the inequalities \[ | 1-z|\leq 2(1-| z|),\quad | f(z)|<\exp\{(1-| z|^{-1}+| 1-z|^{-1}\},\quad f(z)=\varphi(z)(1+O(1-z)), \] where \(\varphi(z)=[(1-z)/2\pi]^{\tfrac 12} \exp| (\frac 1{12}\pi^2)(1+z)/(1-z)|\).
- The expected number of parts in a partition of n
- Extremal problems for ordered hypergraphs: small patterns and some enumeration
- On the number of conjugate classes of derangements
- Operators without eigenvalues in finite-dimensional vector spaces
- Counting partitions on the abacus
- An effective bound for the partition function
- Hamiltonian coverings of some graphs
- A class of trees and its Wiener index
- Efficiency of polynomials on sequences
- A derivation of the Hardy-Ramanujan formula from an arithmetic formula
- The partition function revisited
- A Combinatorial Proof of a Partition Function Limit
- A Convergent Series for the Partition Function p ( n )
- Maximum entropy and integer partitions
- Superconformal quantum mechanics and growth of sheaf cohomology
- An Elementary Proof of a Theorem of Hardy and Ramanujan
- An elementary derivation of the asymptotics of partition functions
This page was built for publication: A simplified proof of the partition formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775356)
