A geometric perspective on the MSTD question
Abstract
A more sums than differences (MSTD) set A is a subset of Z for which |A+A| > |A-A|. Martin and O'Bryant used probabilistic techniques to prove that a non-vanishing proportion of subsets of \1, …, n\ are MSTD as n ∞. However, to date only a handful of explicit constructions of MSTD sets are known. We study finite collections of disjoint intervals on the real line, I, and explore the MSTD question for such sets, as well as the relation between such sets and MSTD subsets of Z. In particular we show that every finite subset of Z can be transformed into an element of I with the same additive behavior. Using tools from discrete geometry, we show that there are no MSTD sets in I consisting of three or fewer intervals, but there are MSTD sets for four or more intervals. Furthermore, we show how to obtain an infinite parametrized family of MSTD subsets of Z from a single such set A; these sets are parametrized by lattice points satisfying simple congruence relations contained in a polyhedral cone associated to A.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.