ABSTRACT. We explicitly construct infinite families of MSTD (more sums than differ-ences) sets, i.e., sets where |A+A |> |A−A|. There are enough of these sets to prove that there exists a constant C such that at least C/r4 of the 2r subsets of {1,..., r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2r/2 for some polynomial f(r)). We conclude by general-izing our method to compare linear forms 1A+ · · ·+ nA with i ∈ {−1, 1}. 1
ABSTRACT. A More Sums Than Differences (MSTD, or sum-dominant) set is a finite setA ⊂ Z such that |A...
AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H....
Graduation date: 1971In this thesis we investigate the extension of certain theorems\ud of additive ...
We explicitly construct infinite families of MSTD (more sums than differences) sets, i.e., sets wher...
Abstract We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their ex...
Let A be a finite subset of the integers or, more generally, of any abelian group, written additivel...
A more sums than differences (MSTD) set is a finite subset S of the integers such that |S + S |> ...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
A More Sums Than Differences (MSTD) set is a set A for which |A+A |> |A−A|. Martin and O’Bryant p...
In an abelian group G, a more sums than differences (MSTD) set is a subset A ⊂ G such that |A+A |>...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
AbstractIn an abelian group G, a more sums than differences (MSTD) set is a subset A⊂G such that |A+...
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C o...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractIf T is a family of sets and A some set we denote by T ∩ A the following family of subsets o...
ABSTRACT. A More Sums Than Differences (MSTD, or sum-dominant) set is a finite setA ⊂ Z such that |A...
AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H....
Graduation date: 1971In this thesis we investigate the extension of certain theorems\ud of additive ...
We explicitly construct infinite families of MSTD (more sums than differences) sets, i.e., sets wher...
Abstract We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their ex...
Let A be a finite subset of the integers or, more generally, of any abelian group, written additivel...
A more sums than differences (MSTD) set is a finite subset S of the integers such that |S + S |> ...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
A More Sums Than Differences (MSTD) set is a set A for which |A+A |> |A−A|. Martin and O’Bryant p...
In an abelian group G, a more sums than differences (MSTD) set is a subset A ⊂ G such that |A+A |>...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
AbstractIn an abelian group G, a more sums than differences (MSTD) set is a subset A⊂G such that |A+...
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C o...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractIf T is a family of sets and A some set we denote by T ∩ A the following family of subsets o...
ABSTRACT. A More Sums Than Differences (MSTD, or sum-dominant) set is a finite setA ⊂ Z such that |A...
AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H....
Graduation date: 1971In this thesis we investigate the extension of certain theorems\ud of additive ...