Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Hubbard Trees"”.
-
Hubbard trees and their properties.
A Hubbard tree is a set of points at the core of dendritic Julia sets. These trees encapsulate all the information about the larger Julia set, but in a much smaller, easier to understand structure. We discuss the structure of Hubbard trees, in particular, we provide a useful definition of branch …
-
Generalized pseudo-Anosov maps arising from holomorphic dynamics
… construction is related to the dynamics on the Hubbard tree, which is a forward invariant subset of the filled Julia set containing the critical orbit. We define a type of Hubbard trees, which we call crossing-free, and show that these are precisely the Hubbard trees for which one can construct …
-
Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions
… addresses using finite subdivision rules and Hubbard trees as tools to model the dynamic behavior of mated quadratic functions. Several methods of construction of invariant structures on modified degenerate matings are detailed, and examples of parameter-based families of matings for which …
-
Combinatorial Structure of Parameter Spaces of Polynomials
… and form a dynamically simple family whose Hubbard trees are spiral graphs. Secondly, I will discuss a characterization of a family of abstract Hubbard trees by their topology. For any $n \geq 3$, let $\mathcal{M}(n)$ denote the set of parameters $c$ in the Mandelbrot set with Hubbard tree …
-
Indecomposability in inverse limits.
… of arbitrary compacta. Using the theory of Hubbard trees, the trunk of the Julia set of a postcriticallly finite polynomial is introduced. Using this trunk, a characterization of indecomposability is provided for inverse limits of post-critically finite polynomials restricted to their Julia …