Some explicit constructions of sets with more sums than differences

DOI10.4064/AA130-1-4MaRDI QIDQ5423577zbMATH OpenOpenAlexFDO

Authors Peter Hegarty

Publication date 23 October 2007

Published in Acta Arithmetica (Search for Journal in Brave)

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

zbMATH Keywords

difference setsMSTD setssumsets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)

Abstract: We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a unique MSTD subset of {�f Z} of size 8. Secondly, starting from some examples of size 9, we present several new constructions of infinite families of MSTD sets. Thirdly we show that for every fixed ordered pair of non-negative integers (j,k), as n -> infty a positive proportion of the subsets of {0,1,2,...,n} satisfy |A+A| = (2n+1) - j, |A-A| = (2n+1) - 2k.

Recommendations

• Sets with more sums than differences
• Explicit constructions of large families of generalized more sums than differences sets
• Explicit constructions of infinite families of MSTD sets
• Finding and Counting MSTD Sets
• Constructions of generalized MSTD sets in higher dimensions

Cited in

(30)

• MSTD sets and Freiman isomorphisms
• On sets with more products than quotients
• A geometric perspective on the MSTD question
• Sets characterized by missing sums and differences in dilating polytopes
• Constructions of generalized MSTD sets in higher dimensions
• Generalizing the distribution of missing sums in sumsets
• Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups
• Explicit constructions of infinite families of MSTD sets
• When almost all sets are difference dominated
• Problems in additive number theory. V: Affinely inequivalent MSTD sets
• Sets with more sums than differences
• Generalized more sums than differences sets
• When sets can and cannot have sum-dominant subsets
• Fringe pairs in generalized MSTD sets
• Explicit constructions of large families of generalized more sums than differences sets
• Sums and differences of correlated random sets
• Distribution of Missing Differences in Diffsets
• The 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
• Sets characterized by missing sums and differences
• A conjecture of Chu et al.. and a new family of MSTD sets
• On the minimum cardinality of MPTQ sets
• Counting MSTD sets in finite abelian groups
• The union of two arithmetic progressions with different common differences is not an MSTD set
• On an entropic analogue of additive energy
• Additional constructions of sequences of alternating sum and difference dominated sets
• Sets with more differences than sums
• Constructing MSTD sets using bidirectional ballot sequences
• Explicit constructions of infinite families of MSTD sets

This page was built for publication: Some explicit constructions of sets with more sums than differences

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