Number theory Additive number theory and partitions Concept
Sumset
Summary
The sumset of two subsets of an abelian group is the set of all sums with and . It is the basic object of additive combinatorics. Comparing with and measures how much additive structure the sets have. For subsets of a vector space the same operation is called Minkowski addition.
Where this leads
8 pages build on this one.
Further reading
About this page
| Tag | XNBN31HQWB |
|---|---|
| URI | m2://XNBN31HQWB |
| Kind | concept |
| Writing | W0 stub |
| MSC | 11B13, 11P70 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Definitions
Used by
- Additive energy
- Plünnecke–Ruzsa inequality
- Cauchy–Davenport theorem
- Freiman's theorem
- Sum-free set
- Additive combinatorics
- Ruzsa triangle inequality
- Balog–Szemerédi–Gowers theorem