SETS WITH MORE SUMS THAN DIFFERENCES

By Melvyn B. Nathanson. 2006

54 citations recorded by the source corpus.

Let A be a finite subset of the integers or, more generally, of any abelian group, written additively. The set A has more sums than di! erences if |A + A| > |A ! A|. A set with this property is called an MSTD set. This paper gives explicit constructions of families of MSTD sets of integers.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/008ba5a125f95f79f3a66ac1e6639fc64d240511

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Yufei Zhao
2. Peter V. Hegarty
3. Nathan Kaplan

In Electrical and Electronic Engineering

1. Yufei Zhao
2. Peter V. Hegarty

In Management Science and Operations Research

1. Yufei Zhao
2. Peter V. Hegarty

Citations in the corpus

• Some explicit constructions of sets with more sums than differences (2006, methodology): “Our final result resolves in the affirmative Conjecture 20 of [3]:”
• Sets characterized by missing sums and differences (2009, background): “The name MSTD was later given by Nathanson [8].”