When Sets Can and Cannot Have Sum-Dominant Subsets

Description
A finite set of integers A is a sum-dominant (also called a More Sums Than Differences or MSTD) set if |A+A| > |A−A|. While almost all subsets of {0, . . . , n} are not sum-dominant, interestingly a small positive percentage are. We explore sufficient conditions on infinite sets of positive integers such that there are either no sum-dominant subsets, at most finitely many sum-dominant subsets, or infinitely many sum-dominant subsets. In particular, we prove no subset of the Fibonacci numbers is a sum-dominant set, establish conditions such that solutions to a recurrence relation have only finitely many sum-dominant subsets, and show there are infinitely many sum-dominant subsets of the primes.

In collections

File details
ID Label Size Mimetype Created
OBJ OBJ datastream 186.87 KiB application/pdf 2020-06-15
TN TN 1.74 KiB image/jpeg 2020-06-15