Polynomial endomorphisms over finite fields: experimental results
Abstract
Given a finite field q and n∈ *, one could try to compute all polynomial endomorphisms qn qn up to a certain degree with a specific property. We consider the case n=3. If the degree is low (like 2,3, or 4) and the finite field is small (q≤ 7) then some of the computations are still feasible. In this article we study the following properties of endomorphisms: being a bijection of qn qn, being a polynomial automorphism, being a Mock automorphism, and being a locally finite polynomial automorphism. In the resulting tables, we point out a few interesting objects, and pose some interesting conjectures which surfaced through our computations.
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.