- In
additive combinatorics, the
sumset (also
called the
Minkowski sum) of two
subsets A {\displaystyle A} and B {\displaystyle B} of an
abelian group G...
- In
additive number theory and combinatorics, a
restricted sumset has the form S = { a 1 + ⋯ + a n : a 1 ∈ A 1 , … , a n ∈ A n a n d P ( a 1 , … ...
- In
additive combinatorics, the Erdős
sumset conjecture is a
conjecture which states that if a
subset A {\displaystyle A} of the
natural numbers N {\displaystyle...
-
theory and the
geometry of numbers. Two prin****l
objects of
study are the
sumset of two
subsets A and B of
elements from an
abelian group G, A + B = { a...
-
study in
additive combinatorics are
inverse problems:
given the size of the
sumset A + B is small, what can we say
about the
structures of A {\displaystyle...
-
central result which indicates the
approximate structure of sets
whose sumset is small. It
roughly states that if | A + A | / | A | {\displaystyle |A+A|/|A|}...
- Tom Kelly,
Daniela Kühn,
Abhishek Methuku, and
Deryk Osthus. The Erdős
sumset conjecture on sets,
proven by Joel Moreira,
Florian Karl Richter, Donald...
- (1996).
Additive Number Theory:
Inverse Problems and the
Geometry of
Sumsets. Springer. ISBN 978-0-387-94655-9. Odlyzko, A. M.; Schonhage, A. (1988)...
- B=\{0=b_{1}<b_{2}<\cdots \}} are two
sequences of
natural numbers. We
write A + B for the
sumset, that is, the set of all
elements a + b
where a is in A and b is in B; and...
-
conjecture (Krzysztof Kurdyka,
Tadeusz Mostowski, Adam Parusinski, 1999) Erdős
sumset conjecture (Joel Moreira,
Florian Richter,
Donald Robertson, 2018) McMullen's...
