Sets characterized by missing sums and differences
From MaRDI portal
Abstract: 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 improves the previous result of Martin and O'Bryant that there is a lower limit of at least 2 x 10^{-7}. Monte Carlo experiments suggest that rho approx 4.5 x 10^{-4}. We present a deterministic algorithm that can compute rho up to arbitrary precision. We also describe the structure of a random MSTD subset S of {0, 1, ..., n}. We formalize the intuition that fringe elements are most significant, while middle elements are nearly unrestricted. For instance, the probability that any ``middle element is in S approaches 1/2 as n -> infinity, confirming a conjecture of Miller, Orosz, and Scheinerman. In general, our results work for any specification on the number of missing sums and the number of missing differences of S, with MSTD sets being a special case.
Recommendations
- Sets of integers with missing differences
- scientific article; zbMATH DE number 3873442
- Sets characterized by missing sums and differences in dilating polytopes
- Sumsets in difference sets
- Some sets of sums and differences
- Sets with more differences than sums
- Sets with more sums than differences
- Sums and difference of finite sets
- Sum and difference free sets
- Distribution of Missing Sums in Sumsets
Cites work
- scientific article; zbMATH DE number 3501622 (Why is no real title available?)
- scientific article; zbMATH DE number 3595193 (Why is no real title available?)
- scientific article; zbMATH DE number 1315264 (Why is no real title available?)
- A mean value density theorem of additive number theory
- Additive completion and disjoint translations
- Constructing MSTD sets using bidirectional ballot sequences
- Constructing numerical semigroups of a given genus.
- Counting MSTD sets in finite abelian groups
- Explicit constructions of infinite families of MSTD sets
- Many sets have more sums than differences
- On A Conjecture of Conway
- On the number of sums and differences
- Problems in additive number theory. I
- Sets with more sums than differences
- Some explicit constructions of sets with more sums than differences
- When almost all sets are difference dominated
Cited in
(26)- Constructions of generalized MSTD sets in higher dimensions
- Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups
- Sums and differences of correlated random sets
- The bidirectional ballot polytope
- Distribution of Missing Differences in Diffsets
- A geometric perspective on the MSTD question
- Constructing MSTD sets using bidirectional ballot sequences
- Generalized more sums than differences sets
- Counting MSTD sets in finite abelian groups
- Infinite Families of Partitions into MSTD Subsets
- Problems in additive number theory. V: Affinely inequivalent MSTD sets
- Sets characterized by missing sums and differences in dilating polytopes
- On sets with more products than quotients
- A conjecture of Chu et al.. and a new family of MSTD sets
- Explicit constructions of infinite families of MSTD sets
- When sets can and cannot have sum-dominant subsets
- When sets can or cannot be product-dominant
- Sets of integers with missing differences
- When almost all sets are difference dominated in \(\mathbb{Z}/n\mathbb{Z}\)
- Generalizing the distribution of missing sums in sumsets
- Sets of cardinality 6 are not sum-dominant
- Distribution of Missing Sums in Sumsets
- Fringe pairs in generalized MSTD sets
- MSTD sets and Freiman isomorphisms
- Generalizations of a curious family of MSTD sets hidden by interior blocks
- The union of two arithmetic progressions with the same common difference is not sum-dominant
This page was built for publication: Sets characterized by missing sums and differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640027)
