SearcharxivSearch

arXiv subjects

Gregory Kelsey

Publications and source records attributed to Gregory Kelsey.

3 recordsLinked to original sources

Iterated monodromy groups of rational functions and periodic points over finite fields

Let $q$ be a prime power and $ϕ$ a rational function with coefficients in a finite field $\mathbb{F}_q$. For $n \geq 1$, each element of $\mathbb{P}^1(\F_{q^n})$ is either periodic or strictly preperiodic under iteration of $ϕ$. Denote by $a_n$ the proportion of periodic elements. Little is known about how $a_n$ 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: $a_n$ has lim inf $0$ when $q$ is odd and $ϕ$ is quadratic and neither Lattès nor conjugate to a one-parameter family of exceptional maps. We also show that $a_n$ 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 $a_n$ in general is that $\mathbb{P}^1(\F_{q^n})$ 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 $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.

math.NT

Quadratic Thurston maps with few postcritical points

We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on moduli space can be realized by quadratic rational maps with fewer than four postcritical points.

math.DS

Origami, affine maps, and complex dynamics

We investigate the combinatorial and dynamical properties of so-called nearly Euclidean Thurston maps, or NET maps. These maps are perturbations of many-to-one folding maps of an affine two-sphere to itself. The close relationship between NET maps and affine maps makes computation of many invariants tractable. In addition to this, NET maps are quite diverse, exhibiting many different behaviors. We discuss data, findings, and new phenomena.

math.DS