A simplified proof of the partition formula

DOI10.1307/mmj/1028998729zbMath0105.26701OpenAlexW2084811867MaRDI QIDQ775356

Donald J. Newman

Publication date: 1962

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1307/mmj/1028998729

zbMATH Keywords

partition functioncircle methodproof of the Hardy-Ramanujan formula

Mathematics Subject Classification ID

Applications of the Hardy-Littlewood method (11P55) Analytic theory of partitions (11P82)

Related Items (10)

Maximum entropy and integer partitions ⋮ Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ An elementary derivation of the asymptotics of partition functions ⋮ Superconformal quantum mechanics and growth of sheaf cohomology ⋮ Operators without eigenvalues in finite-dimensional vector spaces ⋮ Hamiltonian coverings of some graphs ⋮ The expected number of parts in a partition of n ⋮ A class of trees and its Wiener index ⋮ On the number of conjugate classes of derangements ⋮ Efficiency of polynomials on sequences

This page was built for publication: A simplified proof of the partition formula