The union of two arithmetic progressions with the same common difference is not sum-dominant

MaRDI QIDQ5148775zbMATH OpenFDO

Authors Hùng Viẹt Chu

Publication date 5 February 2021

Full work available at URL https://arxiv.org/abs/1906.03793, http://math.colgate.edu/~integers/u87/u87.pdf

zbMATH Keywords

more-sum-than-difference (MSTD) setssum-dominant setsunion of two arithmetic progressions

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Arithmetic progressions (11B25) Other combinatorial number theory (11B75)

Abstract: Given a finite set $AsubseteqmathbbN$, define the sum set ${\displaystyle }$A+A = {a_i+a_jmid a_i,a_jin A}${\displaystyle }$ and the difference set ${\displaystyle }$A-A = {a_i-a_jmid a_i,a_jin A}.${\displaystyle }$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. We prove the following results. 1) The union of two arithmetic progressions (with the same common difference) is not sum-dominant. This result partially proves a conjecture proposed by the author in a previous paper; that is, the union of any two arbitrary arithmetic progressions is not sum-dominant. 2) Hegarty proved that a sum-dominant set must have at least $8$ elements with computers' help. The author of the current paper provided a human-verifiable proof that a sum-dominant set must have at least $7$ elements. A natural question is about the largest cardinality of sum-dominant subsets of an arithmetic progression. Fix $nge16$. Let $N$ be the cardinality of the largest sum-dominant subset(s) of $0,1,ldots,n-1$ that contain(s) $0$ and $n-1$. Then $n-7leNlen-4$; that is, from an arithmetic progression of length $nge16$, we need to discard at least $4$ and at most $7$ elements (in a clever way) to have the largest sum-dominant set(s). 3) Let $RinmathbbN$ have the property that for all $rgeR$, $1,2,ldots,r$ can be partitioned into $3$ sum-dominant subsets, while $1,2,ldots,R-1$ cannot. Then $24leRle145$. This result answers a question by the author et al. in another paper on whether we can find a stricter upper bound for $R$.

Recommendations

• When Sets Are Not Sum-dominant
• When sets can and cannot have sum-dominant subsets
• Sets of cardinality 6 are not sum-dominant
• Many sets have more sums than differences
• Long Arithmetic Progressions in Small Sumsets

Cites work

• Constructing MSTD sets using bidirectional ballot sequences
• Explicit constructions of infinite families of MSTD sets
• Explicit constructions of large families of generalized more sums than differences sets
• Finding and Counting MSTD Sets
• Fringe pairs in generalized MSTD sets
• Generalizations of a curious family of MSTD sets hidden by interior blocks
• Generalized more sums than differences sets
• scientific article; zbMATH DE number 3873442 (Why is no real title available?)
• scientific article; zbMATH DE number 3501622 (Why is no real title available?)
• scientific article; zbMATH DE number 3595193 (Why is no real title available?)
• Infinite Families of Partitions into MSTD Subsets
• Many sets have more sums than differences
• On A Conjecture of Conway
• On Conway's conjecture for integer sets
• On Conway's Conjecture for Integer Sets
• On sets with more restricted sums than differences
• On the number of sums and differences
• Problems in additive number theory. I
• Sets characterized by missing sums and differences
• Sets of cardinality 6 are not sum-dominant
• Sets with more sums than differences
• Some explicit constructions of sets with more sums than differences
• When almost all sets are difference dominated
• When Sets Are Not Sum-dominant
• When sets can and cannot have sum-dominant subsets

Cited in

(5)

• Sets of cardinality 6 are not sum-dominant
• Infinite Families of Partitions into MSTD Subsets
• A conjecture of Chu et al.. and a new family of MSTD sets
• On the minimum cardinality of MPTQ sets
• The union of two arithmetic progressions with different common differences is not an MSTD set

This page was built for publication: The union of two arithmetic progressions with the same common difference is not sum-dominant

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