DOCSLIB.ORG

Conjectures About Simple Dynamics for Some Real Newton Maps on R2

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Conjectures About Simple Dynamics for Some Real Newton Maps on R2 Fractals, Vol. 27, No. 6 (2019) 1950099 (22 pages) c World Scientific Publishing Company DOI: 10.1142/S0218348X19500993 CONJECTURES ABOUT SIMPLE DYNAMICS FOR SOME REAL NEWTON MAPS ON R2 ROBERTO DE LEO Howard University, Washington DC 20059, USA Received December 1, 2018 Accepted May 28, 2019 Published October 11, 2019 In memory of my father Giovanni (1942–2019), that in the good old days encouraged me to learn Basic on our Commodore 64. Abstract We collect from several sources some of the most important results on the forward and back- Fractals 2019.27. Downloaded from www.worldscientific.com ward limits of points under real and complex rational functions, and in particular real and complex Newton maps, in one variable and we provide numerical evidence that the dynamics 2 2 of Newton maps Nf associated to real polynomial maps f : R → R with no complex roots has a complexity comparable with that of complex Newton maps in one variable. In particular such a map Nf has no wandering domain, almost every point under Nf is asymptotic to a fixed point and there is some non-empty open set of points whose α-limit equals the set of non-regular points of the Julia set of Nf . The first two points were proved by B. Barna in the real one-dimensional case. by UNIVERSITY OF TORONTO on 01/03/20. Re-use and distribution is strictly not permitted, except for Open Access articles. Keywords: Newton’s Method; Barna’s Theorem; Discrete Dynamical Systems; Attractors; Repellors; Iterated Function Systems. 1. INTRODUCTION of the points of M under f. Among the simplest One of the most natural ways to understand the things that can happen is that there is some finite behavior of a continuous surjective map f of a number of attracting fixed points ci such that the compact manifold M into itself is studying the sequence of iterates {f n(x)} converges to one of asymptotics of the forward and backward orbits them for almost all x ∈ M (with respect to any 1950099-1 R. De Leo measure equivalent to the Lebesgue measure on providing numerical evidence that Newton’s maps each chart) and that, again for some full mea- on the real plane relative to generic polynomials sure set, the sets f −n(x) converge, in some suitable with only real roots are (weakly) plain. sense, to the set of points whose forward iterates do not converge to any ci. In other words, the action of f on M is, asymptotically, to thicken points 2. PRELIMINARIES near the ci while, at the same time, thinning them The following concepts are central for this paper. out near the boundaries of the basins of attrac- tion of the ci. We call functions with such behavior Definition 1. Let (M,µ) be a compact manifold plain. with a measure µ belonging to the Lebesgue mea- While the large diversity and complexity of sure class, namely a measure equivalent to the behaviors of continuous maps of a manifold M into Lebesgue measure on any chart, and let f be a itself suggests that in the general case the situation surjective continuous map of M into itself. The is much more complicated, it was a surprising dis- ω-limit of a point x ∈ M under f is the (closed) covery that the same is true even in case of very ele- set of the accumulation points of its forward orbit mentary maps such as quadratic polynomials in one {x,f(x),f(f(x)),...},namely variable (e.g. the logistic map) or piecewise linear m polynomials in one variable (e.g. the tent map) — ωf (x)= {f (x)}, see Refs. 1–4 and the references therein for a large n≥0 m≥n panorama of the old and recent advances in this while its α-limit is the (closed) set of the accumula- field. tion points of the sequence of preimages of x under Since being plain does not seem frequent among f,namely continuous functions, it is particularly important singling out properties that identify families of func- −m αf (x)= {f (x)}. tions that behave so nicely under iteration. A large n≥0 m≥n source of them is given by the rational maps com- ing from complex Newton’s method. Consider, for The ω-andα-limits of a set are defined similarly. instance, the case of the complex polynomial f(z)= The forward (respectively, backward) basin Ff (C) 3 1 1 z −1, whose Newton map Nf : CP → CP is given (respectively, Bf (C)) under f of a closed invariant 2z3+1 subset C ⊂ M is the set of all x ∈ M such that by Nf (z)= 3z2 .ItiswellknownthatNf has exactly three attractors, the cubic roots of the unity, ωf (x) ⊂ C (respectively, αf (x) ⊂ C). Following Milnor,10 we say that a closed subset C ⊂ M is an and one repellor, namely the Julia set of Nf (see attractor (respectively, repellor)forf if: Fig. 1, top), which means that Nf is plain. Note Fractals 2019.27. Downloaded from www.worldscientific.com that the situation can get more complicated even (1) Ff (C) (respectively, Bf (C)) has strictly posi- with different polynomials of same degree: as it was tive measure; 5 shown first numerically by Sullivan et al., in the (2) there is no closed subset C′ ⊂ C such that space of all complex cubic polynomials there is a Ff (C) (respectively, Bf (C)) coincides with set of non-zero Lebesgue measure for which there ′ ′ Ff (C ) (respectively, Bf (C )) up to a null set. exist attracting k-cycles, k ≥ 2, and, for each of these polynomials, the basin of attraction of such Finally, we say that f is plain if it has a finite num- attracting cycle has measure larger than zero (see ber of attracting fixed points ci, i =1,...,N,so by UNIVERSITY OF TORONTO on 01/03/20. Re-use and distribution is strictly not permitted, except for Open Access articles. Fig. 2, top). that: While the dynamics of Newton maps on the com- N plex line has been deeply and thoroughly studied (i) i=1 Ff (ci)=M\J is a full measure set; over the last 40 years, especially in connection with (ii) the set of x ∈ M such that αf (x)=J is a full the general problem of the dynamics of complex measure set. rational maps in one variable initiated exactly 100 If (ii) holds at least for a set of positive measure, 6 7–9 years ago by Julia and Fatou, in comparison then we say that f is weakly plain. almost nothing has been done in the more gen- eral case of Newton maps on the real plane. The Remark 1. Conditions (i) and (ii) imply that a main aim of this paper is to attract the attention of plain map cannot have any other attractor/repellor the dynamical systems community to this topic by besides the ci and J. 1950099-2 Conjectures About Simple Dynamics for Some Real Newton Maps on R2 Remark 2. While ω-limits of discrete systems have Theorem 1 (Refs. 6 and 7). Let f : CP1 → CP1 been thoroughly studied, at least in one (real and be a rational map of degree larger than 1.Then: complex) dimension, relatively very little has been done to date for α-limits (see Ref. 11 for a discussion (1) Ff contains all basins of attractions of f; on this topic). (2) Both Jf and Ff are forward and backward invariant and Jf is the smallest closed set with Throughout this paper we will endow all mani- more than two points with such property; folds M,asabove,withameasureµ belonging to (3) Jf is a perfect set; the Lebesgue measure class. Notice that all mea- (4) Jf has interior points if and only if Ff = ∅; sures within the Lebesgue measure class of M have (5) Jf = Jf n for all n ∈ N; the very same null sets so that, since all our state- (6) Jf is the closure of all repelling cycles of f; ments relative to measures of sets are about whether (7) ωf (z)=Jf for a generic point z ∈ Jf ; some set or its complement have zero or positive (8) αf (z)=Jf for every point z ∈ Jf ; measure, our results do not depend on the particu- (9) ∂Ff (γ)=Jf for every attracting periodic lar measure used within this class. By a slight abuse orbit γ; of notation, we will refer to such a measure as the (10) The dynamics of the restriction of f to its Julia Lebesgue measure on M. The Hausdorff measures set is highly sensitive to the initial conditions, induced on the spheres Sn by their round metric, namely f|Jf is chaotic. namely the angular distance between points, are an 1 example of such measures. Remark 3. The possibility that Jf = CP in point Finite attractors and repellors play a major role (4) above does take place. Two well-known exam- in this theory. ples of functions with empty Fatou set are the 2 2 12 (z +1) Latt`es example p(z)= 2 , related to the the- Definition 2. A periodic orbit (or k-cycle) γ is a 4z(z −1) non-empty finite set of k points minimally invariant ory of Elliptic functions (see Ref. 13), and q(z)= (z−2)2 under f, namely that cannot be decomposed into z2 (see Ref. 13 and Corollary 6.2.4 in Ref. 14). 1 the disjoint union of smaller invariant sets. A 1-cycle In general, Ff = ∅ if and only if ωf (z)=CP for is also called a fixed point.
Load more

Recommended publications
  • WHAT IS a CHAOTIC ATTRACTOR? 1. Introduction J. Yorke Coined the Word 'Chaos' As Applied to Deterministic Systems. R. Devane
    WHAT IS A CHAOTIC ATTRACTOR? CLARK ROBINSON Abstract. Devaney gave a mathematical definition of the term chaos, which had earlier been introduced by Yorke. We discuss issues involved in choosing the properties that characterize chaos. We also discuss how this term can be combined with the definition of an attractor. 1. Introduction J. Yorke coined the word `chaos' as applied to deterministic systems. R. Devaney gave the first mathematical definition for a map to be chaotic on the whole space where a map is defined. Since that time, there have been several different definitions of chaos which emphasize different aspects of the map. Some of these are more computable and others are more mathematical. See [9] a comparison of many of these definitions. There is probably no one best or correct definition of chaos. In this paper, we discuss what we feel is one of better mathematical definition. (It may not be as computable as some of the other definitions, e.g., the one by Alligood, Sauer, and Yorke.) Our definition is very similar to the one given by Martelli in [8] and [9]. We also combine the concepts of chaos and attractors and discuss chaotic attractors. 2. Basic definitions We start by giving the basic definitions needed to define a chaotic attractor. We give the definitions for a diffeomorphism (or map), but those for a system of differential equations are similar. The orbit of a point x∗ by F is the set O(x∗; F) = f Fi(x∗) : i 2 Z g. An invariant set for a diffeomorphism F is an set A in the domain such that F(A) = A.
    [Show full text]
  • Attractors of Dynamical Systems in Locally Compact Spaces
    Open Math. 2019; 17:465–471 Open Mathematics Research Article Gang Li* and Yuxia Gao Attractors of dynamical systems in locally compact spaces https://doi.org/10.1515/math-2019-0037 Received February 7, 2019; accepted March 4, 2019 Abstract: In this article the properties of attractors of dynamical systems in locally compact metric space are discussed. Existing conditions of attractors and related results are obtained by the near isolating block which we present. Keywords: Flow, attraction neighborhood, near isolating block MSC: 34C35 54H20 1 Introduction The dynamical system theory studies the rules of changes in the state which depends on time. In the investigation of dynamical systems, one of very interesting topics is the study of attractors (see [1 − 4] and the references therein). In [1 − 3], the authors gave some denitions of attractors and also made further investigations about the properties of them. In [5], the limit set of a neighborhood was used in the denition of an attractor, and in [6] Hale and Waterman also emphasized the importance of the limit set of a set in the analysis of the limiting behavior of a dynamical system. In [7 − 9], the authors dened intertwining attractor of dynamical systems in metric space and obtained some existing conditions of intertwining attractor. In [10], the author studied the properties of limit sets of subsets and attractors in a compact metric space. In [11], the author studied a positively bounded dynamical system in the plane, and obtained the conditions of compactness of the set of all bounded solutions. In [12], the uniform attractor was dened as the minimal compact uniformly pullback attracting random set, several existence criteria for uniform attractors were given and the relationship between uniform and co-cycle attractors was carefully studied.
    [Show full text]
  • Control of Chaos: Methods and Applications
    Automation and Remote Control, Vol. 64, No. 5, 2003, pp. 673{713. Translated from Avtomatika i Telemekhanika, No. 5, 2003, pp. 3{45. Original Russian Text Copyright c 2003 by Andrievskii, Fradkov. REVIEWS Control of Chaos: Methods and Applications. I. Methods1 B. R. Andrievskii and A. L. Fradkov Institute of Mechanical Engineering Problems, Russian Academy of Sciences, St. Petersburg, Russia Received October 15, 2002 Abstract|The problems and methods of control of chaos, which in the last decade was the subject of intensive studies, were reviewed. The three historically earliest and most actively developing directions of research such as the open-loop control based on periodic system ex- citation, the method of Poincar´e map linearization (OGY method), and the method of time- delayed feedback (Pyragas method) were discussed in detail. The basic results obtained within the framework of the traditional linear, nonlinear, and adaptive control, as well as the neural network systems and fuzzy systems were presented. The open problems concerned mostly with support of the methods were formulated. The second part of the review will be devoted to the most interesting applications. 1. INTRODUCTION The term control of chaos is used mostly to denote the area of studies lying at the interfaces between the control theory and the theory of dynamic systems studying the methods of control of deterministic systems with nonregular, chaotic behavior. In the ancient mythology and philosophy, the word \χαωσ" (chaos) meant the disordered state of unformed matter supposed to have existed before the ordered universe. The combination \control of chaos" assumes a paradoxical sense arousing additional interest in the subject.
    [Show full text]
  • ONE HUNDRED YEARS of COMPLEX DYNAMICS the Subject of Complex Dynamics, That Is, the Behaviour of Orbits of Holomorphic Functions
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of Liverpool Repository ONE HUNDRED YEARS OF COMPLEX DYNAMICS MARY REES The subject of Complex Dynamics, that is, the behaviour of orbits of holomorphic functions, emerged in the papers produced, independently, by Fatou and Julia, almost 100 years ago. Although the subject of Dynami- cal Systems did not then have a name, the dynamical properties found for holomorphic systems, even in these early researches, were so striking, so unusually comprehensive, and yet so varied, that these systems still attract widespread fascination, 100 years later. The first distinctive feature of iter- ation of a single holomorphic map f is the partition of either the complex plane or the Riemann sphere into two sets which are totally invariant under f: the Julia set | closed, nonempty, perfect, with dynamics which might loosely be called chaotic | and its complement | open, possibly empty, but, if non-empty, then with dynamics which were completely classified by the two pioneering researchers, modulo a few simply stated open questions. Before the subject re-emerged into prominence in the 1980's, the Julia set was alternately called the Fatou set, but Paul Blanchard introduced the idea of calling its complement the Fatou set, and this was immediately universally accepted. Probably the main reason for the remarkable rise in interest in complex dynamics, about thirty-five years ago, was the parallel with the subject of Kleinian groups, and hence with the whole subject of hyperbolic geome- try. A Kleinian group acting on the Riemann sphere is a dynamical system, with the sphere splitting into two disjoint invariant subsets, with the limit set and its complement, the domain of discontinuity, having exactly similar properties to the Julia and Fatou sets.
    [Show full text]
  • Forward Omega Limit Sets of Nonautonomous Dynamical Systems
    DISCRETE AND CONTINUOUS doi:10.3934/dcdss.2020065 DYNAMICAL SYSTEMS SERIES S Volume 13, Number 4, April 2020 pp. 1103{1114 FORWARD OMEGA LIMIT SETS OF NONAUTONOMOUS DYNAMICAL SYSTEMS Hongyong Cui, Peter E. Kloeden and Meihua Yang School of Mathematics and Statistics, and Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan 430074, China Dedicated to J¨urgen Scheurle on his 65th birthday. Abstract. The forward !-limit set !B of a nonautonomous dynamical system ' with a positively invariant absorbing family B = fB(t); t 2 Rg of closed and bounded subsets of a Banach space X which is asymptotically compact is shown to be asymptotically positive invariant in general and asymptotic negative invariant if ' is also strongly asymptotically compact and eventually continuous in its initial value uniformly on bounded time sets independently of the initial time. In addition, a necessary and sufficient condition for a '- invariant family A = fA(t); t 2 Rg in B of nonempty compact subsets of X to be a forward attractor is generalised to this context. 1. Introduction. Omega limit sets play a fundamental role in characterising the behaviour of dynamical systems. Indeed, the attractor of an autonomous dynamical system is an omega limit set. In such systems the omega limit sets are invariant. The situation is more complicated in nonautonomous dynamical systems because the behaviour now depends on the actual time and not on the the time that has elapsed since starting. This leads to new concepts of nonautonomous attractors that consist of families of compact subsets.
    [Show full text]
  • Toward a Theory of Chaos
    December 3, 2003 12:13 00851 Tutorials and Reviews International Journal of Bifurcation and Chaos, Vol. 13, No. 11 (2003) 3147{3233 c World Scientific Publishing Company TOWARD A THEORY OF CHAOS A. SENGUPTA Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Kanpur 208016, India [email protected] Received February 23, 2001; Revised September 19, 2002 This paper formulates a new approach to the study of chaos in discrete dynamical systems based on the notions of inverse ill-posed problems, set-valued mappings, generalized and multi- valued inverses, graphical convergence of a net of functions in an extended multifunction space [Sengupta & Ray, 2000], and the topological theory of convergence. Order, chaos and complexity are described as distinct components of this unified mathematical structure that can be viewed as an application of the theory of convergence in topological spaces to increasingly nonlinear mappings, with the boundary between order and complexity in the topology of graphical con- vergence being the region in (Multi(X)) that is susceptible to chaos. The paper uses results from the discretized spectral approximation in neutron transport theory [Sengupta, 1988, 1995] and concludes that the numerically exact results obtained by this approximation of the Case singular eigenfunction solution is due to the graphical convergence of the Poisson and conjugate Poisson kernels to the Dirac delta and the principal value multifunctions respectively. In (Multi(X)), the continuous spectrum is shown to reduce to a point spectrum, and we introduce a notion of latent chaotic states to interpret superposition over generalized eigenfunctions. Along with these latent states, spectral theory of nonlinear operators is used to conclude that nature supports complexity to attain efficiently a multiplicity of states that otherwise would remain unavailable to it.
    [Show full text]
  • A Poincaré-Bendixson Theorem for Hybrid Systems
    A POINCARE-BENDIXSON´ THEOREM FOR HYBRID SYSTEMS WILLIAM CLARK, ANTHONY BLOCH, LEONARDO COLOMBO Abstract. The Poincar´e-Bendixsontheorem plays an important role in the study of the qualitative be- havior of dynamical systems on the plane; it describes the structure of limit sets in such systems. We prove a version of the Poincar´e-BendixsonTheorem for two dimensional hybrid dynamical systems and describe a method for computing the derivative of the Poincar´ereturn map, a useful object for the stability analysis of hybrid systems. We also prove a Poincar´e-BendixsonTheorem for a class of one dimensional hybrid dynamical systems. 1. Introduction H. Poincar´econsidered the problem of characterizing the structure of limit sets of trajectories of analytic vector fields on the plane in 1886 [17]. I. Bendixson improved the solution proposed by Poincar´ein 1903 by solving the problem under the weaker hypothesis of C1 vector fields [2]. Since then, the investigation of the asymptotic behavior of dynamical systems has been essential to understanding their behavior. The theory of Poincar´e-Bendixsonstudies so-called limit sets. The classic version of the Poincar´e-BendixsonTheorem states that if a trajectory is bounded and its limit set does not contain any fixed points, then the limt set is a periodic orbit [16]. Therefore, the problem of determining the existence of limit cycles in planar continuous dynamics is well understood. Hybrid systems [6] are non-smooth dynamical systems which exhibit a combination of smooth and discrete dynamics, where the flow evolves continuously on a state space, and a discrete transition occurs when the flow intersects a co-dimension one hypersurface.
    [Show full text]
  • Some Applications of the Poincaré-Bendixson Theorem Robert Roussarie
    Some Applications of the Poincaré-Bendixson Theorem Robert Roussarie To cite this version: Robert Roussarie. Some Applications of the Poincaré-Bendixson Theorem. 2021. hal-03107562v2 HAL Id: hal-03107562 https://hal.archives-ouvertes.fr/hal-03107562v2 Preprint submitted on 19 Jan 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. SOME APPLICATIONS OF THE POINCARE-BENDIXSON´ THEOREM ROBERT ROUSSARIE Abstract. We consider a C1 vector field X defined on an open subset U of the plane, with compact closure. If X has no singular points and if U is simply connected, a weak version of the Poincar´e-BendixsonTheorem says that the limit sets of X in U are empty but that one can defined non empty extended limit sets contained into the boundary of U. We give an elementary proof of this result, independent of the classical Poincar´e-BendixsonTheorem. A trapping triangle T based at p, for a C1 vector field X defined on an open subset U of the plane, is a topological triangle with a corner at a point p located on the boundary @U and a good control of the tranversality of X along the sides.
    [Show full text]
  • Limit Sets of Foliations Annales De L’Institut Fourier, Tome 15, No 2 (1965), P
    ANNALES DE L’INSTITUT FOURIER RICHARD SACKSTEDER ART J. SCHWARTZ Limit sets of foliations Annales de l’institut Fourier, tome 15, no 2 (1965), p. 201-213 <http://www.numdam.org/item?id=AIF_1965__15_2_201_0> © Annales de l’institut Fourier, 1965, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions gé- nérales d’utilisation (http://www.numdam.org/conditions). Toute utilisa- tion commerciale ou impression systématique est constitutive d’une in- fraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Ann. Inst. Fourier, Grenoble 15, 2 (1965), 201-214. LIMIT SETS OF FOLIATIONS by Richard SACKSTEDER and Arthur J. SCHWARTZ 1. Introduction. Let V be an M-manifold with a foliated structure of co- dimension one. A leaf of the foliation is called proper if its topology as an (n—l)-manifold agrees with its topology as a subset of V. One type of theorem which is proved here asserts that proper leaves behave much like compact leaves with respect to certain stability properties. For example, Theorem 1 can be viewed as an extension of a theorem of Reeb on the behavior of leaves in a neighborhood of compact leaf to non-compact, proper leaves. Other theorems show that leaves whose holonomy is finite in a certain sense have properties like those of non-periodic solutions of differential equations on 2-manifolds.
    [Show full text]
  • On the Julia Set of a Typical Quadratic Polynomial with a Siegel Disk
    Annals of Mathematics, 159 (2004), 1–52 On the Julia set of a typical quadratic polynomial with a Siegel disk By C. L. Petersen and S. Zakeri To the memory of Michael R. Herman (1942–2000) Abstract Let 0 <θ<1 be an irrational number with continued fraction expansion 2πiθ θ =[a1,a2,a3,...], and consider the quadratic polynomial Pθ : z → e z + z2. By performing a trans-quasiconformal surgery on an associated Blaschke product model, we prove that if √ log an = O( n)asn →∞, then the Julia set of Pθ is locally connected and has Lebesgue measure zero. In particular, it follows that for almost every 0 <θ<1, the quadratic Pθ has a Siegel disk whose boundary is a Jordan curve passing through the critical point of Pθ. By standard renormalization theory, these results generalize to the quadratics which have Siegel disks of higher periods. Contents 1. Introduction 2. Preliminaries 3. A Blaschke model 4. Puzzle pieces and a priori area estimates 5. Proofs of Theorems A and B 6. Appendix: A proof of Theorem C References 1. Introduction 2πiθ 2 Consider the quadratic polynomial Pθ : z → e z + z , where 0 <θ<1 is an irrational number. It has an indifferent fixed point at 0 with multiplier 2πiθ − 2πiθ ∞ Pθ(0) = e , and a unique finite critical point located at e /2. Let Aθ( ) be the basin of attraction of infinity, Kθ = C Aθ(∞) be the filled Julia set, 2 C. L. PETERSEN AND S. ZAKERI and Jθ = ∂Kθ be the Julia set of Pθ. The behavior of the sequence of iterates { ◦n} Pθ n≥0 near Jθ is intricate and highly nontrivial.
    [Show full text]
  • Μ-Limit Sets of Cellular Automata from a Computational Complexity
    µ-Limit Sets of Cellular Automata from a Computational Complexity Perspective Laurent Boyer,Martin Delacourt,Victor Poupet,Mathieu Sablik, Guillaume Theyssier Abstract This paper concerns µ-limit sets of cellular automata: sets of configu- rations made of words whose probability to appear does not vanish with time, starting from an initial µ-random configuration. More precisely, we investigate the computational complexity of these sets and of related 0 decision problems. Main results: first, µ-limit sets can have a Σ3-hard language, second, they can contain only α-complex configurations, third, 0 any non-trivial property concerning them is at least Π3-hard. We prove complexity upper bounds, study restrictions of these questions to particu- lar classes of CA, and different types of (non-)convergence of the measure of a word during the evolution. 1 Introduction A cellular automaton (CA) is a complex system defined by a local rule which acts synchronously and uniformly on the configuration space. These simple models have a wide variety of different dynamical behaviors, in particular interesting asymptotic behaviors. In the dynamical systems context, it is natural to study the limit set of a cellular automaton: it is defined as the set of configurations that can appear arbitrarily far in time. This set captures the longterm behavior of the CA and has been widely studied since the end of the 1980s. Given a cellular automaton, arXiv:1309.6730v2 [cs.DM] 22 Jun 2015 it is difficult to determine its limit set. Indeed it is undecidable to know if it contains only one configuration [Kar92] and more generally, any nontrivial property of limit sets is undecidable [Kar94].
    [Show full text]
  • Arxiv:Math/9410221V1
    APPEARED IN BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY Volume 31, Number 2, October 1994, Pages 155-172 FRONTIERS IN COMPLEX DYNAMICS CURTIS T. MCMULLEN 1. Introduction Rational maps on the Riemann sphere occupy a distinguished niche in the general theory of smooth dynamical systems. First, rational maps are complex-analytic, so a broad spectrum of techniques can contribute to their study (quasiconformal mappings, potential theory, algebraic geometry, etc.). The rational maps of a given degree form a finite-dimensional manifold, so exploration of this parameter space is especially tractable. Finally, some of the conjectures once proposed for smooth dynamical systems (and now known to be false) seem to have a definite chance of holding in the arena of rational maps. In this article we survey a small constellation of such conjectures centering around the density of hyperbolic rational maps — those which are dynamically the best behaved. We discuss some of the evidence and logic underlying these conjectures, and sketch recent progress towards their resolution. Our presentation entails only a brief account of the basics of complex dynamics; a more systematic exposition can be found in the survey articles [Dou1], [Bl], and [EL]; the recent books [Bea] and [CG]; and Milnor’s lecture notes [Mil2]. 2. Hyperbolic rational maps A rational map f : C → C is a holomorphic dynamical system on the Riemann sphere C = C ∪ {∞}. Any such map can be written as a quotient b b d b P (z) a0z + ... + ad f(z) = = d Q(z) b0z + ... + bd of two relative prime polynomials P and Q. The degree of f can be defined topo- logically or algebraically; it is the number of preimages of a typical point z, as arXiv:math/9410221v1 [math.DS] 1 Oct 1994 well as the maximum of the degrees of P and Q.
    [Show full text]