Theorem

Kneser's Theorem (Combinatorics)

Combinatorics and Graph Theory

Kneser's theorem, in additive combinatorics, refers to a group of related results about the size of sumsets in abelian groups, published by Martin Kneser in 1953 and 1956. The theorems extend the Cauchy-Davenport theorem, which bounds sumset sizes only for groups of prime order, to general abelian groups, with several statements addressing when a sumset stays strictly smaller than the sum of the sizes of its two component sets, and a further statement addressing when equality holds for Haar measure in connected compact abelian groups.

Facts
Classification
Statement Form
Inequality 1
Connections

Has Statement Form

Inequality, Concepts
Sources
1. Kneser's theorem (combinatorics) (Wikipedia)
  • Statement Form: Inequality
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.

Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme