2000 character limit reached
Weighted representation functions on $\mathbb{Z}_m$
Published 21 Aug 2012 in math.NT and math.CO | (1208.4195v1)
Abstract: Let $m$, $k_1$, and $k_2$ be three integers with $m\ge 2$. For any set $A\subseteq \mathbb{Z}m$ and $n\in \mathbb{Z}_m$, let $\hat{r}{k_1,k_2}(A,n)$ denote the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In this paper, using exponential sums, we characterize all $m$, $k_1$, $k_2$, and $A$ for which $\hat{r}{k_1,k_2}(A,n)=\hat{r}{k_1,k_2}(\mathbb{Z}_m\setminus A,n)$ for all $n\in \mathbb{Z}_m$. We also pose several problems for further research.
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.