Constructing MSTD sets using bidirectional ballot sequences
From MaRDI portal
Publication:971849
DOI10.1016/j.jnt.2009.11.005zbMath1218.11097arXiv0908.4442WikidataQ60692228 ScholiaQ60692228MaRDI QIDQ971849
Publication date: 17 May 2010
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.4442
05A16: Asymptotic enumeration
11B13: Additive bases, including sumsets
11P70: Inverse problems of additive number theory, including sumsets
Related Items
Fringe pairs in generalized MSTD sets, When Sets Can and Cannot Have MSTD Subsets, Generalizations of a Curious Family of MSTD Sets Hidden By Interior Blocks, Union of Two Arithmetic Progressions with the Same Common Difference Is Not Sum-dominant, Sets of Cardinality 6 Are Not Sum-dominant, Infinite Families of Partitions into MSTD Subsets, The bidirectional ballot polytope, Generalized more sums than differences sets, Sums and differences of correlated random sets, Analysis of bidirectional ballot sequences and random walks ending in their maximum, Sets characterized by missing sums and differences, Counting MSTD sets in finite abelian groups, MSTD sets and Freiman isomorphisms, On sets with more products than quotients, A geometric perspective on the MSTD question
Uses Software
Cites Work
- Counting MSTD sets in finite abelian groups
- Explicit constructions of infinite families of MSTD sets
- On the number of sums and differences
- Additive completion and disjoint translations
- When almost all sets are difference dominated
- Four Proofs of the Ballot Theorem
- On A Conjecture of Conway
- A mean value density theorem of additive number theory
- Some explicit constructions of sets with more sums than differences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item