Graph components and dynamics over finite fields
classification
🧮 math.DS
keywords
averagecomponentsfinitenumberassociatedboundconnecteddegree
read the original abstract
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.