Periods of iterated rational functions
From MaRDI portal
Publication:5269118
DOI10.1142/S1793042117500713zbMath1390.11098arXiv1508.04193MaRDI QIDQ5269118
Eric Schmutz, Charles Burnette
Publication date: 15 June 2017
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04193
Asymptotic results on counting functions for algebraic and topological structures (11N45) Polynomials over finite fields (11T06) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)
Related Items (7)
A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields ⋮ Dynamically distinguishing polynomials ⋮ Functional graphs of families of quadratic polynomials ⋮ Unnamed Item ⋮ Iteration entropy ⋮ On the equational graphs over finite fields ⋮ On Functional Graphs of Quadratic Polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Toward a theory of Pollard's rho method
- Variation of periods modulo \(p\) in arithmetic dynamics
- A pentagonal number sieve
- Periods of rational maps modulo primes
- The asymptotic distribution of the order of elements in symmetric semigroups
- On the heuristic of approximating polynomials over finite fields by random mappings
- Period Lengths for Iterated Functions
- The Probability of Relatively Prime Polynomials
- Évaluation asymptotique de l'ordre maximum d'un élément du groupe symétrique
- A monte carlo method for factorization
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Probability Distributions Related to Random Mappings
This page was built for publication: Periods of iterated rational functions