Tanuj Mathur, Tian An Wong
Published 2018-10-17Version 1
We outline a general algorithm for verifying whether a subset of the integers is a more sum than differences (MSTD) set, also known as sum dominated sets, and give estimates on its computational complexity. We conclude with some numerical results on large MSTD sets and MSTD subsets of $[1,N]\cap \mathbb Z$ for $N$ up to 160.
When Sets Can and Cannot Have MSTD Subsets
Infinite Families of Partitions into MSTD Subsets
The computational complexity of the local postage stamp problem
![QR code for arXiv:1810.07358 [math.NT]](http://oss.arxitics.com/images/favicon.svg)