The Cycle Structure of Unicritical Polynomials

  title={The Cycle Structure of Unicritical Polynomials},
  author={Andrew Bridy and Derek Garton},
  journal={International Mathematics Research Notices},
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $ {{\mathbb{F}}}_p$. The questions of whether and in what sense these families are random have been studied extensively, spurred in part by Pollard’s famous “rho” algorithm for integer factorization (the heuristic justification of which is the conjectural randomness of one such family). However, the… 
3 Citations

Periodic points of polynomials over finite fields

. Fix an odd prime p . If r is a positive integer and f a polynomial with coef-ficients in F p r , let P p,r ( f ) be the proportion of P 1 ( F p r ) that is periodic with respect to f . We show that

Periodic points and tail lengths of split polynomial maps modulo primes

This work includes a detailed analysis of the structure of the directed graph for Chebyshev polynomials of non-prime degree in dimension 1 and the powering map in any dimension.

Functional graphs of families of quadratic polynomials

We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field. We obtain several results about the number of leaves in such graphs. In particular, in



On certain algebraic curves related to polynomial maps

An algebraic/arithmetical proof of irreducibility over the algebraic closure of Q is given for the polynomial -03A6n, (x, c) whose roots are the periodic points of least period n of the dynamical

Dynamically distinguishing polynomials

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field

A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields

It is proved that for sets of edges in a functional graph, the quality of being a cycle and thequality of being interpolable are "uncorrelated enough" to imply that the average number of components of the functional graphs of polynomials of fixed degree over a finite field is within a bounded constant of Kruskal's bound.


For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX^2+c$, starting at $0$, always recurs after $O(q/\log\log q)$ steps. For $X^2+1$ the same is true for any

Toward A Theory of Pollard's Rho Method

Periods of rational maps modulo primes

Let K be a number field, let $${\varphi \in K(t)}$$ be a rational map of degree at least 2, and let $${\alpha, \beta \in K}$$ . We show that if α is not in the forward orbit of β, then there is a

The Galois Theory of Periodic Points of Polynomial Maps

0. Introduction There is a growing body of evidence that problems associated with iterated maps can yield interesting insights in number theory and algebra. There are the papers of Narkiewicz

Arboreal Galois representations

Let $$G_{\mathbb{Q}}$$ be the absolute Galois group of $$\mathbb{Q}$$, and let T be the complete rooted d-ary tree, where d ≥ 2. In this article, we study “arboreal” representations of

On Functional Graphs of Quadratic Polynomials

This work introduces efficient algorithms for methodical computations and provides the values of various direct and cumulative statistical parameters of interest, particularly on connected functional graphs generated by quadratic polynomials over prime fields.

The Arithmetic of Dynamical Systems

* Provides an entry for graduate students into an active field of research * Each chapter includes exercises, examples, and figures * Will become a standard reference for researchers in the field