arXiv Analytics

Sign in

arXiv:1609.01700 [math.NT]AbstractReferencesReviewsResources

Problems in additive number theory, V: Affinely inequivalent MSTD sets

Melvyn B. Nathanson

Published 2016-09-06Version 1

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.

Related articles: Most relevant | Search more
arXiv:1604.08940 [math.NT] (Published 2016-04-29)
Comparison estimates for linear forms in additive number theory
arXiv:2411.02365 [math.NT] (Published 2024-11-04, updated 2024-12-30)
Problems in additive number theory, VI: Sizes of sumsets
arXiv:1511.06478 [math.NT] (Published 2015-11-20)
Every finite set of integers is an asymptotic approximate group