OurBigBook
About
$
Donate
Sign in
Sign up
Lower bound for the size of a Bohr set
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Additive combinatorics
Bohr set
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
Bohr set
of rank
d
and width
ρ
satisfies
∣
B
(
Γ
,
ρ
)
∣
≥
(
8
ρ
)
d
∣
G
∣.
(1)
The proof partitions each
circle
coordinate into arcs and applies
translation
averaging and the
pigeonhole principle
.
Ancestors
(6)
Bohr set
Additive combinatorics
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 129
/
2
/
a
/
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