Sets of cardinality 6 are not sum-dominant

zbMATH Open1435.11022arXiv1906.00470MaRDI QIDQ5221076FDOQ5221076

Authors: Hùng Viẹt Chu 

Publication date: 24 March 2020

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|$. Hegarty used a nontrivial algorithm to find that $8$ is the smallest cardinality of a sum-dominant set. Since then, Nathanson has asked for a human-understandable proof of the result. However, due to the complexity of the interactions among numbers, it is still questionable whether such a proof can be written down in full without computers' help. In this paper, we present a computer-free proof that a sum-dominant set must have at least $7$ elements. We also answer the question raised by the author of the current paper et al about the smallest sum-dominant set of primes, in terms of its largest element. Using computers, we find that the smallest sum-dominant set of primes has $73$ as its maximum, smaller than the value found before.

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

Recommendations

• When Sets Are Not Sum-dominant
• When sets can and cannot have sum-dominant subsets
• The union of two arithmetic progressions with the same common difference is not sum-dominant
• Many sets have more sums than differences
• On sets with more restricted sums than differences

zbMATH Keywords

sum-dominant subsets

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13)

Cites Work

• On the number of sums and differences
• Sets with more sums than differences
• On A Conjecture of Conway
• Generalized more sums than differences sets
• Title not available (Why is that?)
• Explicit constructions of large families of generalized more sums than differences sets
• Some explicit constructions of sets with more sums than differences
• Problems in additive number theory. I
• Many sets have more sums than differences
• Sets characterized by missing sums and differences
• Constructing MSTD sets using bidirectional ballot sequences
• Explicit constructions of infinite families of MSTD sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting MSTD sets in finite abelian groups
• Problems in additive number theory. V: Affinely inequivalent MSTD sets
• When sets can and cannot have sum-dominant subsets
• Generalizations of a curious family of MSTD sets hidden by interior blocks
• MSTD sets and Freiman isomorphisms
• Explicit constructions of infinite families of MSTD sets
• Infinite Families of Partitions into MSTD Subsets
• Most subsets are balanced in finite groups
• When Sets Are Not Sum-dominant
• Fringe pairs in generalized MSTD sets
• On Conway's Conjecture for Integer Sets

Cited In (3)

• When Sets Are Not Sum-dominant
• The union of two arithmetic progressions with the same common difference is not sum-dominant
• A conjecture of Chu et al.. and a new family of MSTD sets

This page was built for publication: Sets of cardinality 6 are not sum-dominant

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