{"id":{"repo_id":"baylor","oai_identifier":"oai:baylor-ir.tdl.org:2104/12467"},"canonical_url":"https://search.dev.ndltd.org/etd/baylor/oai:baylor-ir.tdl.org:2104/12467","repository":{"repo_id":"baylor","name":"Baylor University","base_url":"https://baylor-ir.tdl.org/server/oai/request"},"display":{"title":"Hubbard trees and their properties.","abstract":"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 point and endpoint. Afterwards, we demonstrate the existence of some trees that cannot be Hubbard trees in any meaningful context. Later, we turn our attention to the structure of inverse limits of Hubbard trees, making use of the definition of branch point and endpoint tenured earlier in the work and demonstrate that one Hubbard tree, with minor alterations, can generate infinitely many mutually non-homeomorphic inverse limits.","abstract_html":"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 point and endpoint. Afterwards, we demonstrate the existence of some trees that cannot be Hubbard trees in any meaningful context. Later, we turn our attention to the structure of inverse limits of Hubbard trees, making use of the definition of branch point and endpoint tenured earlier in the work and demonstrate that one Hubbard tree, with minor alterations, can generate infinitely many mutually non-homeomorphic inverse limits.","abstract_has_math":false,"creators":["Hammon, Cordell, 1996-"],"institution":"Baylor University.","degree_name":"Ph.D.","degree_level":"Doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Meddaugh, Jonathan."],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023-05","date_published":"2023-05","updated_at":"2026-07-24T01:08:23Z","subjects":["Julia sets.","Hubbard trees.","Dynamical systems.","Endpoint.","Branch points.","Inverse limits."],"languages":["en"],"rights":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2104/12467","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Meddaugh, Jonathan."]},{"key":"dc:creator","label":"Author","values":["Hammon, Cordell, 1996-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-11-07T14:20:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-11-07T14:20:12Z"]},{"key":"dc:date.issued","label":"Date","values":["2023-05"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Baylor University."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Julia sets.","Hubbard trees.","Dynamical systems.","Endpoint.","Branch points.","Inverse limits."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2104/12467"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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 point and endpoint. Afterwards, we demonstrate the existence of some trees that cannot be Hubbard trees in any meaningful context. Later, we turn our attention to the structure of inverse limits of Hubbard trees, making use of the definition of branch point and endpoint tenured earlier in the work and demonstrate that one Hubbard tree, with minor alterations, can generate infinitely many mutually non-homeomorphic inverse limits."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Hubbard trees and their properties."]}]}],"canonical_facts":{"dc:contributor.advisor":["Meddaugh, Jonathan."],"dc:creator":["Hammon, Cordell, 1996-"],"dc:date.accessioned":["2023-11-07T14:20:12Z"],"dc:date.available":["2023-11-07T14:20:12Z"],"dc:date.issued":["2023-05"],"dc:description.abstract":["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 point and endpoint. Afterwards, we demonstrate the existence of some trees that cannot be Hubbard trees in any meaningful context. Later, we turn our attention to the structure of inverse limits of Hubbard trees, making use of the definition of branch point and endpoint tenured earlier in the work and demonstrate that one Hubbard tree, with minor alterations, can generate infinitely many mutually non-homeomorphic inverse limits."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/2104/12467"],"dc:language.iso":["en"],"dc:rights":["Baylor University works are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission."],"dc:subject":["Julia sets.","Hubbard trees.","Dynamical systems.","Endpoint.","Branch points.","Inverse limits."],"dc:title":["Hubbard trees and their properties."],"dc:type":["Thesis"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["Baylor University."]},"updated_at":"2026-07-24T01:08:23Z"}