Fringe pairs in generalized MSTD sets

DOI10.1142/S1793042117501470MaRDI QIDQ4595089zbMATH OpenOpenAlexFDO

Authors Megumi Asada, Sarah Manski, Steven J. Miller, Hong Suh

Publication date 28 November 2017

Published in International Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

sum-dominant sets\(k\)-generational setsarbitrary differencesfringe pairsgeneralized MSTD sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Additive bases, including sumsets (11B13)

Abstract: A More Sums Than Differences (MSTD) set is a set $A$ for which $|A+A|>|A-A|$. Martin and O'Bryant proved that the proportion of MSTD sets in $0,1,dots,n$ is bounded below by a positive number as $n$ goes to infinity. Iyer, Lazarev, Miller and Zhang introduced the notion of a generalized MSTD set, a set $A$ for which $|sA-dA|>|sigmaA-deltaA|$ for a prescribed $s+d=sigma+delta$. We offer efficient constructions of $k$-generational MSTD sets, sets $A$ where $A,A+A,dots,kA$ are all MSTD. We also offer an alternative proof that the proportion of sets $A$ for which $|sA-dA|-|sigmaA-deltaA|=x$ is positive, for any $xinmathbbZ$. We prove that for any $epsilon>0$, $Pr(1-epsilon<log|sA-dA|/log|sigmaA-deltaA|<1+epsilon)$ goes to $1$ as the size of $A$ goes to infinity and we give a set $A$ which has the current highest value of $log|A+A|/log|A-A|$. We also study decompositions of intervals $0,1,dots,n$ into MSTD sets and prove that a positive proportion of decompositions into two sets have the property that both sets are MSTD.

Recommendations

• Constructions of generalized MSTD sets in higher dimensions
• Finding and Counting MSTD Sets
• Sets characterized by missing sums and differences
• Infinite Families of Partitions into MSTD Subsets
• Explicit constructions of large families of generalized more sums than differences sets

Cites work

• scientific article; zbMATH DE number 3595193 (Why is no real title available?)
• scientific article; zbMATH DE number 914352 (Why is no real title available?)
• Constructing MSTD sets using bidirectional ballot sequences
• Counting MSTD sets in finite abelian groups
• Explicit constructions of infinite families of MSTD sets
• Explicit constructions of infinite families of MSTD sets
• Generalized more sums than differences sets
• Many sets have more sums than differences
• Most subsets are balanced in finite groups
• On the number of sums and differences
• Problems in additive number theory. I
• Sets characterized by missing sums and differences
• Sets with more sums than differences
• Some explicit constructions of sets with more sums than differences
• Sums of Finite Sets of Integers
• When almost all sets are difference dominated

Cited in

(8)

• Constructions of generalized MSTD sets in higher dimensions
• Distribution of Missing Differences in Diffsets
• Infinite Families of Partitions into MSTD Subsets
• Generalizing the distribution of missing sums in sumsets
• Sets of cardinality 6 are not sum-dominant
• MSTD sets and Freiman isomorphisms
• 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

This page was built for publication: Fringe pairs in generalized MSTD sets

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