Exceptional polynomials over finite fields
The key breakthrough in the attempts to eliminate candidates for the monodromy groups of an indecomposable exceptional polynomial is generally considered to be the work of Fried et al. in 1993. However, they employed the classification of finite simple groups, among other things. The authors of the paper under review remedy this situation by confirming the monodromy group of all polynomials of a certain type, independent of the aforementioned classification. The authors dedicate the paper (``with gratitude and appreciation) to Leonard Carlitz about whom they comment, in text, that ``Carlitz would have been satisfied that his insight into the nature of PP's (permutation polynomials) has had such deep consequences \(\dots\).
- Bivariate factorizations via Galois theory, with application to exceptional polynomials
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- 3-designs from all \(\mathbb Z_{4}\)-Goethals-like codes with block size 7 and 8
- A class of permutation polynomials of \(\mathbb F_{2^m}\) related to Dickson polynomials
- On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity
- Completely characterizing a class of permutation quadrinomials
- scientific article; zbMATH DE number 5003320 (Why is no real title available?)
- A Class of Exceptional Polynomials
- scientific article; zbMATH DE number 800817 (Why is no real title available?)
- Bivariate factorizations connecting Dickson polynomials and Galois theory
This page was built for publication: Exceptional polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897201)
