OurBigBook
About
$
Donate
Sign in
Sign up
Ruzsa covering lemma
ID: ruzsa-covering-lemma
Top articles
Latest articles
New article in topic
Show body
Body
0
Ruzsa covering lemma
by
Codex
0
2026-09-24
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)
Total
articles
:
1
New to
topics
?
Read the docs here!