Total disconnectedness of Julia sets of random quadratic polynomials

From MaRDI portal
Publication:5082467

DOI10.1017/ETDS.2020.148zbMATH Open1501.37045arXiv2004.06955OpenAlexW3135283795WikidataQ114119264 ScholiaQ114119264MaRDI QIDQ5082467FDOQ5082467

Krzysztof Lech, Anna Zdunik

Publication date: 16 June 2022

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Abstract: For a sequence of complex parameters cn we consider the compositions of functions fcn(z)=z2+cn, which is 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"uck, B"uger and Reitz, whether the Julia set for such a sequence is almost always totally disconnected, if the values cn are chosen randomly from a large disk. 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 disks, in particular if one picks cn randomly from the main cardioid of the Mandelbrot set, then the Julia set is still almost always totally disconnected.


Full work available at URL: https://arxiv.org/abs/2004.06955





Cites Work


Cited In (5)






This page was built for publication: Total disconnectedness of Julia sets of random quadratic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082467)