Show simple item record

dc.identifier.urihttp://hdl.handle.net/11401/76376
dc.description.sponsorshipThis work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.en_US
dc.formatMonograph
dc.format.mediumElectronic Resourceen_US
dc.language.isoen_US
dc.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dc.typeDissertation
dcterms.abstractInfinitely renormalizable quadratic polynomials have been heavily studied. In the context of quadratic-like renormalization, one may try to prove the existence of a priori bounds, a definite thickness for the annuli corresponding to the renormalizations. In 1997, M. Lyubich showed that a priori bounds imply local connectivity of the Julia set and combinatorial rigidity for the corresponding quadratic polynomial. In a paper from 2006, J. Kahn showed that infinitely renormalizable quadratic polynomials of bounded primitive type admit a priori bounds. In 2002, H. Inou generalized some of the polynomial-like renormalization theory to polynomials of higher degree with several critical points. In my thesis, I generalize Kahn's theorem to the context of polynomials of higher degree admitting infinitely many primitive renormalizations of bounded type around each of their critical points. These a priori bounds imply local connectivity and rigidity.
dcterms.available2017-09-20T16:50:08Z
dcterms.contributorMartens, Marcoen_US
dcterms.contributorLyubich, Mikhailen_US
dcterms.contributorBishop, Christopheren_US
dcterms.contributorDeMarco, Laura.en_US
dcterms.creatorAdams, Joseph
dcterms.dateAccepted2017-09-20T16:50:08Z
dcterms.dateSubmitted2017-09-20T16:50:08Z
dcterms.descriptionDepartment of Mathematicsen_US
dcterms.extent96 pg.en_US
dcterms.formatMonograph
dcterms.formatApplication/PDFen_US
dcterms.identifierhttp://hdl.handle.net/11401/76376
dcterms.issued2016-12-01
dcterms.languageen_US
dcterms.provenanceMade available in DSpace on 2017-09-20T16:50:08Z (GMT). No. of bitstreams: 1 Adams_grad.sunysb_0771E_12819.pdf: 628158 bytes, checksum: ca8fdebb90ac122e307e7d2091a4a1aa (MD5) Previous issue date: 1en
dcterms.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dcterms.subjectMathematics
dcterms.titleInfinitely primitively renormalizable polynomials with bounded combinatorics
dcterms.typeDissertation


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record