Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-08T08:11:44.250Z Has data issue: false hasContentIssue false

Total disconnectedness of Julia sets of random quadratic polynomials

Published online by Cambridge University Press:  04 March 2021

KRZYSZTOF LECH
Affiliation:
Institute of Mathematics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland (e-mail: K.Lech@mimuw.edu.pl)
ANNA ZDUNIK*
Affiliation:
Institute of Mathematics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland (e-mail: K.Lech@mimuw.edu.pl)

Abstract

For a sequence of complex parameters $(c_n)$ we consider the composition of functions $f_{c_n} (z) = z^2 + c_n$, the non-autonomous version of the classical quadratic dynamical system. The definitions of Julia and Fatou sets are naturally generalized to this setting. We answer a question posed by Brück, Büger and Reitz, whether the Julia set for such a sequence is almost always totally disconnected, if the values $c_n$ are chosen randomly from a large disc. Our proof is easily generalized to answer a lot of other related questions regarding typical connectivity of the random Julia set. In fact we prove the statement for a much larger family of sets than just discs; in particular if one picks $c_n$ randomly from the main cardioid of the Mandelbrot set, then the Julia set is still almost always totally disconnected.

Information

Type
Original Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable