Dynamics of polynomial maps over finite fields
Jos\'e Alves Oliveira, Fabio Enrique Brochero Mart\'inez

TL;DR
This paper investigates the structure of functional graphs generated by polynomial maps over finite fields, providing complete characterizations for certain classes including monomial maps, and deriving properties like connected components and fixed points.
Contribution
It offers a complete description of the functional graphs for specific polynomial maps over finite fields, including monomials, under certain regularity conditions.
Findings
Characterization of the functional graph structure for maps satisfying regularity conditions
Explicit formulas for the number of connected components and fixed points
Complete description of the graphs for monomial maps
Abstract
Let be a finite field with elements and let be a positive integer. In this paper, we study the digraph associated to the map , where We completely determine the associated functional graph of maps that satisfy a certain condition of regularity. In particular, we provide the functional graphs associated to monomial maps. As a consequence of our results, the number of connected components, length of the cycles and number of fixed points of these class of maps are provided.
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
TopicsGraph theory and applications · Advanced Differential Equations and Dynamical Systems · Coding theory and cryptography
