arXiv Analytics

Sign in

arXiv:2012.12017 [math.NT]AbstractReferencesReviewsResources

On the structure of the $h$-fold sumsets

Jun-Yu Zhou, Quan-Hui Yang

Published 2020-12-22Version 1

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$, and~$A=\left\{a_{0}, a_{1}, \ldots, a_{k}\right\}$ is a finite set of integers such that~$0=a_{0}<a_{1}<\cdots<a_{k}$ and $\gcd\left(a_{1}, a_2,\ldots, a_{k}\right)=1,$ then there exist integers ~$c_{t},d_{t}$ and sets~$C_{t}\subseteq[0, c_{t}-2]$, $D_{t} \subseteq[0, d_{t}-2]$ such that $$(h A)^{(t)}=C_{t} \cup\left[c_{t}, h a_{k}-d_{t}\right] \cup\left(h a_{k-1}-D_{t}\right) $$ for all~$h \geq\sum_{i=2}^{k}(ta_{i}-1)-1.$ This improves a recent result of Nathanson with the bound $h \geq (k-1)\left(t a_{k}-1\right) a_{k}+1$.

Comments: 8 pages
Categories: math.NT
Subjects: 11B13, G.2.1
Related articles: Most relevant | Search more
arXiv:2005.10809 [math.NT] (Published 2020-05-21)
Sums of Finite Sets of Integers, II
arXiv:1506.03423 [math.NT] (Published 2015-06-10)
Polynomials with Maximum Lead Coefficient Bounded on a Finite Set
arXiv:1702.05823 [math.NT] (Published 2017-02-20)
Improved lower bound for the number of unimodular zeros of self-reciprocal polynomials with coefficients in a finite set