-
additive combinatorics and
additive number theory can be
phrased in
terms of
sumsets. For example, Lagrange's four-square
theorem can be
written succinctly...
- arithmetic.
There is an
interesting relation between the
operation of
forming sumsets of
subsets of
nonnegative integers and
lunar multiplication on
binary numbers...
- (1996).
Additive Number Theory:
Inverse Problems and the
Geometry of
Sumsets.
Graduate Texts in Mathematics. Vol. 165. Springer-Verlag. ISBN 0-387-94655-1...
- tool in the
study of
lower bounds for
cardinalities of
various restricted sumsets is the
following fundamental principle: the
combinatorial Nullstellensatz...
- 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...
- (1996).
Additive Number Theory:
Inverse Problems and the
Geometry of
Sumsets.
Graduate Texts in Mathematics. Vol. 165. Springer-Verlag. ISBN 0-387-94655-1...
- of a
result of Jean
Bourgain of the size of
arithmetic progressions in
sumsets, as well as a
proof of the Cameron–Erdős
conjecture on sum-free sets of...
-
reference discusses much of the
literature on the
convex hulls of
Minkowski sumsets in its "Chapter 3
Minkowski addition" (pages 126–196): Schneider, Rolf...
- also
concerns sumsets in
groups but is
restricted to
groups whose order is a
prime number. The
first three statements deal with
sumsets whose size (in...
-
conjecture (Krzysztof Kurdyka,
Tadeusz Mostowski, Adam Parusinski, 1999) Erdős
sumset conjecture (Joel Moreira,
Florian Richter,
Donald Robertson, 2018) McMullen's...
