arXiv Analytics

Sign in

arXiv:2209.08509 [math.NT]AbstractReferencesReviewsResources

Additive completition of thin sets

Jin-Hui Fang, Csaba Sándor

Published 2022-09-18Version 1

Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the counting function of $A$ and $a^*(x)$ by the largest element in $A\bigcap [1,x]$. Following the work of Ruzsa and Chen-Fang, we prove that, for exact additive complements $A,B$ with $\frac{a_{n+1}}{na_n}\rightarrow\infty$, we have $A(x)B(x)-x\ge \frac{a^*(x)}{A(x)}+o\left(\frac{a^*(x)}{A(x)^2}\right)$ as $x\rightarrow +\infty$. On the other hand, we also construct exact additive complements $A,B$ with $\frac{a_{n+1}}{na_n}\rightarrow\infty$ such that $A(x)B(x)-x\le \frac{a^*(x)}{A(x)}+(1+o(1))\left(\frac{a^*(x)}{A(x)^2}\right)$ holds for infinitely many positive integers $x$.

Related articles: Most relevant | Search more
arXiv:1206.2148 [math.NT] (Published 2012-06-11, updated 2012-07-28)
Sumsets in primes containing almost all even positive integers
arXiv:1510.00812 [math.NT] (Published 2015-10-03)
Exact additive complements
arXiv:1508.03970 [math.NT] (Published 2015-08-17)
Representation of positive integers by the form $x_1...x_k + x_1 + ... + x_k$