Constructing MSTD sets using bidirectional ballot sequences
From MaRDI portal
Publication:971849
Abstract: 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 previous best construction with Omega(2^n/n^4) MSTD sets by Miller, Orosz, and Scheinerman.
Recommendations
- Explicit constructions of infinite families of MSTD sets
- Some explicit constructions of sets with more sums than differences
- Explicit constructions of large families of generalized more sums than differences sets
- Counting MSTD sets in finite abelian groups
- Problems in additive number theory. V: Affinely inequivalent MSTD sets
- Sets characterized by missing sums and differences
- Finding and Counting MSTD Sets
- Generalizations of a curious family of MSTD sets hidden by interior blocks
- A geometric perspective on the MSTD question
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
- Counting MSTD sets in finite abelian groups
- Explicit constructions of infinite families of MSTD sets
- Four Proofs of the Ballot Theorem
- 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
- The On-Line Encyclopedia of Integer Sequences
- When almost all sets are difference dominated
Cited in
(21)- Greedy Gray codes for Dyck words and ballot sequences
- Constructions of generalized MSTD sets in higher dimensions
- Sums and differences of correlated random sets
- The bidirectional ballot polytope
- Distribution of Missing Differences in Diffsets
- A geometric perspective on the MSTD question
- Generalized more sums than differences sets
- Counting MSTD sets in finite abelian groups
- Infinite Families of Partitions into MSTD Subsets
- On sets with more products than quotients
- A conjecture of Chu et al.. and a new family of MSTD sets
- When sets can and cannot have sum-dominant subsets
- Generalizing the distribution of missing sums in sumsets
- Sets of cardinality 6 are not sum-dominant
- Analysis of bidirectional ballot sequences and random walks ending in their maximum
- 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
- Sets characterized by missing sums and differences
- Generating 2-Gray codes for ballot sequences in constant amortized time
This page was built for publication: Constructing MSTD sets using bidirectional ballot sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971849)
