On computational complexity of Siegel Julia sets

DOI10.1007/s00220-006-1546-3zbMath1233.68138arXivmath/0502354WikidataQ122442267 ScholiaQ122442267MaRDI QIDQ984472

Ilia A. Binder, Mark Braverman, Michael Yampolsky

Publication date: 19 July 2010

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

37F50: Small divisors, rotation domains and linearization in holomorphic dynamics

37F10: Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Computable Geometric Complex Analysis and Complex Dynamics, Non-computable Julia sets, Probability, statistics and computation in dynamical systems, Computability of Brolin-Lyubich measure, Almost every real quadratic polynomial has a poly-time computable Julia set, Statistical properties of dynamical systems -- Simulation and abstract computation, Computability of the Julia set. Nonrecurrent critical orbits, Real quadratic Julia sets can have arbitrarily high complexity, Poly-time computability of the Feigenbaum Julia set

Cites Work

• The Brjuno function continuously estimates the size of quadratic Siegel disks
• Filled Julia sets with empty interior are computable
• Self-similarity of Siegel disks and Hausdorff dimension of Julia sets
• The Brjuno functions and their regularity properties
• Variation of the conformal radius
• Iteration of analytic functions
• The computational complexity of some julia sets
• Mating Siegel quadratic polynomials
• Non-computable Julia sets
• Parabolic Julia sets are polynomial time computable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item