OurBigBook About$ Donate
 Sign in Sign up

Approximate group

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics
2026-09-24  1 By others on same topic  0 Discussions Create my own version
A K-approximate group is a symmetric set H containing the identity such that H+H is covered by at most K translates of H.
  • Table of contents
    • Ruzsa covering lemma Approximate group

Ruzsa covering lemma

 0  0
Approximate group
If finite sets satisfy ∣S+T∣≤K∣T∣, then a maximal family of disjoint translates x+T, with x∈S, has at most K members and gives
S⊆X+T−T,∣X∣≤K.
(1)

 Ancestors (5)

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

 Incoming links (1)

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

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Approximate group by Wikipedia Bot  1
 View more
The concept of an "approximate group" arises in the field of group theory and is particularly relevant in the study of discrete groups, geometric group theory, and number theory. An approximate group can be thought of as a structure that shares some properties with groups but does not necessarily satisfy all group axioms in a strict sense.
 Read the full article
  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