Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the number of zeros to the equation $f(x_1)+...+f(x_n)=a$ over finite fields (2108.05794v1)

Published 12 Aug 2021 in math.NT

Abstract: Let $p$ be a prime, $k$ a positive integer and let $\mathbb{F}q$ be the finite field of $q=pk$ elements. Let $f(x)$ be a polynomial over $\mathbb F_q$ and $a\in\mathbb F_q$. We denote by $N{s}(f,a)$ the number of zeros of $f(x_1)+\cdots+f(x_s)=a$. In this paper, we show that $$\sum_{s=1}{\infty}N_{s}(f,0)xs=\frac{x}{1-qx} -\frac{x { M_f{\prime}}(x)}{qM_f(x)},$$ where $$M_f(x):=\prod_{m\in\mathbb F_q{\ast}\atop{S_{f, m}\ne 0}}\Big(x-\frac{1}{S_{f,m}}\Big)$$ with $S_{f, m}:=\sum_{x\in \mathbb F_q}\zeta_p{{\rm Tr}(mf(x))}$, $\zeta_p$ being the $p$-th primitive unit root and ${\rm Tr}$ being the trace map from $\mathbb F_q$ to $\mathbb F_p$. This extends Richman's theorem which treats the case of $f(x)$ being a monomial. Moreover, we show that the generating series $\sum_{s=1}{\infty}N_{s}(f,a)xs$ is a rational function in $x$ and also present its explicit expression in terms of the first $2d+1$ initial values $N_{1}(f,a), ..., N_{2d+1}(f,a)$, where $d$ is a positive integer no more than $q-1$. From this result, the theorems of Chowla-Cowles-Cowles and of Myerson can be derived.

Summary

We haven't generated a summary for this paper yet.