Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Iterated monodromy groups of rational functions and periodic points over finite fields (2107.10310v2)

Published 21 Jul 2021 in math.NT and math.DS

Abstract: Let $q$ be a prime power and $\phi$ a rational function with coefficients in a finite field $\mathbb{F}q$. For $n \geq 1$, each element of $\mathbb{P}1(\F{qn})$ is either periodic or strictly preperiodic under iteration of $\phi$. Denote by $a_n$ the proportion of periodic elements. Little is known about how $a_n$ changes as $n$ grows, unless $\phi$ is a power map or Chebyshev polynomial. We give the first results on this question for a wider class of rational functions: $a_n$ has lim inf $0$ when $q$ is odd and $\phi$ is quadratic and neither Latt`es nor conjugate to a one-parameter family of exceptional maps. We also show that $a_n$ has limit $0$ when $\phi$ 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 $a_n$ in general is that $\mathbb{P}1(\F_{qn})$ is a finite set with no ambient geometry. In fact, $\phi$ can be lifted to a PCF rational map on the Riemann sphere, where we show that $a_n$ 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.

Summary

We haven't generated a summary for this paper yet.