2000 character limit reached
On a problem of Chen and Fang related to infinite additive complements
Published 17 Dec 2020 in math.NT | (2012.09675v1)
Abstract: Two infinite sets $A$ and $B$ of nonnegative integers are called additive complements if their sumset contains every nonnegative integer. In 1964, Danzer constructed infinite additive complements $A$ and $B$ with $A(x)B(x) = (1 + o(1))x$ as $x \rightarrow \infty$, where $A(x)$ and $B(x)$ denote the counting function of the sets $A$ and $B$, respectively. In this paper we solve a problem of Chen and Fang by extending the construction of Danzer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.