Constructing MSTD sets using bidirectional ballot sequences
From MaRDI portal
Publication:971849
DOI10.1016/J.JNT.2009.11.005zbMATH Open1218.11097arXiv0908.4442OpenAlexW2111033825WikidataQ60692228 ScholiaQ60692228MaRDI QIDQ971849FDOQ971849
Publication date: 17 May 2010
Published in: Journal of Number Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0908.4442
Asymptotic enumeration (05A16) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The On-Line Encyclopedia of Integer Sequences
- On the number of sums and differences
- Additive completion and disjoint translations
- When almost all sets are difference dominated
- On A Conjecture of Conway
- Some explicit constructions of sets with more sums than differences
- Explicit constructions of infinite families of MSTD sets
- Four Proofs of the Ballot Theorem
- A mean value density theorem of additive number theory
- Counting MSTD sets in finite abelian groups
Cited In (21)
- On sets with more products than quotients
- Generalized more sums than differences sets
- Sets characterized by missing sums and differences
- Greedy Gray codes for Dyck words and ballot sequences
- Infinite Families of Partitions into MSTD Subsets
- Union of Two Arithmetic Progressions with the Same Common Difference Is Not Sum-dominant
- Sets of Cardinality 6 Are Not Sum-dominant
- A geometric perspective on the MSTD question
- Sums and differences of correlated random sets
- MSTD sets and Freiman isomorphisms
- Constructions of generalized MSTD sets in higher dimensions
- Generalizing the distribution of missing sums in sumsets
- Counting MSTD sets in finite abelian groups
- Distribution of Missing Differences in Diffsets
- The bidirectional ballot polytope
- Analysis of bidirectional ballot sequences and random walks ending in their maximum
- A conjecture of Chu et al.. and a new family of MSTD sets
- Generalizations of a Curious Family of MSTD Sets Hidden By Interior Blocks
- When Sets Can and Cannot Have MSTD Subsets
- Generating 2-Gray codes for ballot sequences in constant amortized time
- Fringe pairs in generalized MSTD sets
Uses Software
Recommendations
- Explicit Constructions of Large Families of Generalized More Sums Than Differences Sets 👍 👎
- Finding and Counting MSTD Sets 👍 👎
- Some explicit constructions of sets with more sums than differences 👍 👎
- Sets characterized by missing sums and differences 👍 👎
- Explicit constructions of infinite families of MSTD sets 👍 👎
- Counting MSTD sets in finite abelian groups 👍 👎
- A geometric perspective on the MSTD question 👍 👎
- Problems in additive number theory, V: Affinely inequivalent MSTD sets 👍 👎
- Generalizations of a Curious Family of MSTD Sets Hidden By Interior Blocks 👍 👎
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)
