2000 character limit reached
Additive representation functions and discrete convolutions
Published 7 Sep 2020 in math.NT | (2009.03392v1)
Abstract: For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to \infty}b_n<1$. In this paper, we prove some Erd\H os--Fuchs-type theorems about the error terms appearing in approximation formul\ae\ for $R_A(n)=\sum_{k=0}n\chi_A(k)\chi_A(n-k)$ and $\sum_{n=0}NR_A(n)$ having principal terms $\sum_{k=0}nb_kb_{n-k}$ and $\sum_{n=0}N\sum_{k=0}nb_kb_{n-k}$, respectively.
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.