Subdivision rule constructions on critically preperiodic quadratic matings

Abstract

Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient space was defined, which can be difficult to visualize. This research addresses using Hubbard trees and finite subdivision rules as tools to examine quadratic matings with preperiodic critical points. In many cases, discrete parameter information on such quadratic pairs can be translated into topological information on the dynamics of their mating. The central theorems in this work provide methods for explicitly constructing subdivision rules that model non-hyperbolic matings. We follow with several examples and connections to the current literature.