Iterated monodromy groups of rational functions and periodic points over finite fields
Abstract
Let q be a prime power and φ a rational function with coefficients in a finite field Fq. For n ≥ 1, each element of P1(qn) is either periodic or strictly preperiodic under iteration of φ. Denote by an the proportion of periodic elements. Little is known about how an changes as n grows, unless φ is a power map or Chebyshev polynomial. We give the first results on this question for a wider class of rational functions: an has lim inf 0 when q is odd and φ is quadratic and neither Latt\`es nor conjugate to a one-parameter family of exceptional maps. We also show that an has limit 0 when φ is a non-Chebyshev quadratic polynomial with strictly preperiodic finite critical point and q is an odd square. Our methods yield additional results on periodic points for reductions of post-critically finite (PCF) rational functions defined over number fields. The difficulty of understanding an in general is that P1(qn) is a finite set with no ambient geometry. In fact, φ can be lifted to a PCF rational map on the Riemann sphere, where we show that an is given by counting elements of the iterated monodromy group (IMG) that act with fixed points at all levels of the tree of preimages. Using a martingale convergence theorem, we translate the problem to determining whether certain IMG elements exist. This in turn can be decisively addressed using the expansion of PCF rational maps in the orbifold metric.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.