A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
From MaRDI portal
Publication:2398955
DOI10.2140/involve.2018.11.169zbMath1393.37108arXiv1609.07667MaRDI QIDQ2398955
Derek Garton, Elisa Bellah, Noah Walton, Erin Tannenbaum
Publication date: 21 August 2017
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07667
05C80: Random graphs (graph-theoretic aspects)
37P05: Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps
37P25: Dynamical systems over finite ground fields
Related Items
Iteration entropy, Periodic points of polynomials over finite fields, On Functional Graphs of Quadratic Polynomials, Current trends and open problems in arithmetic dynamics, Dynamically distinguishing polynomials
Cites Work
- Toward a theory of Pollard's rho method
- On the iteration of certain quadratic maps over GF(\(p\)).
- On the cycle structure of repeated exponentiation modulo a prime
- The graph of the square mapping on the prime fields
- Symmetry of iteration graphs
- A monte carlo method for factorization
- Periods of iterated rational functions
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- The Expected Number of Components Under a Random Mapping Function