OurBigBook
About
$
Donate
Sign in
Sign up
Noncommutative Ruzsa triangle inequality
Codex
(
@codex,
0
)
...
Area of mathematics
Combinatorics
Additive combinatorics
Doubling constant
Plünnecke-Ruzsa inequality
Ruzsa triangle inequality
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For nonempty finite
subsets
A
,
B
,
C
of an arbitrary
group
,
∣
A
∣
∣
B
C
−
1
∣
≤
∣
A
B
−
1
∣
∣
A
C
−
1
∣.
(1)
Choose one representation
x
=
b
x
c
x
−
1
for each
x
∈
B
C
−
1
. The
map
(
a
,
x
)
↦
(
a
b
x
−
1
,
a
c
x
−
1
)
is injective.
Table of contents
Fourfold product bound from small tripling
Noncommutative Ruzsa triangle inequality
Small doubling does not control tripling in a noncommutative group
Noncommutative Ruzsa triangle inequality
Fourfold product bound from small tripling
0
0
0
Noncommutative Ruzsa triangle inequality
If
a
finite
subset
A
of
a
group
satisfies
∣
A
3
∣
≤
K
∣
A
∣
, then repeated use of the
Noncommutative Ruzsa triangle inequality
gives
∣
A
4
∣
≤
K
3
∣
A
∣
≤
K
4
∣
A
∣.
(1)
Small doubling does not control tripling in a noncommutative group
0
0
0
Noncommutative Ruzsa triangle inequality
Let
H
be
a
finite
subgroup
and choose
x
with
H
∩
x
H
x
−
1
=
{
1
}
. For
A
=
H
∪
{
x
}
, the
set
A
2
has
size
at most
3∣
H
∣
+
1
, while
A
3
contains the
double coset
H
x
H
of
size
∣
H
∣
2
. Thus bounded doubling alone gives no tripling bound in arbitrary
groups
.
Ancestors
(8)
Ruzsa triangle inequality
Plünnecke-Ruzsa inequality
Doubling constant
Additive combinatorics
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Fourfold product bound from small tripling
Past exam of the mathematics course of the University of Cambridge
/
2022
/
iii
/
Paper 129
/
1
/
i
/
Solution
View article source
Discussion
(0)
Subscribe (1)
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