Filled Julia sets with empty interior are computable

DOI10.1007/S10208-005-0210-1MaRDI QIDQ941784zbMATH OpenOpenAlexWikidataFDO

Authors Mark Braverman, Michael Yampolsky, Ilia Binder

Publication date 2 September 2008

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

computabilityJulia setsoracle

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We show that if a polynomial filled Julia set has empty interior, then it is computable.

Review text

Roughly speaking, a compact set in \(\mathbb C\) is computable if there exists a computer which can generate its image with arbitrarily precision. More precisely, a compact set is computable if it can be approximated as much as wanted in the Hausdorff metric by the union of finitely many balls with rational center and rational radius. In the paper under review the authors consider the computability of the filled Julia set of a polynomial \(P\). Those are the compact subsets of \(\mathbb C\) such that the orbits under the polynomial \(P\) are bounded. More in detail, an \textsl{oracle} is a machine which provides an approximation of any coefficient of the polynomial \(P\) with an arbitrarily high but finite requested precision. The main result of the paper is that for each \(d\geq 2\) there exists an oracle \(M^\varphi\) representing the coefficients of a polynomial \(P\) of degree \(d\) such that if the filled Julia set \(J_P\) of \(P\) has no interior then \(J_p\) is computable by \(M^\varphi\). Such a result is then extended to rational maps with no Siegel discs nor Herman rings. As an interesting corollary they finally prove that Julia sets of degree \(d\) rational maps with no Siegel discs nor Herman rings and no parabolic orbits depends continuously in the Hausdorff topology in \(\mathbb C\mathbb P^1\) on the parameters.

Recommendations

• Computability of the Julia set. Nonrecurrent critical orbits
• Computability of Julia sets
• Non-computable Julia sets
• Constructing non-computable Julia sets
• The computational complexity of some Julia sets

Cited in

(16)

• Constructing locally connected non-computable Julia sets
• Positive reducibility of the interior of filled Julia sets
• Non computable Mandelbrot-like sets for a one-parameter complex family
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Non-computable impressions of computable external rays of quadratic polynomials
• Statistical properties of dynamical systems -- Simulation and abstract computation
• Computability of the Julia set. Nonrecurrent critical orbits
• Poly-time computability of the Feigenbaum Julia set
• Is the Mandelbrot set computable?
• Computable Geometric Complex Analysis and Complex Dynamics
• Computability of topological pressure on compact shift spaces beyond finite type*
• On computational complexity of Cremer Julia sets
• On the computability of rotation sets and their entropies
• Non-computable Julia sets
• Computability of Brolin-Lyubich measure
• On computational complexity of Siegel Julia sets

This page was built for publication: Filled Julia sets with empty interior are computable

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