Periodic Points of Polynomials in Finite Fields

• Periodic points of polynomials over finite fields are elements x that satisfy φ^k(x)=x for some k, revealing underlying cycle structures and density patterns.
• Explicit formulas for power maps, Chebyshev polynomials, and additive polynomials leverage group theory and cyclotomic properties to precisely count and bound periodic points.
• Probabilistic models, martingale arguments, and monodromy group methods provide actionable insights into average behaviors and exceptional cases in algebraic dynamics.

A periodic point of a polynomial $\phi$ over a finite field is an element $x$ such that $\phi^k(x) = x$ for some $k \geq 1$, where composition is iterated $k$ times. These points constitute foundational objects in arithmetic dynamics, with their density, distribution, and structural properties conveying rich arithmetic and group-theoretic information. Recent advances provide explicit computations for select polynomial families, effective bounds and average behaviors for generic classes, and group-theoretic interpretations based on monodromy and random mappings.

1. Fundamental Notions and Historical Context

Given a finite field $\mathbb{F}_q$ of $q = p^r$ elements, and a polynomial $\phi \in \mathbb{F}_q[x]$ of degree at least $2$, the study of $\phi$'s dynamics on $x$0 involves classifying points as periodic or strictly preperiodic. The set of periodic points under $x$1 in $x$2 is

$x$3

The relative density of periodic points is defined as

$x$4

Basic structure theory shows that each point in a finite field’s orbit under $x$5 is eventually periodic (i.e., eventually falls into a cycle). Power maps $x$6 and Chebyshev polynomials have long been known to admit explicit periodic-point counts due to their algebraic group origins and cyclotomic structure, serving as canonical examples for both random-like and highly structured dynamical behavior (Manes et al., 2013, Hutz et al., 2017).

2. Counting Periodic Points: Explicit Formulas and Families

2.1. Power Maps and Chebyshev Polynomials

The periodic points of $x$7 can be classified via group-theoretic and valuation techniques. If $x$8 with $x$9, the number of periodic points is $\phi^k(x) = x$0, resulting in limiting proportions in carefully chosen towers:

$\phi^k(x) = x$1

where $\phi^k(x) = x$2, $\phi^k(x) = x$3 (Manes et al., 2013).

Chebyshev polynomials $\phi^k(x) = x$4 satisfy $\phi^k(x) = x$5 and decompose further through the properties of cyclotomic fields and their relation to lifts through quadratic extensions. For odd $\phi^k(x) = x$6, their limiting density is

$\phi^k(x) = x$7

with analogous expressions in the $\phi^k(x) = x$8 case and for composite degrees.

2.2. Additive Polynomials

For additive (i.e., $\phi^k(x) = x$9-linear) polynomials $k \geq 1$0, the count of periodic points in $k \geq 1$1 is explicitly given by

$k \geq 1$2

where $k \geq 1$3 is the degree of the splitting field of $k \geq 1$4, and $k \geq 1$5 is maximal such that $k \geq 1$6 divides $k \geq 1$7. The function $k \geq 1$8 exhibits a $k \geq 1$9-adic step-function form up to finitely many initial irregularities and determines both oscillating and limiting behaviors for periodic-point proportions (Reis, 26 Feb 2025). In “regular” cases,

$k$0

with rational constants $k$1. The proportion $k$2 may not converge, typically oscillating or tending to $k$3 only for special exceptional cases.

2.3. Split Polynomial Maps and Higher Dimensions

In the split map setting $k$4, the total number of periodic points in affine or projective space is multiplicative:

$k$5

This reduction applies especially to powering and Chebyshev coordinates, allowing for explicit periodic-point enumeration in high-dimensional settings (Hutz et al., 2017).

3. Asymptotic and Average Behavior

Explicit calculations for general polynomials are rare. However, probabilistic and average results have been established:

• For random degree-$k$6 polynomials over $k$7, the expected number of points of exact period $k$8 is:

