加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本