Additive completition of thin sets
Jin-Hui Fang, Csaba S\'andor

TL;DR
This paper investigates the structure of exact additive complements of positive integers, establishing bounds on their counting functions and constructing examples with specific asymptotic behaviors.
Contribution
It provides new bounds on the sum of counting functions for exact additive complements and constructs examples demonstrating these bounds are tight.
Findings
Established lower bounds for $A(x)B(x)-x$ in terms of $a^*(x)$ and $A(x)$.
Constructed examples of exact additive complements with prescribed asymptotic properties.
Extended previous work by Ruzsa and Chen-Fang on additive complements.
Abstract
Two sets of positive integers are called \emph{exact additive complements}, if contains all sufficiently large integers and . Let be a set of positive integers. Denote by the counting function of and by the largest element in . Following the work of Ruzsa and Chen-Fang, we prove that, for exact additive complements with , we have as . On the other hand, we also construct exact additive complements with such that holds for infinitely many positive integers .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Mathematical Dynamics and Fractals
