OurBigBook About$ Donate
 Sign in Sign up

Petridis minimal-growth lemma

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Additive combinatorics Doubling constant Plünnecke-Ruzsa inequality
2026-09-24  0 By others on same topic  0 Discussions Create my own version
If a nonempty finite set X minimizes ∣X+B∣/∣X∣ among the nonempty subsets of A, with minimum K′, then
∣X+B+C∣≤K′∣X+C∣
(1)
for every finite set C. Iteration is a short proof of the Plünnecke-Ruzsa inequality.

 Ancestors (7)

  1. Plünnecke-Ruzsa inequality
  2. Doubling constant
  3. Additive combinatorics
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 129 / 1 / i / Solution

 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