Papers
Topics
Authors
Recent
Search
2000 character limit reached

Additive completition of thin sets

Published 18 Sep 2022 in math.NT | (2209.08509v1)

Abstract: 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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.