When Sets Are Not Sum-dominant

From MaRDI portal
Publication:5377963

zbMATH Open1418.11018arXiv1903.03533MaRDI QIDQ5377963FDOQ5377963


Authors: Hùng Viẹt Chu Edit this on Wikidata


Publication date: 11 June 2019

Abstract: Given a set A of nonnegative integers, define the sum set A+A = {a_i+a_jmid a_i,a_jin A} and the difference set A-A = {a_i-a_jmid a_i,a_jin A}. The set A is said to be sum-dominant if |A+A|>|AA|. In answering a question by Nathanson, Hegarty used a clever algorithm to find that the smallest cardinality of a sum-dominant set is 8. Since then, Nathanson has been asking for a human-understandable proof of the result. We offer a computer-free proof that a set of cardinality less than 6 is not sum-dominant. Furthermore, we prove that the introduction of at most two numbers into a set of numbers in an arithmetic progression does not give a sum-dominant set. This theorem eases several of our proofs and may shed light on future work exploring why a set of cardinality 6 is not sum-dominant. Finally, we prove that if a set contains a certain number of integers from a specific sequence, then adding a few arbitrary numbers into the set does not give a sum-dominant set.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (7)





This page was built for publication: When Sets Are Not Sum-dominant

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