Jump to content

Arithmetic combinatorics

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Brirush (talk | contribs) at 13:44, 22 November 2014 (Sectionifying). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.

Scope

Arithmetic combinatorics 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.

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

Example

If A is a set of N integers, how large or small can the sumset

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 and product set can have other meanings.)

Extensions

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

See also

Notes

  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.

References

Further reading