Jump to content

Kneser's theorem (combinatorics)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Deltahedron (talk | contribs) at 19:53, 2 August 2012 (Statement: extension, identifying subgroup as stabiliser). 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 is a statement about set addition in finite groups.

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

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

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.