The Waring's problem over finite fields through generalized Paley graphs

From MaRDI portal
Publication:2659237



Abstract: We show that the Waring's number over a finite field mathbbFq, denoted g(k,q), when exists, coincides with the diameter of the generalized Paley graph Gamma(k,q)=Cay(mathbbFq,Rk) with Rk=xk:xinmathbbFq∗. We find infinite new families of exact values of g(k,q) from a characterization of graphs Gamma(k,q) which are also Hamming graphs previously proved by Lim and Praeger in 2009. Then, we show that every positive integer is the Waring number for some pair (k,q) with q not a prime. Finally, we find a lower bound for g(k,p) with p prime by using that Gamma(k,p) is a circulant graph in this case.


Given a positive integer \(k\), and a finite field \(\mathbb{F}_q\), let \(g(k,q)\) be the smallest positive integer \(m\) such that every sum of \(k\)-th powers in \(\mathbb{F}_q\) is a sum of \(m\) \(k\)-th powers. The paper considers the case when the set of these sums equal the full field, and computes \(g(k,q)\) with a novel approach, namely computing instead the size of certain appropriate Cayley graph. One of the many interesting results is the following: Theorem. Let \(p\) be an odd prime congruent to \(1\) modulo a given even number \(n\). Then \[ g \left(\frac{p-1}{n},p\right) \geq \frac{1}{2} \left(p \left({\frac{n}{2}}\right)! \right)^{\frac{2}{n}}-\frac{n+2}{4}. \] The paper is very detailed and well written.











This page was built for publication: The Waring's problem over finite fields through generalized Paley graphs

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