When almost all sets are difference dominated
From MaRDI portal
Publication:3055768
DOI10.1002/rsa.20268zbMath1216.11011arXiv0707.3417MaRDI QIDQ3055768
Steven J. Miller, Peter V. Hegarty
Publication date: 9 November 2010
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.3417
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
11B13: Additive bases, including sumsets
Related Items
Fringe pairs in generalized MSTD sets, When Sets Can and Cannot Have MSTD Subsets, Distribution of Missing Differences in Diffsets, 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, Distribution of Missing Sums in Sumsets, Infinite Families of Partitions into MSTD Subsets, When almost all sets are difference dominated in $\mathbb{Z}/n\mathbb{Z}$, The bidirectional ballot polytope, 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, MSTD sets and Freiman isomorphisms, A geometric perspective on the MSTD question, Sets characterized by missing sums and differences in dilating polytopes, Generalizing the distribution of missing sums in sumsets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit constructions of infinite families of MSTD sets
- Random Sidon sequences
- A new look at independence
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- Concentration of non‐Lipschitz functions and applications
- Binary linear forms over finite sets of integers
- Some explicit constructions of sets with more sums than differences
- Concentration of multivariate polynomials and its applications
