arXiv · 1609.01700
Problems in additive number theory, V: Affinely inequivalent MSTD sets
Abstract
An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related open problems.
Explore related subjects
Keep this discovery
Melvyn B. Nathanson. 2016-09-06. Problems in additive number theory, V: Affinely inequivalent MSTD sets. https://arxiv.org/abs/1609.01700
Cite the original work for its findings. Save a collection to share your selection of sources.