Live briefing

Everything about Restricted sumset

Sumset of a field subject to a specific polynomial restriction

In additive number theory and combinatorics, a restricted sumset has the form Wikipedia →

🧭 Start here: a 6-step reading path

No dictionary entry for this exact phrase.

Some Inverse Results on Restricted Signed Sumset

Mohan · 2026 · Frontiers of Mathematics · 0 citations
On the size of a restricted sumset with application to the binary expansion of √d

Artūras Dubickas · 2019 · Applicable Analysis and Discrete Mathematics · 0 citations

Open Library didn't respond; try again in a moment.

Zero-sum problem In number theory, zero-sum problems are certain kinds of combinatorial problems about the structure of a finite abelian group. Concretely, given a finite…
Freiman's theorem In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose…
Kneser's theorem (combinatorics) In the branch of mathematics known as additive combinatorics, Kneser's theorem can refer to one of several related theorems regarding the sizes of certain…
Schnirelmann density In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Soviet…
Additive combinatorics Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are inverse problems: given the size…
Approximate group In mathematics, an approximate group is a subset of a group which behaves like a subgroup "up to a constant error", in a precise quantitative sense (so…
Dyson's transform Dyson's transform is a fundamental technique in additive number theory for transforming a pair of integer sequences into another pair of integer sequences…
Parikh's theorem In theoretical computer science, Parikh's theorem states that if one looks only at the number of occurrences of each terminal symbol in a context-free…