OurBigBook
About
$
Donate
Sign in
Sign up
Croot-Sisask almost-periodicity theorem
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Additive combinatorics
Almost period of a function
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
finite sets
A
,
S
in
a
group
satisfy
∣
A
+
S
∣
≤
K
∣
A
∣
, then for
q
≥
2
and
0
<
ϵ
<
1
there is
T
⊆
S
with
∣
T
∣
≥
(
2
K
)
−
O
(
q
/
ϵ
2
)
∣
S
∣
such that every
t
∈
T
−
T
is an
L
q
almost
period of
1
A
∗
f
:
∥
τ
t
(
1
A
∗
f
)
−
1
A
∗
f
∥
q
≤
ϵ
∥
1
A
∥
1
∥
f
∥
q
.
(1)
Ancestors
(6)
Almost period of a function
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
/
3
/
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