$k$9

The total expected number of periodic points is therefore a truncated sum over $\mathbb{F}_q$0 (Flynn et al., 2011).

• For fixed $\mathbb{F}_q$1 and $\mathbb{F}_q$2, it is conjectured but not yet proved that the expected number behaves asymptotically as $\mathbb{F}_q$3 with $\mathbb{F}_q$4, which matches the behavior for random mappings.
• For quadratic polynomials $\mathbb{F}_q$5, the average proportion of periodic points in $\mathbb{F}_q$6 is less than $\mathbb{F}_q$7 for large $\mathbb{F}_q$8,

$\mathbb{F}_q$9

A uniformity theorem on Galois specializations ensures this decay can be obtained for broad families via Chebotarev-theoretic arguments (Garton, 2021).

4. Non-Exceptional Quadratic Polynomials: Monodromy and Martingales

The periodic-point density for quadratic polynomials with strictly preperiodic critical points and not conjugate to Chebyshev or Lattès maps displays a qualitatively different vanishing phenomenon.

• For $q = p^r$0 an odd square and such a quadratic $q = p^r$1, $q = p^r$2.
• More generally, $q = p^r$3 as long as $q = p^r$4 is non-exceptional.

The proof employs a lift of $q = p^r$5 to a post-critically finite polynomial $q = p^r$6 over $q = p^r$7 and constructs the geometric iterated monodromy group (IMG). At finite levels, the proportion of periodic points is controlled by the proportion of IMG elements fixing some vertex in the preimage tree:

$q = p^r$8

A martingale argument, the “fixed-point process,” shows that the limiting fixed-point proportion of the IMG is zero, forcing $q = p^r$9 to $\phi \in \mathbb{F}_q[x]$0 (Bridy et al., 2021).

5. Algorithmic and Structural Applications

Explicit periodic-point formulas for powering, Chebyshev, and additive polynomials underpin classification algorithms for polynomial dynamics over finite fields. For a split map $\phi \in \mathbb{F}_q[x]$1, the structure of its cycle statistics under varying primes or field extensions enables identification of its decomposition type (random, power, Chebyshev, or mixed). Such algorithms use growth rates, explicit periodic-point counts, and tail-length statistics, as described in (Hutz et al., 2017).

Beyond model families, the interaction of permutation structure, functional graph component counts, and random-mapping analogies raises further long-cycle and "generic" behavior questions (Flynn et al., 2011). These are linked to unresolved heuristics in number theory and algorithms, such as Pollard rho collision frequencies.

6. Open Problems and Research Directions

Major unresolved directions include:

• A precise understanding of exceptional cases (notably Lattès maps) over finite fields and explicit limiting densities therein (Bridy et al., 2021).
• Extension of martingale and monodromy techniques to higher-degree polynomials and general rational maps, especially for towers of function field extensions.
• Improved asymptotic bounds and explicit constants for expected periodic-point densities for general polynomial families.
• Analysis of constant-field extensions in the case of polynomial reductions from number fields.

A plausible implication is that further advances in Galois-theoretic uniformity, monodromy group classification, and random mapping models will deepen the classification of periodic-point behavior for more general dynamical systems over finite fields.

---

Key References (by arXiv id):

• (Bridy et al., 2021): Iterated monodromy groups and periodic points for rational functions over finite fields (Bridý–Jones–Kelsey–Lodge)
• (Reis, 26 Feb 2025): Periodic points of additive polynomials and step-function law (Reis)
• (Manes et al., 2013): Periodic points in towers for power maps and Chebyshev polynomials (Manes–Thompson)
• (Garton, 2021): Average density bounds for quadratic polynomials (Logan)
• (Hutz et al., 2017): Split polynomial maps, cycle statistics, and classification (Hutz–Patel)
• (Flynn et al., 2011): Functional-graph statistics and average numbers of periodic points (Boston–Jones–Konyagin–Sutherland)