arXiv subjects
Publications and source records attributed to Walter Parry.
A critically finite branched self-cover $f: (S^2, P) \to (S^2, P)$ determines naturally three iterated function systems: one on the pure mapping class group of the sphere marked at $P$, one on the Teichm\"uller space of the sphere marked at $P$, and one on a finite-dimensional real vector space. We show that contraction for any one of these systems implies contraction for the others.
It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical point has finite forward orbit, or equivalently, if every critical point eventually maps into a periodic cycle of $f$. We encode the orbits of the critical points of $f$ with a finite directed graph called a ramification portrait. In this article, we study which graphs arise as ramification portraits. We prove that every abstract polynomial portrait is realized as the ramification portrait of a postcritically finite polynomial, and classify which abstract polynomial portraits can only be realized by unobstructed maps.
We prove that every sufficiently large iterate of a Thurston map which is not doubly covered by a torus endomorphism and which does not have a Levy cycle is isotopic to the subdivision map of a finite subdivision rule. We determine which Thurston maps doubly covered by a torus endomorphism have iterates that are isotopic to subdivision maps of finite subdivision rules. We give conditions under which no iterate of a given Thurston map is isotopic to the subdivision map of a finite subdivision rule.
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at most $C$, the problem of determining whether $F$ is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of $C$ and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality.
This paper studies NET map slope functions. It establishes Lipschitz-type conditions for them. It relates Lipschitz-type conditions to the half-space theorem. It gives bounds on the number of slope function fixed points. It provides examples of rational NET maps with many matings.
An orientation-preserving branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. Inspired by classical, non-dynamical notions such as Hurwitz equivalence of branched covers of surfaces, we develop invariants for such maps. We then apply these notions to the classification and enumeration of NET maps. As an application, we obtain a complete classification of the dynamic critical orbit portraits of NET maps.
A branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. We show that up to equivalence, each NET map admits a normal form in terms of simple affine data. This data can then be used as input for algorithms developed for the computation of fundamental invariants, now systematically tabulated in a large census.
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.