Low-degree permutation rational functions over finite fields
Abstract
We determine all degree-4 rational functions f(X) in Fq(X) which permute P1(Fq), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing with degree-one rational functions. We also determine all degree-8 rational functions f(X) in Fq(X) which permute P1(Fq) in case q is sufficiently large, and do the same for degree 32 in case either q is odd or f(X) is a nonsquare. Further, for most other positive integers n<4096, for each sufficiently large q we determine all degree-n rational functions f(X) in Fq(X) which permute P1(Fq) but which are not compositions of lower-degree rational functions in Fq(X). Some of these results are proved by using a new Galois-theoretic characterization of additive (linearized) polynomials among all rational functions, which is of independent interest.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.