Problems in additive number theory, V: Affinely inequivalent MSTD sets
Number Theory
2021-01-06 v3
Abstract
An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers , there are infinitely many affinely inequivalent MSTD sets of cardinality . There are several related open problems.
Cite
@article{arxiv.1609.01700,
title = {Problems in additive number theory, V: Affinely inequivalent MSTD sets},
author = {Melvyn B. Nathanson},
journal= {arXiv preprint arXiv:1609.01700},
year = {2021}
}
Comments
11 pages; minor corrections