Subdivision rule constructions on critically preperiodic quadratic matings

zbMATH Open1351.37191arXiv1601.07111MaRDI QIDQ323967FDOQ323967

Publication date: 10 October 2016

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1601.07111

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

finite subdivision rule finite subdivision rules Hubbard trees mating

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)

Cited In (1)

Thurston's algorithm and rational maps from quadratic polynomial matings

Uses Software

Mandel

This page was built for publication: Subdivision rule constructions on critically preperiodic quadratic matings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323967)