Waring problem

Waring problem
Name	Waring problem
Field	Number theory
First proposed	1770s
Proposer	Edward Waring
Solved by	David Hilbert (existence theorem)
Related	Goldbach conjecture, Fermat's Last Theorem, Hardy–Littlewood circle method

Waring problem is a classical question in number theory concerning representation of natural numbers as sums of fixed powers. It asks whether for each integer k ≥ 2 there exists a finite g(k) such that every sufficiently large natural number is a sum of at most g(k) k-th powers of natural numbers. The problem stimulated contributions from figures associated with the 18th century, influenced methods developed by G. H. Hardy, John Littlewood, J. E. Littlewood, and culminated in an existence proof by David Hilbert; it connects to results by Srinivasa Ramanujan, Paul Erdős, and Ivan Vinogradov.

History

Edward Waring posed the problem in the 1770s, prompting early work by Joseph-Louis Lagrange, who proved the four-square theorem, and by Adrien-Marie Legendre. Later, the analytic approach of G. H. Hardy and John Littlewood (the Hardy–Littlewood circle method) and the algebraic contributions of David Hilbert shaped the field. Vaughan, Vinogradov, Hardy, Littlewood, and Mordell made advances in additive problems including implications for the problem. 20th-century progress involved E. M. Wright, J. H. van der Waerden, and J. J. O'Connor-style chroniclers; more recent refinements used techniques developed by Enrico Bombieri, Heath-Brown, Terence Tao, and Ben Green.

Statement and Definitions

For integer k ≥ 2 define g(k) as the minimal number with the property that every sufficiently large integer N can be expressed as a sum of at most g(k) k-th powers of nonnegative integers. Define G(k) as the minimal number such that every positive integer (without the "sufficiently large" qualifier) is a sum of at most G(k) k-th powers; often G(k) ≥ g(k). The problem requires understanding of representations, diophantine equations studied by Pierre de Fermat in special cases, and bounds akin to those in conjectures by Christian Goldbach and techniques used in proofs like Fermat's Last Theorem consequences. Definitions rely on classical notions introduced by Carl Friedrich Gauss and formalized in the context of additive problems by Hardy and Littlewood.

Exact Results and Known Values

Lagrange's four-square theorem gives G(2) = 4, a result linked to work by Joseph-Louis Lagrange and later exposition in the writings of Carl Friedrich Gauss. For cubes, Davenport and others established bounds; known exact values include g(2)=4, g(3)=9, with contributions by D. J. Newman and R. Balasubramanian. Higher k have been constrained by work of Hilbert, who proved finiteness of g(k) for all k, and by effective bounds from Vinogradov-type estimates and improvements by Vaughan, Heath-Brown, and Roth in related contexts. Results on specific g(k) for k up to moderate sizes incorporate calculations by R. C. Vaughan, T. D. Wooley, and computational verifications influenced by Andrew Booker and Richard Brent.

Methods and Proofs

Hilbert's original proof used algebraic identities and invariant theory associated with mathematicians like David Hilbert and drew on techniques from the period of the German Empire's mathematical institutions. Modern analytic proofs employ the Hardy–Littlewood circle method developed by G. H. Hardy and John Littlewood, with key refinements by R. C. Vaughan and T. D. Wooley using exponential sum estimates and mean value theorems. Vinogradov's methods, originating with Ivan Vinogradov, and sieve-theoretic ideas influenced by Atle Selberg and Bruno J. de Finetti-style probabilistic thinking play roles. Recent work leverages efficient congruencing and decoupling techniques linked to Jean Bourgain, Ciprian Demeter, and Terence Tao to tighten bounds on g(k) and G(k).

Generalizations and Related Problems

Generalizations include Waring–Goldbach problems connecting to Christian Goldbach conjectures on prime sums, polynomial Waring problems studied by David Hilbert's school, and Hilbert–Waring type questions over algebraic number fields involving institutions like Princeton University and École Normale Supérieure researchers. Related topics include the Hardy–Littlewood k-tuples conjecture, additive combinatorics problems advanced by Paul Erdős and Endre Szemerédi, and integer representation problems analogous to the Fourier analysis approaches used by Jean Bourgain and Bourgain, Demeter, Guth in decoupling theory. Connections extend to Diophantine approximation explored by Kurt Mahler and equidistribution theorems linked to work at Institute for Advanced Study.

Applications and Computational Aspects

Computational verification of specific G(k) and g(k) values leverages algorithms and high-performance computing carried out by researchers at institutions such as University of Cambridge, University of Oxford, and Princeton University; contributors include contemporary computational number theorists like Andrew Booker, Richard Brent, and teams using resources from Lawrence Berkeley National Laboratory and Los Alamos National Laboratory. Applications touch on algorithmic number theory topics pursued in collaborations with groups at Microsoft Research and IBM Research. Numeric methods involve lattice reduction techniques inspired by Kurt Gödel's era logic studies and modern implementations relying on libraries developed at Massachusetts Institute of Technology.

Category:Number theory