Jump to content

Kneser's theorem (combinatorics)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Giftlite (talk | contribs) at 17:15, 10 August 2012 (−sp). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, in the field of additive combinatorics, Kneser's theorem, named after Martin Kneser, is a statement about set addition in finite groups.[1]

Statement

Let G be a non-trivial abelian group and A, B finite non-empty subsets. If |A| + |B| ≤ |G| then there is a finite subgroup H of G such that[2]

The subgroup H can be taken to be the stabiliser of A+B

Notes

  1. ^ M. Kneser, Abschätzungen der asymptotischen Dichte von Summenmengen, Math. Z., 58 (1953), 459-484.
  2. ^ Tao & Vu 2010, pg. 200, Theorem 5.5

References

  • Nathanson, Melvyn B. (1996). Additive Number Theory: Inverse Problems and the Geometry of Sumsets. Graduate Texts in Mathematics. Vol. 165. Springer-Verlag. pp. 109–132. ISBN 0-387-94655-1. Zbl 0859.11003.
  • Tao, Terence; Vu, Van H. (2010), Additive Combinatorics, Cambridge: Cambridge University Press, ISBN 978-0-521-13656-3