2000 character limit reached
A note on the lower bound of representation functions
Published 5 Nov 2019 in math.NT | (1911.01579v1)
Abstract: For a set $A$ of nonnegative integers, let $R_2(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$. Let $A_0$ be the Thue-Morse sequence and $B_0=\mathbb{N}\setminus A_0$. Let $A\subset \mathbb{N}$ and $N$ be a positive integer such that $R_2(A,n)=R_2(\mathbb{N}\setminus A,n)$ for all $n\geq 2N-1$. Previously, the first author proved that if $|A\cap A_0|=+\infty$ and $|A\cap B_0|=+\infty$, then $R_2(A,n)\geq \frac{n+3}{56N-52}-1$ for all $n\geq 1$. In this paper, we prove that the above lower bound is nearly best possible. We also get some other results.
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.