On the number of zeros to the equation f(x1)+...+f(xn)=a over finite fields

Abstract

Let p be a prime, k a positive integer and let Fq be the finite field of q=pk elements. Let f(x) be a polynomial over Fq and a∈ Fq. We denote by Ns(f,a) the number of zeros of f(x1)+·s+f(xs)=a. In this paper, we show that Σs=1∞Ns(f,0)xs=x1-qx -x Mf(x)qMf(x), where Mf(x):=Πm∈ FqSf, m 0(x-1Sf,m) with Sf, m:=Σx∈ Fqζp Tr(mf(x)), ζp being the p-th primitive unit root and Tr being the trace map from Fq to Fp. This extends Richman's theorem which treats the case of f(x) being a monomial. Moreover, we show that the generating series Σs=1∞Ns(f,a)xs is a rational function in x and also present its explicit expression in terms of the first 2d+1 initial values N1(f,a), ..., N2d+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.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…