Related papers: Sets with more sums than differences

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

A More Sums Than Difference (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. Since addition is commutative while subtraction isn't, it was…

A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…

A More Sums Than Differences (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. We address a problem posed by Samuel Allen Alexander that asks…

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

A more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S| > |S-S|. We construct a new dense family of MSTD subsets of {0, 1, 2, ..., n-1}. Our construction gives Theta(2^n/n) MSTD sets, improving the…

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

Let $A$ be a set of finite integers, define $$A+A \ = \ \{a_1+a_2: a_1,a_2 \in A\}, \ \ \ A-A \ = \ \{a_1-a_2: a_1,a_2 \in A\},$$ and for non-negative integers $s$ and $d$ define $$sA-dA\ =\ \underbrace{A+\cdots+A}_{s}…

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related…

A more sums than differences (MSTD) set $A$ is a subset of $\mathbb{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, \dots, n\}$ are MSTD as $n \to…

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

A set $A$ is MSTD (more-sum-than-difference) or sum-dominant if $|A+A|>|A-A|$, and is RSD (restricted-sum dominant) if $|A\hat{+}A|>|A-A|$, where $A\hat{+}A$ is the set of sums of distinct elements in $A$. We study an interesting family of…

A More Sums Than Differences (MSTD) set is a set $A$ for which $|A+A|>|A-A|$. Martin and O'Bryant proved that the proportion of MSTD sets in $\{0,1,\dots,n\}$ is bounded below by a positive number as $n$ goes to infinity. Iyer, Lazarev,…

We outline a general algorithm for verifying whether a subset of the integers is a more sum than differences (MSTD) set, also known as sum dominated sets, and give estimates on its computational complexity. We conclude with some numerical…

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

An MSTD set is a finite set with more pairwise sums than differences. $(\Upsilon,\Phi)$-ismorphisms are generalizations of Freiman isomorphisms to arbitrary linear forms. These generalized isomorphisms are used to prove that every finite…

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…