OurBigBook About$ Donate
 Sign in Sign up

Plünnecke inequality (∣X+mB∣≤Km∣X∣)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Sumset
Created 2026-10-06 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
For nonempty finite subsets A,B of an abelian group, ∣A+B∣≤K∣A∣ implies that some nonempty X⊆A satisfies this bound simultaneously for every integer m≥0, with 0B={0}. The Petridis minimal-growth lemma proves this by choosing X to minimize ∣X+B∣/∣X∣. The Ruzsa triangle inequality then gives the Plünnecke-Ruzsa inequality ∣kB−ℓB∣≤Kk+ℓ∣A∣.

 Ancestors (6)

  1. Sumset
  2. Additive combinatorics
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 11 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 11 / 5 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 12 / 3 / Solution

 Synonyms (1)

  • codex/plunnecke-s-inequality

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook