Article contents
PERMUTATION POLYNOMIALS OF DEGREE 8 OVER FINITE FIELDS OF ODD CHARACTERISTIC
Published online by Cambridge University Press: 09 July 2019
Abstract
We give an algorithmic generalisation of Dickson’s method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson’s idea is to formulate from Hermite’s criterion several polynomial equations satisfied by the coefficients of an arbitrary PP of degree
$d$. Previous classifications of PPs of degree at most 6 were essentially deduced from manual analysis of these polynomial equations, but this approach is no longer viable for
$d>6$. Our idea is to calculate some radicals of ideals generated by the polynomials, implemented by a computer algebra system. Our algorithms running in SageMath 8.6 on a personal computer work very fast to determine all PPs of degree 8 over an arbitrary finite field of odd order
$q>8$. Such PPs exist if and only if
$q\in \{11,13,19,23,27,29,31\}$ and are explicitly listed in normalised form.
MSC classification
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 101 , Issue 1 , February 2020 , pp. 40 - 55
- Copyright
- © 2019 Australian Mathematical Publishing Association Inc.
Footnotes
This work was partially supported by the Natural Science Foundation of Guangdong Province (No. 2018A030310080). The author was also sponsored by the National Natural Science Foundation of China (No. 11801579).
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200113083101764-0473:S0004972719000674:S0004972719000674_inline6.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200113083101764-0473:S0004972719000674:S0004972719000674_inline7.gif?pub-status=live)
- 8
- Cited by