A sum-dominant set is a finite set A of integers such that |A+A|>|A−A|. As a typical pair of elements contributes one sum and two differences, we expect sum-dominant sets to be rare in some sense. In 2006, however, Martin and O'Bryant showed that the proportion of sum-dominant subsets of {0,…,n} is bounded below by a positive constant as n→∞. Hegarty then extended their work and showed that for any prescribed s,d ∈ N_0, the proportion P^(a,d)_n of subsets of {0,…,n} that are missing exactly s sums in {0,…,2n} and exactly 2d differences in {−n,…,n} also remains positive in the limit
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
AbstractA more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S|...
AbstractThis paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a...
A sum-dominant set is a finite set A of integers such that |A+A|>|A−A|. As a typical pair of element...
ABSTRACT. A sum-dominant set is a finite set A of integers such that |A + A |> |A − A|. As a typi...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
ABSTRACT. A More Sums Than Differences (MSTD, or sum-dominant) set is a finite setA ⊂ Z such that |A...
The sumset is one of the most basic and central objects in additive number theory. Many of the most ...
ABSTRACT. Many questions in additive number theory (Goldbach’s conjecture, Fermat’s Last The-orem, t...
Abstract We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their ex...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
We investigate the relationship between the sizes of the sum and differ-ence sets attached to a subs...
We investigate the relationship between the sizes of the sum and difference sets attached to a subse...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
AbstractA more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S|...
AbstractThis paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a...
A sum-dominant set is a finite set A of integers such that |A+A|>|A−A|. As a typical pair of element...
ABSTRACT. A sum-dominant set is a finite set A of integers such that |A + A |> |A − A|. As a typi...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
Many questions in additive number theory (Goldbach's conjecture, Fermat's Last Theorem, the Twin Pri...
ABSTRACT. A More Sums Than Differences (MSTD, or sum-dominant) set is a finite setA ⊂ Z such that |A...
The sumset is one of the most basic and central objects in additive number theory. Many of the most ...
ABSTRACT. Many questions in additive number theory (Goldbach’s conjecture, Fermat’s Last The-orem, t...
Abstract We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their ex...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
We investigate the relationship between the sizes of the sum and differ-ence sets attached to a subs...
We investigate the relationship between the sizes of the sum and difference sets attached to a subse...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
AbstractA more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S|...
AbstractThis paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a...