When Sets Can and Cannot Have MSTD Subsets
From MaRDI portal
Publication:4561331
zbMath1408.11006arXiv1608.03256MaRDI QIDQ4561331
Nathan McNew, Victor Xu, Hùng Viẹt Chu, Sean Zhang, Steven J. Miller
Publication date: 5 December 2018
Full work available at URL: https://arxiv.org/abs/1608.03256
Related Items (5)
Sets of Cardinality 6 Are Not Sum-dominant ⋮ Distribution of Missing Differences in Diffsets ⋮ Generalizing the distribution of missing sums in sumsets ⋮ On sets with more products than quotients ⋮ Union of Two Arithmetic Progressions with the Same Common Difference Is Not Sum-dominant
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized more sums than differences sets
- Sums and differences of correlated random sets
- Sets characterized by missing sums and differences
- Counting MSTD sets in finite abelian groups
- Constructing MSTD sets using bidirectional ballot sequences
- Explicit constructions of infinite families of MSTD sets
- On the number of sums and differences
- The primes contain arbitrarily long arithmetic progressions
- Sets characterized by missing sums and differences in dilating polytopes
- Explicit Constructions of Infinite Families of MSTD Sets
- When almost all sets are difference dominated
- On A Conjecture of Conway
- Explicit Constructions of Large Families of Generalized More Sums Than Differences Sets
- Most Subsets Are Balanced in Finite Groups
- Some explicit constructions of sets with more sums than differences
- Sums of Finite Sets of Integers
This page was built for publication: When Sets Can and Cannot Have MSTD Subsets
