partitions (number theory)

partitions (number theory)
Name	Partitions (number theory)
Caption	Ferrers diagram for the partition 6 = 3+2+1
Field	Number theory, Combinatorics
Introduced	17th century
Notable	Srinivasa Ramanujan; G. H. Hardy; Percy A. MacMahon

partitions (number theory) Partitions in number theory are ways of writing a positive integer as a sum of positive integers, where order is not significant. The subject has deep links to Srinivasa Ramanujan, G. H. Hardy, Euler, Leonhard Euler, MacMahon and modern researchers at institutions such as Institute for Advanced Study, Princeton University, Cambridge University and University of Göttingen. It connects combinatorial enumeration with analytic methods, modular forms, and representation theory, appearing in contexts involving John von Neumann, Emil Artin, Andrey Kolmogorov and contemporary work tied to the Clay Mathematics Institute.

Definition and Terminology

A partition of a positive integer n is a multiset of positive integers summing to n; classical notation uses p(n) for the number of partitions of n. Historical terminology traces to Leonhard Euler and was systematized by Percy A. MacMahon and later by Srinivasa Ramanujan and G. H. Hardy. Common objects include Ferrers diagrams, Young diagrams, conjugation of partitions, and Durfee squares, with standard references in texts by George E. Andrews, Richard P. Stanley, Bruce C. Berndt and scholars at University of Michigan and Massachusetts Institute of Technology.

Basic Examples and Properties

For small n one lists partitions explicitly: p(1)=1, p(2)=2, p(3)=3, p(4)=5; these enumerations are in early works by Euler and treated by Andrews and MacMahon. Elementary properties include bijections between partitions into distinct parts and partitions into odd parts (classical Euler bijection) and conjugation symmetry between partitions with at most k parts and partitions with largest part at most k; these ideas appear in combinatorial studies at University of Cambridge and in the lectures of Richard Stanley.

Generating Functions and Analytic Methods

The partition generating function is the infinite product ∏_{m≥1} (1−q^m)^{−1}, first studied by Euler and central to analytic techniques developed by Hardy and Ramanujan. Analytic continuation, modular transformations, and circle method tools were refined by G. H. Hardy, J. E. Littlewood, Ramanujan, and later by Hans Rademacher and researchers at Harvard University and Trinity College, Cambridge. Relations to q-series and mock theta functions link to work by Srinivasa Ramanujan and modern developments involving Don Zagier, Ken Ono, Kathrin Bringmann, and institutions such as University of California, Los Angeles.

Partition Identities and Congruences

Ramanujan discovered striking congruences for p(n) such as p(5k+4)≡0 mod 5, p(7k+5)≡0 mod 7, and p(11k+6)≡0 mod 11, results proved in collaboration with G. H. Hardy and subsequently placed in the framework of modular forms by Atkin and Serre. Infinite families of partition congruences were later developed by Ken Ono, A. O. L. Atkin, Scott Ahlgren, and others associated with Rutgers University and University of Wisconsin–Madison. Classical partition identities include Rogers–Ramanujan identities, Gordon’s generalization, and Bailey chains; these were pursued by L. J. Rogers, S. O. Warnaar, George Gasper, and groups at University of Illinois.

Asymptotic Formulas and Hardy–Ramanujan Theory

The Hardy–Ramanujan asymptotic formula p(n) ~ (4n√3)^{-1} exp(π√(2n/3)) arose from the circle method developed by G. H. Hardy and Srinivasa Ramanujan, with exact convergent series provided by Hans Rademacher. Subsequent refinements and error term analyses involve work by I. J. Schoenberg, K. Ono, H. L. Montgomery, and researchers at Princeton University and University of Toronto. These results connect to spectral theory at Institute for Advanced Study and to automorphic forms studied at Institute des Hautes Études Scientifiques.

Restricted Partitions and Combinatorial Variants

Variants include partitions into distinct parts, partitions with bounded largest part, plane partitions, overpartitions, and multipartitions; combinatorial enumeration of these types features in research by Percy MacMahon, Erdős, Paul Erdős, George Szekeres, and Richard Stanley. Plane partitions relate to tilings, boxed plane partitions, and connections to Andréief identity and statistical mechanics models explored at University of Cambridge and University of Tokyo. Overpartitions and colored partitions are active topics in research groups at University of Illinois at Urbana–Champaign and Northwestern University.

Connections to Representation Theory and Modular Forms

Partitions classify irreducible representations of symmetric groups via Young diagrams and the hook-length formula, central to the work of William Fulton, James A. Littlewood, Alfred Young, and taught at University of Oxford and University of Cambridge. The interplay between p(n), modular forms, and congruences ties to the theory of Hecke operators investigated by Erich Hecke, Jean-Pierre Serre, and modern contributors like Ken Ono and A. J. Scholl. Connections extend to vertex operator algebras, moonshine phenomena studied by John McKay and Richard Borcherds, and to geometric representation theory at Harvard University and Princeton University.

Category:Number theory