To provide some intuition why the filled Julia set is computable even when the Julia set is not, we propose a “toy” example. As a first step, let us denote byW(θ,w) the closed wedge in the unit disc U around direction θ with width w at the base, which penetrates the disc to depth 1/2 (as shown in Figure 6.1(a)).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Avila, X. Buff, and A. Chéritat, Siegel disks with smooth boundaries, Acta Math. 193 (2004), no. 1, 1–30.
L. Ahlfors, Lectures on Quasiconformal Mappings, American Mathematical Society, 2006.
A. Baker, Transcendental Number Theory, Cambridge University Press, 1975.
E. Bishop and D. S. Bridges, Constructive Analysis, Springer-Verlag, Berlin, 1985.
A. Blokh, X. Buff, A. Chéritat, and L. Oversteegen, The solar Julia sets of basic Cre-mer quadratic polynomials, Available from http://picard.ups-tlse.fr/?buff/Preprints/.
I. Binder, M. Braverman, and M. Yampolsky, On computational complexity of Siegel Julia sets, Commun. Math. Phys. 264 (2006), no. 2, 317–334.
——, Filled Julia sets with empty interior are computable, Journ. of FoCM, 7 (2007), 405–416.
——, On computational complexity ofRiemann Mapping, Arkiv for Matematik, 45 (2007), 221–239.
X. Buff and A. Chéritat, Quadratic Siegel disks with smooth boundaries, Tech. Report 242, Univ. Toulouse, 2002.
——, Ensembles de Julia quadratiques de mesure de Lebesgue strictementpositive, Comptes Rendus Math. (2005), no. 341/11, 669–674.
M. Braverman and S. Cook, Computing over the reals: Foundations for scientific computing, Notices of the AMS 53 (2006), no. 3, 318–329.
X. Buff and A. Chéritat, The Brjuno function continuously estimates the size of quadratic Siegel disks, Annals of Math. 164 (2006), no. 1, 265–312.
L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, Springer-Verlag, New York, 1998.
S. Banach and S. Mazur, Sur les fonctions caluclables, Ann. Polon. Math. 16 (1937).
M. Braverman, Computational complexity of Euclidean sets: Hyperbolic Julia sets are poly-time computable, Master's thesis, University of Toronto, 2004.
——, On the complexity of real functions., Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 October 2005, Pittsburgh, PA, USA, 2005, pp. 155–164.
——, Parabolic Julia sets are polynomial time computable, Nonlinearity 19 (2006), no. 6, 1383–1401.
A. D. Brjuno, Analytic forms of differential equations, Trans. Mosc. Math. Soc 25 (1971).
V. Brattka and K. Weihrauch, Computability of subsets of Euclidean space I: Closed and compact subsets, Theoretical Computer Science 219 (1999), 65–93.
M. Braverman and M. Yampolsky, Non-computable Julia sets, Journ. Amer. Math. Soc. 19 (2006), no. 3, 551–578.
A. Chou and K. Ko, Computational complexity of two-dimensional regions, SIAM J. Comput. 24 (1995), 923–947.
S Cook, P versus NPproblem, The Millenium Prize Problems (J Carlson, A Jaffe, and A Wiles, eds.), Clay Math. Inst. and Amer. Math. Soc, 2006, pp. 87–104.
G. David, Solutions de l'équation de Beltrami avec ǁμǁ∞= 1, Ann. Acad. Sci. Fenn. Ser. AI Math. 13 (1988), 25–70.
R. Devaney, Cantor and Sierpinski, Julia and Fatou: Complex topology meets complex dynamics, Notices of the AMS 51 (2004), no. 1, 9–15.
E. de Faria and W. de Melo, Rigidity of critical circle mappings I, J. Eur. Math. Soc. (JEMS) 1 (1999), no. 4, 339–392.
A. Douady and Hubbard J. H., On the dynamics of polynomial-like mappings, Ann. scient. Ec. Norm. Sup., 4e série 18 (1985), 287–343.
A. Douady, Disques de Siegel et anneaux de Herman. Seminaire Bourbaki, Vol. 1986/87, Astérisque 152–153 (1988), no. 4, 151–172.
——, Descriptions of compact sets in c, Topological methods in modern mathematics (Stony Brook, NY, 1991) (1993), 429–465.
——, Does a Julia set depend continuously on the polynomial?, Complex dynamical systems: The mathematics behind the Mandelbrot set and Julia sets (R L De-vaney, ed.), Proc. of Symposia in Applied Math., vol. 49, Amer. Math. Soc, 1994, pp. 91–138.
Y. Fisher, Exploring the Mandelbrot set, The Science of Fractal Images (H Peitgen and D Saupe, eds.), Springer, 1989.
J. Fornæss and N. Sibony, Random iterations of rational functions, Ergodic Theory Dynam. Systems 11 (1991), no. 4, 687–708.
M. Furer, Faster integer multiplication, Proceedings of Thirty-Ninth ACM Symposium on Theory of Computing (STOC 2007), 2007.
V. Gutlianski, O. Martio, T. Sugawa, and Vuorinen M., On the degenerate Beltrami equation, Transactions of the Amer. Math. Soc. 357 (2004), no. 3, 875–900.
A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955), 168–202.
M. Herman, Are there critical points on the boundaries of singular domains?, Com-mun. Math. Phys. 99 (1985), no. 4, 593–612.
——, Conjugaison quasi symetrique des homeomorphismes du cercle a des rotations, and Conjugaison quasi symetrique des diffeomorphismes du cercle a des rotations et applications aux disques singuliers de Siegel, available from http://www.math.kyoto-u.ac.jp/?mitsu/Herman/index.html, 1986.
P. Hertling, Is the Mandelbrot set computable?, Math. Log. Q. 51 (2005), no. 1, 5–18.
H. Inou and M. Shishikura, Renormalization for parabolic fixed points and their perturbations.
K. Ko, Complexity theory of real functions, Birkhauser, Boston, 1991.
——, Polynomial-time computability in analysis, Handbook of Recursive Mathematics, Vol. 2: Recursive Algebra, Analysis and Combinatorics (Yu L et al Ershov, ed.), Studies in Logic and the Foundations of Mathematics, vol. 139, Elseveir, Amsterdam, 1998, pp. 1271–1317.
D. Lacombe, Extension de la notion de fonction recursive aux fonctions d'une ou plusiers variables, C. R. Acad. Sci. Paris 240 (1955), 2473–2480.
O. Lehto, Homeomorphisms with a given dilatation, Proceedings of the Fifteenth Scandinavian Congress (Oslo 1968). Lecture Notes in Mathematics, vol. 118, Springer, Berlin, 1970, pp. 58–73.
——, Remarks on generalized Beltrami equations and conformal mappings, Proceedings of the Romanian-Finnish seminar on Teichmuller spaces and quasiconfor-mal mappings (Bras¸ov, 1969), Publ. House of the Acad. of the Socialist Republic of Romania, Bucharest, 1971, pp. 203–214.
M Lyubich, Dynamics of rational transformations: topological picture, Russian Math. Surveys 41 (1986), no. 4, 43–117.
M. Lyubich, Dynamics of quadratic polynomials, III, Acta Math. 178 (1997), 185– 297.
——, Feigenbaum-Coullet-Tresser Universality and Milnor's Hairiness Conjecture, Annals of Math. 149 (1999), 319–420.
D. Marshall, Numerical conformal mapping software: Zipper, Available from http://www.math.washington.edu/?marshall/zipper.html.
Y Matiyasevich, Hilbert's Tenth Problem, The MIT Press, Cambridge, London, 1993.
S. Mazur, Computable Analysis, vol. 33, Rosprawy Matematyczne, Warsaw, 1963.
J. Milnor, Self-similarity and hairiness in the Mandelbrot set, Computers in Geometry and Topology (M Tangora, ed.), Lect. Notes Pure Appl. Math., vol. 114, Marcel Dekker, 1989, pp. 211–257.
——, Dynamics in one complex variable. Introductory lectures, 3rd ed., Princeton University Press, 2006.
S. Marmi, P. Moussa, and J.-C. Yoccoz, The Brjuno functions and their regularity properties, Commun. Math. Phys. 186 (1997), 265–293.
Cristopher Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990), no. 20, 2354–2357.
C. M. Papadimitriou, Computational complexity, Addison-Wesley, Reading, Massachusetts, 1994.
C. Petersen, Local connectivity of some Julia sets containing a circle with an irrational rotation, Acta Math. 177 (1996), 163–224.
C. Pommerenke, Boundary behaviour of conformal maps, Springer-Verlag, 1992.
E. Post, Finite combinatory processes - Formulation 1, Journal of Symbolic Logic 1 (1936), 103–105.
C. Petersen and S. Zakeri, On the Julia set of a typical quadratic polynomial with a Siegel disk, Ann. of Math. 159 (2004), no. 1, 1–52.
R. Rettinger, A fast algorithm for Julia sets of hyperbolic rational functions., Electr. Notes Theor. Comput. Sci. 120 (2005), 145–157.
R. Rettinger and K. Weihrauch, The computational complexity of some Julia sets., Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9– 11, 2003, San Diego, CA, USA, 2003, pp. 177–185.
S. Rohde and M. Zinsmeister, Variation of the conformal radius, J. Anal. Math. 92 (2004), 105–115.
C. Siegel, Iteration of analytic functions, Ann. of Math. 43 (1942), no. 2, 607–612.
M. Sipser, Introduction to the Theory of Computation, second edition, PWS Publishing Company, Boston, 2005.
D. Sørensen, Describing quadratic Cremer point polynomials by parabolic perturbations, Ergodic Theory Dynam. Systems 18 (1998), no. 3, 739–758.
D. Sullivan, Conformal dynamical systems, Geometric Dynamics (Palis, ed.), Lecture Notes Math., vol. 1007, Springer-Verlag, 1983, pp. 725–752.
W Thurston, On the combinatorics and dynamics of iterated rational maps, Preprint.
A. M. Turing, On computable numbers, with an application to the Entscheidungsprob-lem, Proceedings, London Mathematical Society (1936), 230–265.
K. Weihrauch, Computable Analysis, Springer-Verlag, Berlin, 2000.
H. Weyl, Randbemerkungen zu Hauptproblemen der Mathematik, II, Fundamentalsatz der Algebra and Grundlagen der Mathematik, Math. Z. 20 (1924), 131–151.
M. Yampolsky, Complex bounds for renormalization of critical circle maps, Erg. Th. & Dyn. Systems 19 (1999), 227–257.
M Yampolsky, Hyperbolicity of renormalization of critical circle maps, Publ. Math. Inst. Hautes Études Sci. 96 (2002), 1–41.
M. Yampolsky, Siegel disks and renormalization fixed points. “Holomorphic Dynamics and Renormalization: A Volume in Honour of John Milnor's 75th Birthday”. Fields Institute Communications, 53 (2008)
J.-C. Yoccoz, Petits diviseurs en dimension 1, S.M.F., Astérisque 231 (1995).
M. Yampolsky and S. Zakeri, Mating Siegel quadratic polynomials, J. Amer. Math. Soc. 14 (2001), no. 1, 25–78.
N. Zhong, Recursively enumerable subsets of ℝ q in two computing models: Blum-Shub-Smale machine and Turing machine, Theor. Comp. Sci. 197 (1998), 79–94.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Computability versus Topological Properties of Julia Sets. In: Computability of Julia Sets. Algorithms and Computation in Mathematics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68547-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-68547-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68546-3
Online ISBN: 978-3-540-68547-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)