In
mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
,
arithmetic
Arithmetic is an elementary branch of mathematics that deals with numerical operations like addition, subtraction, multiplication, and division. In a wider sense, it also includes exponentiation, extraction of roots, and taking logarithms.
...
combinatorics is a field in the intersection of
number theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example ...
,
combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...
,
ergodic theory
Ergodic theory is a branch of mathematics that studies statistical properties of deterministic dynamical systems; it is the study of ergodicity. In this context, "statistical properties" refers to properties which are expressed through the behav ...
and
harmonic analysis
Harmonic analysis is a branch of mathematics concerned with investigating the connections between a function and its representation in frequency. The frequency representation is found by using the Fourier transform for functions on unbounded do ...
.
Scope
Arithmetic combinatorics is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division).
Additive combinatorics
Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are ''inverse problems'': given the size of the sumset is small, what can we say about the structures of and ? In the case of th ...
is the special case when only the operations of addition and subtraction are involved.
Ben Green explains arithmetic combinatorics in his review of "Additive Combinatorics" by
Tao
The Tao or Dao is the natural way of the universe, primarily as conceived in East Asian philosophy and religion. This seeing of life cannot be grasped as a concept. Rather, it is seen through actual living experience of one's everyday being. T ...
and
Vu.
Important results
Szemerédi's theorem
Szemerédi's theorem
In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers ''A'' with positive natural density contains a ''k''- ...
is a result in arithmetic combinatorics concerning
arithmetic progression
An arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence. The constant difference is called common difference of that ...
s in subsets of the integers. In 1936,
Erdős
Erdős, Erdos, or Erdoes is a Hungarian surname.
Paul Erdős (1913–1996), Hungarian mathematician
Other people with the surname
* Ágnes Erdős (1950–2021), Hungarian politician
* Brad Erdos (born 1990), Canadian football player
* Éva Erd� ...
and
Turán conjectured
[.] that every set of integers ''A'' with positive
natural density In number theory, natural density, also referred to as asymptotic density or arithmetic density, is one method to measure how "large" a subset of the set of natural numbers is. It relies chiefly on the probability of encountering members of the desi ...
contains a ''k'' term arithmetic progression for every ''k''. This conjecture, which became Szemerédi's theorem, generalizes the statement of
van der Waerden's theorem
Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive integers ''r'' and ''k'', there is some number ''N'' such that if the integers are colored, eac ...
.
Green–Tao theorem and extensions
The
Green–Tao theorem
In number theory, the Green–Tao theorem, proven by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for every natural number k, there exist arithme ...
, proved by
Ben Green and
Terence Tao
Terence Chi-Shen Tao (; born 17 July 1975) is an Australian-American mathematician, Fields medalist, and professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the Co ...
in 2004, states that the sequence of
prime number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
s contains arbitrarily long
arithmetic progression
An arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence. The constant difference is called common difference of that ...
s. In other words, there exist arithmetic progressions of primes, with ''k'' terms, where ''k'' can be any natural number. The proof is an extension of
Szemerédi's theorem
In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers ''A'' with positive natural density contains a ''k''- ...
.
In 2006, Terence Tao and
Tamar Ziegler extended the result to cover polynomial progressions. More precisely, given any
integer-valued polynomial In mathematics, an integer-valued polynomial (also known as a numerical polynomial) P(t) is a polynomial whose value P(n) is an integer for every integer ''n''. Every polynomial with integer coefficients is integer-valued, but the converse is not tr ...
s ''P''
1,..., ''P''
''k'' in one unknown ''m'' all with constant term 0, there are infinitely many integers ''x'', ''m'' such that ''x'' + ''P''
1(''m''), ..., ''x'' + ''P''
''k''(''m'') are simultaneously prime. The special case when the polynomials are ''m'', 2''m'', ..., ''km'' implies the previous result that there are length ''k'' arithmetic progressions of primes.
Breuillard–Green–Tao theorem
The Breuillard–Green–Tao theorem, proved by
Emmanuel Breuillard
Emmanuel Breuillard (born 25 June 1977) is a French mathematician. He was the Sadleirian Professor of Pure Mathematics in the
Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge, and is now Professo ...
,
Ben Green, and
Terence Tao
Terence Chi-Shen Tao (; born 17 July 1975) is an Australian-American mathematician, Fields medalist, and professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the Co ...
in 2011, gives a complete classification of
approximate groups. This result can be seen as a nonabelian version of
Freiman's theorem
In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if , A+A, /, A, is small, then A can be contained in ...
, and a generalization of
Gromov's theorem on groups of polynomial growth In geometric group theory, Gromov's theorem on groups of polynomial growth, first proved by Mikhail Gromov, characterizes finitely generated groups of ''polynomial'' growth, as those groups which have nilpotent subgroups of finite index.
Statemen ...
.
Example
If ''A'' is a set of ''N'' integers, how large or small can the
sumset
In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A and B of an abelian group G (written additively) is defined to be the set of all sums of an element from A with an element from B. That is,
:A + B = \.
The n- ...
:
the difference set
:
and the product set
:
be, and how are the sizes of these sets related? (Not to be confused: the terms
difference set
In combinatorics, a (v,k,\lambda) difference set is a subset D of cardinality, size k of a group (mathematics), group G of order of a group, order v such that every non-identity element, identity element of G can be expressed as a product d_1d_2^ o ...
and
product set
In mathematics, specifically set theory, the Cartesian product of two sets and , denoted , is the set of all ordered pairs where is an element of and is an element of . In terms of set-builder notation, that is
A\times B = \.
A table can ...
can have other meanings.)
Extensions
The sets being studied may also be subsets of algebraic structures other than the integers, for example,
groups
A group is a number of persons or things that are located, gathered, or classed together.
Groups of people
* Cultural group, a group whose members share the same cultural identity
* Ethnic group, a group whose members share the same ethnic iden ...
,
rings and
fields
Fields may refer to:
Music
*Fields (band), an indie rock band formed in 2006
* Fields (progressive rock band), a progressive rock band formed in 1971
* ''Fields'' (album), an LP by Swedish-based indie rock band Junip (2010)
* "Fields", a song by ...
.
See also
*
Additive number theory
Additive number theory is the subfield of number theory concerning the study of subsets of integers and their behavior under addition. More abstractly, the field of additive number theory includes the study of abelian groups and commutative semigro ...
*
Additive combinatorics
Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are ''inverse problems'': given the size of the sumset is small, what can we say about the structures of and ? In the case of th ...
*
Approximate group
In mathematics, an approximate group is a subset of a group which behaves like a subgroup "up to a constant error", in a precise quantitative sense (so the term approximate subgroup may be more correct). For example, it is required that the set of ...
*
Corners theorem
In arithmetic combinatorics, the corners theorem states that for every \varepsilon>0, for large enough N, any set of at least \varepsilon N^2 points in the N\times N grid \^2 contains a corner, i.e., a triple of points of the form \ with h\ne 0. I ...
*
Ergodic Ramsey theory
Ergodic Ramsey theory is a branch of mathematics where problems motivated by additive combinatorics are proven using ergodic theory.
History
Ergodic Ramsey theory arose shortly after Endre Szemerédi's proof that a set of positive upper density ...
*
Problems involving arithmetic progressions
Problems involving arithmetic progressions are of interest in number theory,
combinatorics, and computer science, both from theoretical and applied points of view.
Largest progression-free subsets
Find the cardinality (denoted by ''A'k''(''m' ...
*
Schnirelmann density
In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the first to study it.Schnirelmann, L.G. (1930).On the ...
*
Shapley–Folkman lemma
The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of set (mathematics), sets in a vector space. The lemma may be intuitively understood as saying that, if the number of summed sets exceeds the dime ...
*
Sidon set
In number theory, a Sidon sequence is a sequence A=\ of natural numbers in which all pairwise sums a_i+a_j are different. Sidon sequences are also called Sidon sets; they are named after the Hungarian mathematician Simon Sidon, who introduced the ...
*
Sum-free set
In additive combinatorics and number theory, a subset ''A'' of an abelian group ''G'' is said to be sum-free if the sumset ''A'' + ''A'' is disjoint from ''A''. In other words, ''A'' is sum-free if the equation a + b = c has no solution with a,b, ...
*
Restricted sumset
In additive number theory and combinatorics, a restricted sumset has the form
:S=\,
where A_1,\ldots,A_n are finite nonempty subsets of a field ''F'' and P(x_1,\ldots,x_n) is a polynomial over ''F''.
If P is a constant non-zero function, for ...
*
Sum-product phenomenon
Notes
References
*
Additive Combinatorics and Theoretical Computer Science, Luca Trevisan, SIGACT News, June 2009
*
Open problems in additive combinatorics E Croot, V Lev
From Rotating Needles to Stability of Waves: Emerging Connections between Combinatorics, Analysis, and PDE Terence Tao
Terence Chi-Shen Tao (; born 17 July 1975) is an Australian-American mathematician, Fields medalist, and professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the Co ...
, AMS Notices March 2001
*
*
*
*
*
Further reading
Some Highlights of Arithmetic Combinatorics resources by
Terence Tao
Terence Chi-Shen Tao (; born 17 July 1975) is an Australian-American mathematician, Fields medalist, and professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the Co ...
Additive Combinatorics: Winter 2007 K Soundararajan
Earliest Connections of Additive Combinatorics and Computer Science Luca Trevisan
{{Number theory
Additive number theory
Sumsets
Harmonic analysis
Ergodic theory
Additive combinatorics