Almost every real quadratic polynomial has a poly-time computable Julia set

DOI10.1007/S10208-017-9367-7zbMATH Open1441.03032arXiv1702.05768OpenAlexW2624570007WikidataQ121187997 ScholiaQ121187997MaRDI QIDQ1785010FDOQ1785010

Authors: Artem Dudko, Michael Yampolsky 

Publication date: 27 September 2018

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

Abstract: We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.

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

Recommendations

• Real quadratic Julia sets can have arbitrarily high complexity
• Non-computable Julia sets
• Constructing non-computable Julia sets
• Computability of Julia sets
• On computational complexity of Siegel Julia sets
• Computability of Julia sets
• Poly-time computability of the Feigenbaum Julia set
• The computational complexity of some Julia sets
• On computational complexity of Cremer Julia sets
• Parabolic Julia sets are polynomial time computable

zbMATH Keywords

computational complexityJulia setCollet-Eckmann condition

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50)

Cites Work

• Title not available (Why is that?)
• Equivalence and topological invariance of conditions for non-uniform hyperbolicity in the iteration of rational maps
• Lyapunov Characteristic Exponents are Nonnegative
• Title not available (Why is that?)
• On the transfer operator for rational functions on the Riemann sphere
• Non-computable Julia sets
• Statistical properties of unimodal maps: The quadratic family
• Computability of Julia sets
• Filled Julia sets with empty interior are computable
• On computational complexity of Siegel Julia sets
• Title not available (Why is that?)
• The Collet-Eckmann condition for rational functions on the Riemann sphere
• Parabolic Julia sets are polynomial time computable
• Constructing locally connected non-computable Julia sets
• Computability of the Julia set. Nonrecurrent critical orbits
• Poly-time computability of the Feigenbaum Julia set

Cited In (8)

• Computable Geometric Complex Analysis and Complex Dynamics
• Towards understanding the theoretical challenges of numerical modeling of dynamical systems
• Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
• Real quadratic Julia sets can have arbitrarily high complexity
• Poly-time computability of the Feigenbaum Julia set
• The computational complexity of some Julia sets
• The computational complexity of some Julia sets
• On computational complexity of Siegel Julia sets

This page was built for publication: Almost every real quadratic polynomial has a poly-time computable Julia set

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