A note on the lower bound of representation functions
Abstract
For a set A of nonnegative integers, let R2(A,n) denote the number of solutions to n=a+a' with a,a'∈ A, a<a'. Let A0 be the Thue-Morse sequence and B0=N A0. Let A⊂ N and N be a positive integer such that R2(A,n)=R2(N A,n) for all n≥ 2N-1. Previously, the first author proved that if |A A0|=+∞ and |A B0|=+∞, then R2(A,n)≥ n+356N-52-1 for all n≥ 1. In this paper, we prove that the above lower bound is nearly best possible. We also get some other results.
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.