A reduction formula for Waring numbers through generalized Paley graphs

Abstract

We give a reduction formula for the Waring number g(k,q) over a finite field Fq. By exploiting the relation between g(k,q) with the diameter of the generalized Paley graph (k,q) and by using the characterization due to Pearce and Praeger (2019) of those (k,q) which are Cartesian decomposable, we obtain the reduction formula g(pab-1bc,pab) = b g(pa-1c,pa) for p prime and a,b,c positive integers under certain arithmetic conditions. Then, we find some arithmetic conditions to apply the formula above, which allow us to obtain many infinite families of explicit values of Waring numbers. Finally, we use the reduction formula together with the characterization of 2-weight irreducible cyclic codes due to Schmidt and White (2002) to find infinite families of explicit even values of g(k,q).

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…