Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-27T07:54:49.387Z Has data issue: false hasContentIssue false

Polynomials over finite fields with minimal value sets

Published online by Cambridge University Press:  26 February 2010

L. Carlitz
Affiliation:
Duke University
D. J. Lewis
Affiliation:
University of Notre Dame
W. H. Mills
Affiliation:
Yale University
E. G. Straus
Affiliation:
University of California at Los Angeles
Get access

Extract

Let p be a prime and let F be a polynomial in one variable with coefficients in GF(p), the field of p elements. Let d be the degree of F, and let r+1 denote the number of distinct values F(µ) as µ. ranges over GF(p). A generalization of the Waring problem modulo p leads to the question the determination of a lower bound for r.

Type
Research Article
Copyright
Copyright © University College London 1961

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Chowla, S., Mann, H. B., and Straus, E. G., “Some applications of the Cauchy-Davenport theorem”, Norske Vid. Selsk. Forh. Trondheim, 32 (1959), 7480.Google Scholar