OurBigBook
About
$
Donate
Sign in
Sign up
Finite-sums set
(
FS
(
x
i
)
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Ramsey theory
Hindman theorem
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For
a
sequence
(
x
i
)
, its
finite-sums set
is
FS
(
x
i
)
=
{
∑
i
∈
F
x
i
:
∅
=
F
⊆
N
finite
}
.
(1)
Ancestors
(6)
Hindman theorem
Ramsey theory
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Milliken–Taylor theorem
Past exam of the mathematics course of the University of Cambridge
/
2025
/
iii
/
Paper 130
/
3
/
c
/
ii
/
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