Finding and Counting MSTD Sets

DOI10.1007/978-1-4939-1601-6_7MaRDI QIDQ5265390zbMATH OpenOpenAlexFDO

Authors Geoffrey Iyer, Oleg Lazarev, Steven J. Miller, Liyang Zhang

Publication date 23 July 2015

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.2719

zbMATH Keywords

more sum than difference setssum-dominantsum-dominated set

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Additive number theory; partitions (11P99)

Abstract: We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if the probability that each element is chosen tends to zero, and 'explicit' constructions of large families of MSTD sets. We conclude with some new constructions and results of generalized MSTD sets, including among other items results on a positive percentage of sets having a given linear combination greater than another linear combination, and a proof that a positive percentage of sets are $k$-generational sum-dominant (meaning $A$, $A+A$, $\mathrm{...}$, $kA=A+\mathrm{...}+A$ are each sum-dominant).

Recommendations

• Counting MSTD sets in finite abelian groups
• Counting SET-free sets
• Counting sets with exceptions
• Counting minimal dominating sets
• A new sieve for restricted multiset counting
• Counting sets with small sumset and applications
• Counting Value Sets: Algorithm and Complexity

Cited in

(13)

• On sets with more products than quotients
• Constructions of generalized MSTD sets in higher dimensions
• Explicit constructions of infinite families of MSTD sets
• Problems in additive number theory. V: Affinely inequivalent MSTD sets
• Generalized more sums than differences sets
• Fringe pairs in generalized MSTD sets
• Explicit constructions of large families of generalized more sums than differences sets
• 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
• Infinite Families of Partitions into MSTD Subsets
• Some explicit constructions of sets with more sums than differences
• On the minimum cardinality of MPTQ sets
• Constructing MSTD sets using bidirectional ballot sequences

This page was built for publication: Finding and Counting MSTD Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265390)