Sums of Finite Sets of Integers, II
Number Theory
2022-05-03 v3 Combinatorics
Abstract
Let be a finite set of integers, and let denote the -fold sumset of . Let be subset of consisting of all integers that have at least representations as a sum of elements of . The structure of the set is completely determined for all .
Keywords
Cite
@article{arxiv.2005.10809,
title = {Sums of Finite Sets of Integers, II},
author = {Melvyn B. Nathanson},
journal= {arXiv preprint arXiv:2005.10809},
year = {2022}
}
Comments
8 pages; minor revisions