Additive number theory

Additive number theory
Name	Additive number theory
Field	Number theory
Notable	Erdős, G. H. Hardy, John H. Conway, Paul Erdős, Ivan Niven

Additive number theory Additive number theory studies representations of integers and other algebraic objects as sums of elements from specified sets. It connects work by Srinivasa Ramanujan, G. H. Hardy, Paul Erdős, Ivan Vinogradov, Vaughan, and Klaus Roth to questions about partitions, sumsets, and bases in settings influenced by Euclid, Carl Friedrich Gauss, Leonhard Euler, and Joseph-Louis Lagrange. Techniques draw on ideas from John von Neumann, Andrey Kolmogorov, Stefan Banach, Norbert Wiener, and institutions like Institute for Advanced Study and Cambridge University.

Overview

Additive number theory examines additive properties of integers, sequences, and groups using contributions from Paul Erdős, Peter Sarnak, Henryk Iwaniec, Terence Tao, Ben Green, Imre Z. Ruzsa, and Rudolf R. Salem alongside classical figures such as Srinivasa Ramanujan, G. H. Hardy, and Ivan Vinogradov. Central pursuits include understanding sumsets, Sidon sets, additive bases, zero-sum problems, and partition functions, with links to research at Princeton University, University of Cambridge, Harvard University, ETH Zurich, and University of Bonn.

Fundamental Concepts and Definitions

Core notions trace to work by Joseph-Louis Lagrange and Pierre de Fermat on sums of squares and to definitions formalized by Erdős and Pál Erdős collaborators. Important definitions include: - Sumset A+B, studied in contexts involving Erdős–Ginzburg–Ziv theorem and Cauchy–Davenport theorem with methods from Olga Taussky-Todd and Nicolas Bourbaki-era colleagues. - Additive basis and asymptotic basis, developed through work of V. G. Sprague and I. M. Vinogradov in additive prime problems. - Sidon sets and B_h[g] sequences, originating from investigations by Simon Sidon, Erdős, and Harald Cramér. - Zero-sum sequences in abelian groups linked to Kemnitz conjecture and proven using techniques associated with Richard Guy and András Sárközy.

Classical Problems and Theorems

Major classical results include: - Goldbach-type results initiated by Christian Goldbach, advanced by Ivan Vinogradov, H. Davenport, Helmut Hasse, Chen Jingrun, Terence Tao, and Helfgott. - Waring's problem, with milestones by Edward Waring, David Hilbert, Jacques Hadamard, I. M. Vinogradov, and T. Estermann. - The partition function p(n) studied by Srinivasa Ramanujan, G. H. Hardy, Hans Rademacher, and later work at University of Cambridge and Royal Society venues. - Freiman's theorem on structure of sets with small doubling, proved by Gregori Freiman and refined by Imre Z. Ruzsa, Jean Bourgain, Ben Green, and Terry Tao. - The Erdős–Turán conjectures and results by Paul Erdős, Pál Turán, Landau, and researchers at Hungarian Academy of Sciences.

Methods and Techniques

Analytic and combinatorial methods dominate, with foundational contributions by G. H. Hardy, John Littlewood, P. V. Landau, Atle Selberg, H. L. Montgomery, and Heath-Brown. Notable techniques: - Circle method developed by G. H. Hardy, John Littlewood, and refined by I. M. Vinogradov and Kloosterman; used for problems studied at University of Oxford and Moscow State University. - Sieve methods from V. A. Brun, Atle Selberg, Alain L. C. Pomerance-adjacent work, and contributions by Carl Pomerance, Enrico Bombieri, and Henryk Iwaniec. - Additive combinatorics tools including Balog–Szemerédi–Gowers lemma from Antal Balog, Endre Szemerédi, and W. T. Gowers, along with sum-product phenomena studied by Jean Bourgain, Nets Katz, and Terence Tao. - Probabilistic methods of Paul Erdős and Alfréd Rényi, and ergodic approaches influenced by Hillel Furstenberg and Furstenberg–Sárközy theorem work.

Generalizations and Related Areas

Additive themes extend to algebraic and geometric contexts studied by Alexander Grothendieck-era algebraists and researchers at Max Planck Institute. Related areas include: - Additive combinatorics, linked to Ben Green and Terence Tao breakthroughs on primes in arithmetic progressions. - Harmonic analysis and Fourier methods connected to Norbert Wiener, Salem, and Elias Stein. - Combinatorial number theory work tied to Paul Erdős problems and to Richard Rado-style equations. - Arithmetic combinatorics in finite fields and groups, researched at Institut des Hautes Études Scientifiques and Princeton University.

Applications and Open Problems

Applications appear in coding theory studied at Bell Labs and AT&T, cryptography research at RSA Laboratories and National Security Agency, and computational complexity work at MIT and Microsoft Research. Prominent open problems include: - The full resolution of Goldbach conjecture traced to Christian Goldbach and modern approaches by Helfgott and Yitang Zhang. - Optimal bounds in Freiman-type structure theorems pursued by Imre Z. Ruzsa, Ben Green, and Terry Tao. - Understanding distribution of prime sums linked to G. H. Hardy and John Littlewood conjectures, studied at Institute for Advanced Study. - Zero-sum constants and Davenport constants in finite groups with ongoing contributions from J. E. Olson, Wolfgang Krull, and Anthony Schinzel.

Category:Number theory