- 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, a
subset A of an
abelian group G is said to be sum-free if the
sumset A + A is
disjoint from A. In
other words, A is sum-free if the equation...
-
theory and the
geometry of numbers. Prin****l
objects of
study include 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 and B? In the...
-
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|}...
-
polynomial growth. If A is a set of N integers, how
large or
small can the
sumset A + A := { x + y : x , y ∈ A } , {\displaystyle A+A:=\{x+y:x,y\in 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...
-
conjecture (Krzysztof Kurdyka,
Tadeusz Mostowski, Adam Parusinski, 1999) Erdős
sumset conjecture (Joel Moreira,
Florian Richter,
Donald Robertson, 2018) McMullen's...
