Combinatorial rigidity for unicritical polynomials

Simple item page
dc.creatorAvila, Artur
dc.creatorKahn, Jeremy
dc.creatorLyubich, Mikhail
dc.creatorShen, Weixiao
dc.date2005-07-12
dc.date.accessioned2026-07-07T05:21:37Z
dc.date.available2026-07-07T05:21:37Z
dc.descriptionWe prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is locally connected at the corresponding parameter values. It generalizes Yoccoz's Theorem for quadratics to the higher degree case.
dc.descriptionLaTeX, 12 pages
dc.identifierhttps://arxiv.org/abs/math/0507240
dc.identifierhttp://arxiv.org/abs/math/0507240
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75755
dc.subjectDynamical Systems
dc.subject37F45
dc.titleCombinatorial rigidity for unicritical polynomials
dc.typetext

Files

Collections

arXiv