Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-26T16:30:21.992Z Has data issue: false hasContentIssue false

A note on polynomials with minimal value set over finite fields

Published online by Cambridge University Press:  26 February 2010

Javier Gomez-Calderon
Affiliation:
Department of Mathematics, New Kensington Campus, The Pennsylvania State University, 3550 Seventh Street Road, New Kensington, PA 15068, U.S.A.
Get access

Abstract

Let f(x) be a polynomial of degree d over Fq, the finite field with q = pn elements. Let V(f) denote the number of distinct values of f(x), xєFq. Then, it is easy to see that

where [x] denotes the greatest integer ≤x. A polynomial for which equality is achieved in (1) is called a minimal value set polynomial. Minimal value set polynomials have been studied in [1] and [3].

Type
Research Article
Copyright
Copyright © University College London 1988

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.Carlitz, L., Lewis, D. J., Mills, W. H. and Straus, E. G.. Polynomials over finite fields with minimal value set. Mathematika, 8 (1961), 121130.CrossRefGoogle Scholar
2.Gomez-Calderon, J. and Madden, D. J.. Polynomials with small value sets over finite fields. J. Number theory, 28 (1988), 167188.CrossRefGoogle Scholar
3.Mills, W. H.. Polynomials with minimal value sets. Pacific J. of Math., 14 (1964), 225241.CrossRefGoogle Scholar