Periodic Points of Polynomials over Finite Fields

Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let Pp,r⁡(f) be the proportion of P1⁢(Fpr) that is periodic with respect to f. We show that as r increases, the expected value of Pp,r⁡(f), as f ranges over quadratic polynomials, is less than 22/(log⁡log⁡pr). This result follows from a uniformity theorem on specializations of dynamical systems of rational functions over residually finite Dedekind domains. The specialization theorem generalizes previous work by Juul et al. that holds for rings of integers of number fields. Moreover, under stronger hypotheses, we effectivize this uniformity theorem by using the machinery of heights over general global fields; this version of the theorem generalizes previous work of Juul on polynomial dynamical systems over rings of integers of number fields. From these theorems we derive effective bounds on image sizes and periodic point proportions of families of rational functions over finite fields.Fix an odd prime p. If r is a positive integer and f is a polynomial with coefficients in Fpr, let Pp,r⁡(f) be the proportion of P1⁢(Fpr) that is periodic with respect to f. We show that as r increases, the expected value of Pp,r⁡(f), as f ranges over quadratic polynomials, is less than 22/(log⁡log⁡pr). This result follows from a uniformity theorem on specializations of dynamical systems of rational functions over residually finite Dedekind domains. The specialization theorem generalizes previous work by Juul et al. that holds for rings of integers of number fields. Moreover, under stronger hypotheses, we effectivize this uniformity theorem by using the machinery of heights over general global fields; this version of the theorem generalizes previous work of Juul on polynomial dynamical systems over rings of integers of number fields. From these theorems we derive effective bounds on image sizes and periodic point proportions of families of rational functions over finite fields