Freiman's theorem

In mathematics, Freiman's theorem is a combinatorial result in additive number theory. In a sense it accounts for the approximate structure of sets of integers that contain a high proportion of their internal sums, taken two at a time.

The formal statement is:

Let A be a finite set of integers such that the sumset

A + A\,

is small, in the sense that

|A + A| < c|A|\,

for some constant c. There exists an n-dimensional arithmetic progression of length

c' |A|\,

that contains A, and such that c' and n depend only on c.[1]

A simple instructive case is the following. We always have

|A + A| \ge 2|A|-1

with equality precisely when A is an arithmetic progression.

This result is due to Gregory Freiman (1964,1966).[2] Much interest in it, and applications, stemmed from a new proof by Imre Z. Ruzsa (1994).

Green and Ruzsa (2007) generalized the theorem for arbitrary abelian groups: here A can be contained in the sum of a generalized arithmetic progression and a subgroup — the name of such sets is coset-progression.

See also

References

  1. Nathanson (1996) p.251
  2. Nathanson (1996) p.252

This article incorporates material from Freiman's theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

This article is issued from Wikipedia - version of the Saturday, April 30, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.