Additive completition of thin sets

Abstract

Two sets A,B of positive integers are called exact additive complements, if A+B contains all sufficiently large integers and A(x)B(x)/x→1. Let A=\a1<a2<·s\ be a set of positive integers. Denote A(x) by the counting function of A and a*(x) by the largest element in A [1,x]. Following the work of Ruzsa and Chen-Fang, we prove that, for exact additive complements A,B with an+1nan→∞, we have A(x)B(x)-x a*(x)A(x)+o(a*(x)A(x)2) as x→ +∞. On the other hand, we also construct exact additive complements A,B with an+1nan→∞ such that A(x)B(x)-x a*(x)A(x)+(1+o(1))(a*(x)A(x)2) holds for infinitely many positive integers x.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…