Permutation polynomials: iteration of shift and inversion maps over finite fields
Abstract
We show that all permutations in Sn can be generated by affine unicritical polynomials. We use the PGL 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.