Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-16T19:21:17.364Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of permutation polynomials of the form f(x) cx over a finite field

Published online by Cambridge University Press:  20 January 2009

Daqing Wan ,
Gary L. Mullen  and
Peter Jau-Shyong Shiue
Daqing Wan
Affiliation:
Department of Mathematical SciencesUniversity of Nevada, Las Vegas, NV 89154USA e-mail: dwan@nevada.edu
Gary L. Mullen
Affiliation:
Department of MathematicsThe Pennsylvania State UniversityUniversity Park, PA 16802USA e-mail: mullen@math.psu.edu
Peter Jau-Shyong Shiue
Affiliation:
Department of Mathematical SciencesUniversity of Nevada. Las Vegas, NV 89154USA e-mail: shiue@nevada.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let Fq be the finite field of q elements. Let f(x) be a polynomial of degree d over Fq and let r be the least non-negative residue of q-1 modulo d. Under a mild assumption, we show that there are at most r values of c∈Fq, such that f(x) + cx is a permutation polynomial over Fq. This indicates that the number of permutation polynomials of the form f(x) +cx depends on the residue class of q–1 modulo d.

As an application we apply our results to the construction of various maximal sets of mutually orthogonal latin squares. In particular for odd q = pn if τ(n) denotes the number of positive divisors of n, we show how to construct τ(n) nonisomorphic complete sets of orthogonal squares of order q, and hence τ(n) nonisomorphic projective planes of order q. We also provide a construction for translation planes of order q without the use of a right quasifield.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 38 , Issue 1 , February 1995 , pp. 133 - 149
Copyright
Copyright © Edinburgh Mathematical Society 1995

References

REFERENCES

1.Chou, W.-S., Permutation Polynomials and Combinatorial Applications (Ph.D. thesis, Pennsylvania State University, 1990).Google Scholar
2.Chou, W.-S., Set-complete mappings on finite fields, in Finite Fields, Coding Theory, and Advances in Communications and Computing (Proc. of the Las Vegas Conference of the same title, Aug. 1991, edited by Mullen, G. L. and Shiue, P. J.-S., Lecture Notes in Pure and Applied Mathematics, 141, Marcel Dekker, 1993), 33–41.Google Scholar
3.Cohen, S. D., Proof of a conjecture of Chowla and Zassenhaus on permutation polynomials, Canad. Math. Bull. 33 (1990), 230–234.CrossRefGoogle Scholar
4.Cohen, S. D., Mullen, G. L. and Shiue, P. J.-S., The difference between permutation polynomials over finite fields, Proc. Amer. Math. Soc., to appear.Google Scholar
5.Denes, J. and Keedwell, A. D., Latin Squares and their Applications (Academic Press, New York, 1974).Google Scholar
6.Evans, A. B., Orthomorphisms of GF(q)+, Ars. Combin. 27 (1989), 121–132.Google Scholar
7.Evans, A. B., Maximal sets of mutually orthogonal Latin squares, II, European J. Combin. 13 (1992), 345–350.Google Scholar
8.Evans, R. J., J. Greene and H. Niederreiter, Linearized polynomials and permutation polynomials of finite fields, Michigan Math. J. 39 (1992), 405–413.CrossRefGoogle Scholar
9.Evans, A. B. and Mcfarland, R. L., Planes of prime order with translations, Congr. Numer. 44 (1984), 41–46.Google Scholar
10.Fried, M., On a conjecture of Schur, Michigan Math. J. 17 (1970), 41–55.Google Scholar
11.Fried, M. D., Guralnick, R. and Saxl, J., Schur covers and Carlitz's conjecture, Israel J. Math. 82 (1993), 157–225.CrossRefGoogle Scholar
12.Hachenberger, D. and Jungnickel, D., Bruck nets with a transitive direction, Geom. Dedicata 36 (1990), 287–313.Google Scholar
13.Lidl, R. and Niederreiter, H., Finite Fields (Addison-Wesley Publishing Company, 1983) (now distributed by Cambridge University Press).Google Scholar
14.Mullen, G. L., Permutation polynomials over finite fields, in Finite Fields, Coding Theory, and Advances in Communications and Computing (Proc. of the Las Vegas Conference of the same title, Aug. 1991, edited by Mullen, G. L. and Shiue, P. J.-S., Lecture Notes in Pure and Applied Mathematics, 141, Marcel Dekker, 1993, 131–151.Google Scholar
15.Mullen, G. L. and Niederreiter, H., The structure of a group of permutation polynomials, J. Austral. Math. Soc. Ser. A 38 (1985), 164–170.Google Scholar
16.Niederreiter, H., Finite fields and their applications, Contributions to General Algebra 7 (Proc. Vienna Conf., 1990, Teubner, Stuttgart, 1991), 251–264.Google Scholar
17.Niederreiter, H. and Robinson, K. H., Complete mappings of finite fields, J. Austral. Math. Soc. Ser. A 33 (1982), 197–212.CrossRefGoogle Scholar
18.Pott, A., Maximal difference matrices of order q, J. Combin. Designs, to appear.Google Scholar
19.Stothers, W. W., On permutation polynomials whose difference is linear, Glasgow Math. J. 32 (1990) 165–171.CrossRefGoogle Scholar
20.Wan, D., On a problem of Niederreiter and Robinson about finite fields, J. Austral. Math. Soc. Ser. A 41 (1986), 336–338.Google Scholar
21.Wan, D., A generalization of the Carlitz conjecture, in Finite Fields, Coding Theory, and Advances in Communications and Computing (Proc. of the Las Vegas Conference of the same title, Aug. 1991, edited by Mullen, G. L. and Shiue, P. J.-S., Lecture Notes in Pure and Applied Mathematics, 141, Marcel Dekker, 1993), 431–432.Google Scholar
22.Wan, D. and Lidl, R., Permutation polynomials of the form and their group structure, Monatsh. Math. 112 (1991), pp. 149–163.Google Scholar
23.Wan, D., Shiue, P. J.-S. and Chen, C. S., Value sets of polynomials over finite fields, Proc. Amer. Math. Soc. 119 (1993), 711–717.Google Scholar