Polynomial endomorphisms over finite fields: experimental results
Stefan Maubach, Roel Willems

TL;DR
This paper presents experimental results on polynomial endomorphisms over small finite fields, exploring properties like bijectivity and automorphisms for low degrees in three variables, and discusses interesting objects and conjectures found.
Contribution
It provides the first systematic computational study of polynomial endomorphisms over finite fields in three variables, highlighting properties and conjectures.
Findings
Identification of interesting polynomial endomorphisms
Discovery of potential new automorphisms and mock automorphisms
Formulation of conjectures based on computational data
Abstract
Given a finite field and , one could try to compute all polynomial endomorphisms up to a certain degree with a specific property. We consider the case . If the degree is low (like 2,3, or 4) and the finite field is small () then some of the computations are still feasible. In this article we study the following properties of endomorphisms: being a bijection of , being a polynomial automorphism, being a {\em 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Coding theory and cryptography · Algebraic Geometry and Number Theory
