English

A reduction formula for Waring numbers through generalized Paley graphs

Number Theory 2022-06-07 v4 Combinatorics

Abstract

We give a reduction formula for the Waring number g(k,q)g(k,q) over a finite field Fq\mathbb{F}_q. By exploiting the relation between g(k,q)g(k,q) with the diameter of the generalized Paley graph Γ(k,q)\Gamma(k,q) and by using the characterization due to Pearce and Praeger (2019) of those Γ(k,q)\Gamma(k,q) which are Cartesian decomposable, we obtain the reduction formula g(pab1bc,pab)=bg(pa1c,pa)g(\tfrac{p^{ab}-1}{bc},p^{ab}) = b g(\tfrac{p^a-1}{c},p^a) for pp prime and a,b,ca,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 22-weight irreducible cyclic codes due to Schmidt and White (2002) to find infinite families of explicit even values of g(k,q)g(k,q).

Keywords

Cite

@article{arxiv.1911.12761,
  title  = {A reduction formula for Waring numbers through generalized Paley graphs},
  author = {Ricardo A. Podestá and Denis E. Videla},
  journal= {arXiv preprint arXiv:1911.12761},
  year   = {2022}
}

Comments

26 pages. Some typos solved and minor corrections made. 5 references added

R2 v1 2026-06-23T12:30:14.363Z