Vol. 170, No. 2, 2009

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 170: 1   2   3
Vol. 169: 1   2   3
Vol. 168: 1   2   3
Vol. 167: 1   2   3
Vol. 166: 1   2   3
Vol. 165: 1   2   3
Vol. 164: 1   2   3
Vol. 163: 1   2   3
Vol. 162: 1   2   3
Vol. 161: 1   2   3
Vol. 160: 1   2   3
Vol. 159: 1   2   3
Vol. 158: 1   2   3
Vol. 157: 1   2   3
Vol. 1–156 at JSTOR
The Journal
Cover
Editorial Board
Editors' Statements
About the Journal
Submission Guidelines
Subscriptions
How to best view
Test your IP address
Related Links
Contact Us
Coming Soon

Combinatorial rigidity for unicritical polynomials

Artur Avila, Jeremy Kahn, Mikhail Lyubich, and Weixiao Shen

Vol. 170 (2009), No. 2, 783–797
Abstract

We prove that any unicritical polynomial fc : zzd + c which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. This implies that the connectedness locus (the “Multibrot set”) is locally connected at the corresponding parameter values and generalizes Yoccoz’s Theorem for quadratics to the higher degree case.

Mathematical Subject Classification

Primary: 37F45

Milestones

Received: 1 August 2005

Authors
Artur Avila
CNRS UMR 7599
Laboratoire de Probabilités et Modèles
Aléatoires
Université Pierre et Marie Curie
Boîte courrier 188
75252 Paris Cedex 05
France
Jeremy Kahn
Department of Mathematics
Stony Brook University
Stony Brook, NY 11794-3651
United States
Mikhail Lyubich
Department of Mathematics
Stony Brook University
Stony Brook, NY 11794-3651
United States
Department of Mathematics
University of Toronto
Room 6290, 40 St. George Street
Toronto, ON M5S 2E4
Canada
Weixiao Shen
Department of Mathematics
University of Science and Technology of China
Hefei, 230026
China
Department of Mathematics
National University of Singapore
2, Science Drive 2
Singapore 117543