Arithmetic combinatorics

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, arithmetic combinatorics arose out of the interplay between number theory, combinatorics, ergodic theory and harmonic analysis. It is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). Additive combinatorics is the special case when only the operations of addition and subtraction are involved.

For example: if A is a set of N integers, how large or small can the sumset

A+A := \{x+y: x,y \in A\},

the difference set

A-A := \{x-y: x,y \in A\},

and the product set

A\cdot A := \{xy: x,y \in A\}

be, and how are the sizes of these sets related? (Not to be confused: the terms difference set and product set can have other meanings.)

The sets being studied may also be subsets of algebraic structures other than the integers, for example, groups, rings and fields.[1]

Arithmetic combinatorics is explained in Green's review of "Additive Combinatorics" by Tao and Vu.

See also[edit]


  1. ^ Bourgain, Jean; Katz, Nets; Tao, Terence (2004). "A sum-product estimate in finite fields, and applications". Geometric And Functional Analysis 14 (1): 27–57. doi:10.1007/s00039-004-0451-1. 


Further reading[edit]