Permutation polynomials: iteration of shift and inversion maps over finite fields

MaRDI QIDQ6328047zbMATH OpenFDO

Authors Anna Chlopecki, Juliano Levier-Gomes, Wayne Peng, Alex Shearer, Adam Towsley

Publication date 28 October 2019

Abstract: We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $operatornamePGL$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group generated by shift and inversion maps is used to study the randomness properties of permutation polynomials.

This page was built for publication: Permutation polynomials: iteration of shift and inversion maps over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6328047)