Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Numerical results for Waring's problem in $ {\rm GF}[q,\,x]$

Author: William A. Webb
Journal: Math. Comp. 27 (1973), 193-196
MSC: Primary 12C05
MathSciNet review: 0325581
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Let p be a prime and let K and $ {A_i}$ denote polynomials whose coefficients are elements of the finite field with p elements. Problems concerning the expression of an arbitrary polynomial K as sums of a small number of squares or cubes of polynomials $ {A_i}$ are discussed. In the problems treated the degrees of the $ {A_i}$ are restricted to be as small as possible. In particular, it is shown that at least five cubes are necessary and that three squares seem to suffice in all but one special case.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 12C05

Retrieve articles in all journals with MSC: 12C05

Additional Information

Keywords: Sums of squares, polynomials over finite fields, Waring's problem
Article copyright: © Copyright 1973 American Mathematical Society

American Mathematical Society