Polynomial quotients: Interpolation, value sets and Waring's problem

From MaRDI portal
(Redirected from Publication:5500820)



Abstract: For an odd prime p and an integer wge1, polynomial quotients qp,w(u) are defined by q_{p,w}(u)equiv frac{u^w-u^{wp}}{p} �mod p ~~ mathrm{with}~~ 0 le q_{p,w}(u) le p-1, ~~uge 0, which are generalizations of Fermat quotients qp,p−1(u). First, we estimate the number of elements 1leu<Nlep for which for a given polynomial f(x) over the finite field mathbbFp. In particular, for the case f(x)=x we get bounds on the number of fixed points of polynomial quotients. Second, before we study the problem of estimating the smallest number (called the Waring number) of summands needed to express each element of mathbbFp as sum of values of polynomial quotients, we prove some lower bounds on the size of their value sets, and then we apply these lower bounds to prove some bounds on the Waring number using results from bounds on additive character sums and additive number theory.




Cites work









This page was built for publication: Polynomial quotients: Interpolation, value sets and Waring's problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500820)