OurBigBook
About
$
Donate
Sign in
Sign up
Iterated sumset
(
m
A
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Additive combinatorics
Sumset
Created
2026-10-03
Updated
2026-10-06
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
a
nonnegative integer
m
, the
iterated sumset
m
A
is the
sum
of
m
copies of
A
, with
0
A
=
{
0
}
. Repetitions are allowed, so its elements are
sums
a
1
+
⋯
+
a
m
with each
a
i
∈
A
.
Ancestors
(6)
Sumset
Additive combinatorics
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(5)
Past exam of the mathematics course of the University of Cambridge
/
2010
/
iii
/
Paper 11
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2014
/
iii
/
Paper 79
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2015
/
iii
/
Paper 12
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2019
/
iii
/
Paper 149
/
1
/
a
/
Solution
Small-difference-set form of the Balog-Szemerédi-Gowers theorem
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