Abstract
dc:description.abstractLaminations are a combinatorial and topological model for studying the Julia sets of complex polynomials. Every complex polynomial of degree d has d fixed points counted with multiplicity. From the point of view of laminations, exactly d−1 of these fixed points are peripheral (approachable from outside the Julia set of the polynomial). Hence, at least one of the d fixed points is “hidden” from the laminational point of view. The purpose of this thesis is to identify, classify and count the possible fixed point portraits for any lamination of degree d. We will identify the “simplest” lamination for a given fixed point portrait and will show that there are polynomials that have these simplest laminations. We extend σd to D as a branched covering map. In future work with others, we want to apply Thurston’s criterion to show there exists a complex polynomial whose lamination this is.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Aziz, Md. Abdul
- Contributors dc:contributor
-
- John C Mayer
- Nikita Selinger
- Mahmut Unan
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.library.uab.edu/etd-collection/93