DOCSLIB.ORG

Periodic Points and Iteration in Sequential Dynamical Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Periodic Points and Iteration in Sequential Dynamical Systems Periodic Points and Iteration in Sequential Dynamical Systems Taom Sakal Advised by Padraic Bartlett Senior Thesis CCS Mathematics University of California Santa Barbara May 2016 CONTENTS Introduction............................... 4 1. Predicting Periodic Points in Cycle Graphs ............. 5 1.0.1 WhatisaSimpleCyclicSDS? . 5 1.0.2 The Phase Space . 7 1.1 The Compatibility Graph . 8 1.2 The Transition Graph . 10 1.2.1 Construction and Definitions . 11 1.2.2 Calculating SDS with the Transition Graph: an Algo- rithm . 14 1.3 MainResults ........................... 17 1.3.1 ShiftingStates ...................... 19 1.3.2 Finding other graphs with points of the same period . 20 1.4 FutureDirections. ........................ 23 2. The Iterated Phase Space ....................... 25 2.1 GeneralizedSDS ......................... 25 2.2 The Iterated Phase Space . 25 2.2.1 Definitions for IPS . 28 2.3 Classification of IPS . 29 2.3.1 Behavior of Or and And . 29 2.3.2 Behavior of Parity and Parity+1 . 35 2.3.3 Behavior of Majority and Majority+1 . 36 2.3.4 Behavior of Nor and Nand . 38 2.4 Otherresults ........................... 38 3. Color SDS ................................ 41 3.1 What is a Color SDS? . 41 3.2 Color Distance . 41 3.3 Other Coloring SDSs, Other Color Distances . 43 3.4 Lonely Colorings . 44 Contents 3 Future Directions .............................. 46 Acknowledgments ............................. 47 Bibliography ................................ 48 INTRODUCTION Graph dynamical systems capture a phenomena found in nearly all of sci- ence: emergence. Individuals which follow simple rules can, when viewed collectively, create complex behavior. Graph dynamical systems have mod- eled everything from ants to traffic to economies. In all these models indi- viduals look to their immediate environment and the actions of those around them to decide their next action. The classic mathematical example of such a system is Conway’s Game of Life. Moving creations, pulsing galaxies, and even the complexity of self reproducing organisms can emerge from the game’s simple and mechanical rules [2, Chapter 7.3] [3]. Sequential Dynamical Systems are time and space discrete systems, sim- ilar to the Game of Life. However, they have the added dimension of an vertex-by-vertex update order (compared to the Game of Life’s simultane- ous update order). The order in which a system updates matters, and this is what gives SDS its applications, some examples being traffic simulations, genetic models, queuing theory, and even a mathematically precise founda- tion for computer simulation [4, Chapter 1.3, Chapter 8]. We begin in Chapter 1 by describing results on a special class of SDS called cyclic SDS. We then consider the Iterated Phase Space and more general SDS in Chapter 2. Finally in Chapter 3 we consider Color SDS and some results on 2-cycles. We will assume basic knowledge of graph theory throughout (ie. what a graph is, what vertices and edges are, and the basic types of graphs). 1. PREDICTING PERIODIC POINTS IN CYCLE GRAPHS Often we wish to know when SDS are periodic. Given a starting state, an SDS may update back to this starting state after n updates. A state that does this is called a point of period n. Knowing which points are periodic is important because it tells what inputs cause our systems to loop. Mortveit and Reidys characterized points of period one for a special class of SDS (called Simple Cyclic SDS) on cycle graphs. [4, Chapter 5.1]. In this chapter we generalize their technique to find points of arbitrary period on Cn for such SDS. To do this we first we introduce basic terminology and Simple Cyclic SDS in section 1.0.1. Next we review the compatibility graph, the tool Mortveit and Reidy studied fixed points with. From there we introduce the transition graph as a generalization of the compatibility graph and show how to transform the problem of calculating an SDS into a problem of finding walks on the transition graph. To finish we prove two theorems which allow us to, when given a point of period k on Cn, find points of period k on the graphs Cn and Cn+ank,wherea is a natural number. 1.0.1 What is a Simple Cyclic SDS? A Sequential Dynamical System (SDS) is a discrete dynamical system on a graph, and a formal construction of them can be found in [4, Chapter 4.1]. The results in this paper are limited to Simple Cyclic SDS, a special class of SDS on Cn. We label the vertices of Cn in the natural way: vi is adjacent to vi+1, and vn is adjacent to v1. A Simple Cyclic SDS consists of 1. An undirected cycle graph C with vertices v ,...v with n 3. n { 1 n} ≥ 2. A set of possible vertex states K. (For this paper we let K = F2.) 3. A local vertex function f : K3 K. ! 4. An ordering ⇡ =(σ(v1), σ(v2),...,σ(vn)) of the vertices in Cn,where σ is a permutation in Sn. For this paper, σ will be the identity. 1. Predicting Periodic Points in Cycle Graphs 6 The local vertex function f is defined as f : K3 K ! (xi 1,xi,xi+1) (xi0 ) − 7! Where x K and the subscripts are taken modulo n.Givenavertexv in i0 2 i state xi with neighbors vi 1,vi+1 in states xi 1,xi+1, we can update vi by − − replacing xi with the state given by f(xi 1,xi,xi+1). An update function − is symmetric if it does not care about the order of the x’s in the input (xi 1,xi,xi+1). − These local functions can be composed to give the SDS-map.This map, denoted [fCn , ⇡], applies the local vertex function to each vertex in our graph, in the order specified by ⇡. We call an application of the SDS- map a system update. A system state is an assignment of vertices in our graph to elements of K.Weletthetuple(x ,...x ) Kn denote the system state in which 1 n 2 vertex vi has state xi. A system update changes the system state (x1,...,xn) to a new system state Definition 1. Let F =[fCn , ⇡] be an SDS-map and let X and X0 be system states. If F (X)=X0 we write X X0 7!F and read it as “X updates to X0,” and we say that we have applied a system update. Generally, Cn and ⇡ are assumed to be fixed and we write F in place of [fCn , ⇡]. Example: Consider the SDS on C3, the cycle graph on three vertices. Let the vertex set be v1,v2,v3 and let the vertex state set be F2.Set { } ⇡ =(v1,v2,v3), the identity update order. Define the vertex update function to be Parity(vi 1,vi,vi+1):=(vi 1 + vi + vi+1)mod2. − − Take the system state (1, 0, 0), as shown in Figure 1.1, and apply our local vertex functions in the order given by ⇡. We begin with v1.Itsees that its left neighbor is 0, itself is 1, and the right neighbor is 0. Thus we have fv1 (0, 1, 0) = 0 + 1 + 0 mod 2 = 1. Thus v1 updates to 1. 1. Predicting Periodic Points in Cycle Graphs 7 Do this for v2. It sees the updated v1 to its left, a 0 for itself, and a 0 to its right. Thus it updates to fv2 (1, 0, 0) = 1 + 0 + 0 mod 2 = 1. Finally we do this for v3 and we find it updates to fv3 (1, 0, 1) = 0. The resulting system state is (1, 1, 0). As we have updated all the vertices in the order specified, we have finished an entire system update, and we have that (1, 0, 0) (1, 1, 0). 7!F Fig. 1.1: A single system update using Parity 1.0.2 The Phase Space The phase space of an SDS is a directed graph that represents how an SDS updates. The vertex set of this graph is the collection of all possible system states for our SDS. For an SDS-map F , we draw an edge from one system state X to system state X if X X . 0 7!F 0 Fig. 1.2: The phase space of Parity over C3. The phase space gives us a complete view of an SDS’s behavior. A special structure in the phase space is the periodic point: a system state that returns to itself after a certain number of system updates. For example, the phase space illustrated above contains four points of period four, two points of period two, and two points of period one. A point of period one is called a fixed point. 1. Predicting Periodic Points in Cycle Graphs 8 Observe that finding periodic points in an SDS is equivalent to finding directed cycles in the phase space. 1.1 The Compatibility Graph In this section we review the compatibility graph, first introduced in [4, Chapter 5.1]. The compatibility graph allows us to find all fixed points in a simple cyclic SDS. It does this by “stitching together” local fixed points, which we define below. Definition 2. Let f be a local vertex function. A local fixed point for f is a vertex state (xi 1,xi,xi+1) such that − f(xi 1,xi,xi+1)=xi. − 3 Example: Consider the function Majority : F F2, defined as follows: 2 ! 1ifa + b + c>1, Majority(a, b, c)= (0ifa + b + c 1. The local fixed points for Majority are labeled in the table below. (xi 1,xi,xi+1) Majority(xi 1,xi,xi+1) Fixed Point? − − (0, 0, 0) 0 Yes (0, 0, 1) 0 Yes (0, 1, 0) 0 No (0, 1, 1) 1 Yes (1, 0, 0) 0 Yes (1, 0, 1) 1 No (1, 1, 0) 1 Yes (1, 1, 1) 1 Yes The compatibility graph for a given simple cyclic SDS describes a way to fit local fixed points together into a global fixed point.
Load more

Recommended publications
  • MATH34042: Discrete Time Dynamical Systems David Broomhead (Based on Original Notes by James Montaldi) School of Mathematics, University of Manchester 2008/9
    MATH34042: Discrete Time Dynamical Systems David Broomhead (based on original notes by James Montaldi) School of Mathematics, University of Manchester 2008/9 Webpage: http://www.maths.manchester.ac.uk/∼dsb/Teaching/DynSys email: [email protected] Overview (2 lectures) Dynamical systems continuous/discrete; autonomous/non-autonomous. Iteration, orbit. Applica- tions (population dynamics, Newton’s method). A dynamical system is a map f : S S, and the set S is called the state space. Given an initial point x0 S, the orbit of x0 is the sequence x0,x1,x2,x3,... obtained by repeatedly applying f: ∈ → n x1 = f(x0), x2 = f(x1), x3 = f(x2),...,xn = f (x0), ... Basic question of dynamical systems: given x0, what is behaviour of orbit? Or, what is behaviour of most orbits? + + Example Let f : R R be given by f(x)= √x. Let x0 = 2. Then x1 = f(2)= √2 1.4142. And ≈ x = √2 1.1892 and x = √1.1892 1.0905. 2 p → 3 The orbit of≈2 therefore begins {2.0, 1.4142,≈ 1.1892, 1.0905, ...}. The orbit of 3 begins {3.0, 1.7321, 1.3161, 1.1472, ...}. The orbit of 0.5 begins {0.5, 0.7071, 0.8409, .9170, .9576, ...}. All are getting closer to 1. Regular dynamics fixed points, periodic points and orbits. Example f(x)= cos(x). Globally attracting fixed point at x = 0.739085 . ··· Chaotic dynamics Basic idea is unpredictability. There is no “typical’ behaviour. Example f(x)= 4x(1 − x), x [0,1]: Split the interval into two halves: L = [0, 1 ] and R = [ 1 ,1].
    [Show full text]
  • Efficient Method for Detection of Periodic Orbits in Chaotic Maps And
    Efficient Method for Detection of Periodic Orbits in Chaotic Maps and Flows A Thesis by Jonathan Crofts in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Department of Mathematics University of Leicester March 2007. c Jonathan J Crofts, 2007. arXiv:0706.1940v2 [nlin.CD] 13 Jun 2007 Acknowledgements I would like to thank Ruslan Davidchack, my supervisor, for his many suggestions and constant support and understanding during this research. I am also thankful to Michael Tretyakov for his support and advice. Further, I would like to acknowledge my gratitude to the people from the Department of Mathematics at the University of Leicester for their help and support. Finally, I would like to thank my family and friends for their patience and sup- port throughout the past few years. In particular, I thank my wife Lisa and my daughter Ellen, without whom I would have completed this research far quicker, but somehow, it just would not have been the same. At this point I would also like to reassure Lisa that I will get a real job soon. Leicester, Leicestershire, UK Jonathan J. Crofts 31 March 2007 i Contents Abstract iv List of figures v List of tables vi 1 Introduction 1 1.1 History,theoryandapplications . 1 1.2 Periodicorbits............................... 3 1.2.1 Periodicorbittheory . 4 1.2.2 Efficient detection of UPOs . 6 1.3 Extendedsystems............................. 9 1.4 Anoteonnumerics............................ 10 1.4.1 Intervalarithmetic . 12 1.5 Overview.................................. 14 1.6 Thesisresults ............................... 16 2 Conventional techniques for detecting periodic orbits 18 2.1 Specialcases................................ 18 2.1.1 One-dimensionalmaps .
    [Show full text]
  • Infinitely Renormalizable Quadratic Polynomials 1
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 352, Number 11, Pages 5077{5091 S 0002-9947(00)02514-9 Article electronically published on July 12, 2000 INFINITELY RENORMALIZABLE QUADRATIC POLYNOMIALS YUNPING JIANG Abstract. We prove that the Julia set of a quadratic polynomial which ad- mits an infinite sequence of unbranched, simple renormalizations with complex bounds is locally connected. The method in this study is three-dimensional puzzles. 1. Introduction Let P (z)=z2 + c be a quadratic polynomial where z is a complex variable and c is a complex parameter. The filled-in Julia set K of P is, by definition, the set of points z which remain bounded under iterations of P .TheJulia set J of P is the boundary of K. A central problem in the study of the dynamical system generated by P is to understand the topology of a Julia set J, in particular, the local connectivity for a connected Julia set. A connected set J in the complex plane is said to be locally connected if for every point p in J and every neighborhood U of p there is a neighborhood V ⊆ U such that V \ J is connected. We first give the definition of renormalizability. A quadratic-like map F : U ! V is a holomorphic, proper, degree two branched cover map, whereT U and V are ⊂ 1 −n two domains isomorphic to a disc and U V .ThenKF = n=0 F (U)and JF = @KF are the filled-in Julia set and the Julia set of F , respectively. We only consider those quadratic-like maps whose Julia sets are connected.
    [Show full text]
  • 1D Dynamics: Symbolic Coding
    1D Dynamics: Symbolic Coding 1. Full shift of two symbols – Let X = {s =(s0s1s2 ··· si ··· ); si =0 or 1} be the collection of all sequences of 0 and 1. – For s =(s0s1 ··· si ··· ), t =(t0t1 ··· ti ··· ), let ∞ |s − t | d(s, t) = i i X i i=0 2 Claim: (i) (X,d) is a metric space. s t 1 (ii) d( , ) ≤ 2n iff si = ti for all i < n. Proof: (i) d(s, t) ≥ 0 and d(s, t) = d(t, s) are obvious. For the triangle inequality, observe ∞ ∞ ∞ |si − ti| |si − vi| |vi − ti| d(s, t) = ≤ + X 2i X 2i X 2i i=0 i=0 i=0 = d(s, v)+ d(v, t). (ii) is straight forward from definition. – Let σ : X → X be define by σ(s0s1 ··· si ··· )=(s1s2 ··· si+1 ··· ). Claim: σ : X → X is continuous. Proof: 1 For ε > 0 given let n be such that 2n < ε. Let 1 s t s t δ = 2n+1 . For d( , ) <δ, d(σ( ), σ( )) < ε. – (X,σ) as a dynamical system: Claim (a) σ : X → X have exactly 2n periodic points of period n. (b) Union of all periodic orbits are dense in X. (c) There exists a transitive orbit. Proof: (a) The number of periodic point in X is the same as the number of strings of 0, 1 of length n, which is 2n. (b) ∀s =(s0s1 · · · sn · · · ), let sn =(s0s1 · · · sn; s0s1 · · · sn; · · · ). We have 1 d(sn, s) < . 2n−1 So sn → s as n →∞. (c) List all possible strings of length 1, then of length 2, then of length 3, and so on.
    [Show full text]
  • Multiple Periodic Solutions and Fractal Attractors of Differential Equations with N-Valued Impulses
    mathematics Article Multiple Periodic Solutions and Fractal Attractors of Differential Equations with n-Valued Impulses Jan Andres Department of Mathematical Analysis and Applications of Mathematics, Faculty of Science, Palacký University, 17. listopadu 12, 771 46 Olomouc, Czech Republic; [email protected] Received: 10 September 2020; Accepted: 30 September 2020; Published: 3 October 2020 Abstract: Ordinary differential equations with n-valued impulses are examined via the associated Poincaré translation operators from three perspectives: (i) the lower estimate of the number of periodic solutions on the compact subsets of Euclidean spaces and, in particular, on tori; (ii) weakly locally stable (i.e., non-ejective in the sense of Browder) invariant sets; (iii) fractal attractors determined implicitly by the generating vector fields, jointly with Devaney’s chaos on these attractors of the related shift dynamical systems. For (i), the multiplicity criteria can be effectively expressed in terms of the Nielsen numbers of the impulsive maps. For (ii) and (iii), the invariant sets and attractors can be obtained as the fixed points of topologically conjugated operators to induced impulsive maps in the hyperspaces of the compact subsets of the original basic spaces, endowed with the Hausdorff metric. Five illustrative examples of the main theorems are supplied about multiple periodic solutions (Examples 1–3) and fractal attractors (Examples 4 and 5). Keywords: impulsive differential equations; n-valued maps; Hutchinson-Barnsley operators; multiple periodic solutions; topological fractals; Devaney’s chaos on attractors; Poincaré operators; Nielsen number MSC: 28A20; 34B37; 34C28; Secondary 34C25; 37C25; 58C06 1. Introduction The theory of impulsive differential equations and inclusions has been systematically developed (see e.g., the monographs [1–4], and the references therein), among other things, especially because of many practical applications (see e.g., References [1,4–11]).
    [Show full text]
  • Sharkovsky's Ordering and Chaos Introduction to Fractal Geometry and Chaos
    Sharkovsky's Ordering and Chaos Introduction to Fractal Geometry and Chaos Matilde Marcolli MAT1845HS Winter 2020, University of Toronto M 1-2 and T 10-12 BA6180 Sharkovsky's Ordering and Chaos Introduction to Fractal Geometry and Chaos Matilde Marcolli References for this lecture: K. Burns and B. Hasselblatt, The Sharkovsky theorem: a natural direct proof, Amer. Math. Monthly 118 (2011), no. 3, 229{244 T.Y.Li and A.Yorke, Period three implies chaos, The American Mathematical Monthly, Vol. 82, No. 10. (Dec., 1975) 985{992 O.M. Sharkovsky, Co-existence of cycles of a continuous mapping of the line into itself, Ukrain. Mat. Z. 16 (1964) 61{71 B. Luque, L. Lacasa, F.J. Ballesteros, A. Robledo, Feigenbaum Graphs: A Complex Network Perspective of Chaos, PLoS ONE 6(9): e2241 L. Alsed`a,J. Llibre, M. Misiurewicz, Combinatorial dynamics and entropy in dimension one, World Scientific, 2000 Sharkovsky's Ordering and Chaos Introduction to Fractal Geometry and Chaos Matilde Marcolli Period 3 implies Chaos • T.Y.Li and A.Yorke, Period three implies chaos, The American Mathematical Monthly, Vol. 82, No. 10. (Dec., 1975) 985{992 considered the historical origin of Chaos Theory if a continuous function f : I!I of an interval I ⊂ R has a periodic point of period 3, then it has periodic points of any order n 2 N there is also an uncountable subset of I of points that are not even \asymptotically periodic" this is a typical situation of chaotic dynamics chaos = sensitive dependence on the initial conditions (starting points that are very close have very different behavior under iterates of the function) Sharkovsky's Ordering and Chaos Introduction to Fractal Geometry and Chaos Matilde Marcolli Sharkovsky's theorem • in fact the result of Li and Yorke is a special case of a previous much more general theorem of Sharkovsky • Oleksandr M.
    [Show full text]
  • Periodic Points and Entropies for Cellular Automata
    Complex Systems 3 (1989) 117-128 Periodic Points and Entropies for Cellular Automata Rui M.A. Dillio CERN, SPS Division, CH-1211 Geneva, Switzerland and CFMC, Av. Prof Gama Pinto 2,1699 Lisbon Codex, Port ugal Abstract. For the class of permutive cellular automata the num­ ber of periodic points and the topological and metrical entropies are calculated. 1. Introduction Cellular automata (CA) are infinite sequences of symbols of a finite alphabet that evolve in time according to a definite local rule. We can take, for ex­ ample, a lattice where each vertex contains the value of a dynamical variable ranging over a finite set of numbers. At a certain t ime to the values on the vertices of the lattice take a definite value, but at time to + 1 , the values of the dynamical variable can change according to a law defined locally. This kind of system, as shown by von Neumann [8] can simulate a Turing ma­ chine, and specific examples exist where the cellular automaton is capable of uni versal computation [3]. The simplest examples of CA ru les are obtained when we restrict to one-dimensional lattices and the dynamic variable over each site of the lattice can take values on the finite field Z2 = {O,I} [10]. There is an extensive literature on the dynamics of one-dimensional CA and on the patterns generated by the evolution of the CA ru les in the ex­ tended phase space Z x Z+ [12]. These patterns appear to be organized in several complexity classes according to the behavior of the iterates of random initial conditions [11].
    [Show full text]
  • Lecture Notes on Complexity and Periodic Orbits
    Lecture Notes on Complexity and Periodic Orbits Bryce Weaver May 20, 2015 1 Introduction These are supplemental lecture notes for the Undergraduate Summer School on Boundaries and Dynamics at Notre Dame University. They are incomplete. As of now, there is insufficient background for some of the topics, a complete absence of citations, some undefined objects, and several of the proofs could use greater details. Furthermore, these notes have not been vetted, so is a hope that students will help with improvements, both with finding mistakes and typos, but also through stylistic criticism. That said, the goal of these notes is to expose some of the intriguing proper- ties of a class of complicated dynamical systems. This is done by examining one famous example: the \2-1-1-1"-hyperbolic toral automorphism. This example is a prototype of hyperbolic behavior and has insights into dynamical systems that are both smooth and complicated. The two properties exposed here are stable sets and the growth rate of periodic orbits. Although, it is incomplete in these notes themselves, part of the course will be to hint at the relationship of these two. Draft, do not cite 1 2 Definitions and First Examples 2.1 Definition of a Dynamical System One should consider this a basic definition that provides good intuition for understanding dynamical systems from both a historic and philosophical point of view. There exists greater notions of dynamical systems but we restrict to actions of N; Z or R with + denotes the standard addition. Definition 2.1. A dynamical system, (X; T ; φ), is a set, X, an additive group or semi-group, T = N; Z or R, and a function, φ : X × T ! X, which satisfies the properties φ(x; t + s) = φ(φ(x; s); t) (1) for any x 2 X and s; t 2 T .
    [Show full text]
  • 3. Attracting and Repelling Fixed Points 2 4
    CHAOS THEORY AND DYNAMICAL SYSTEMS MICHAEL KRIHELI Contents 1. Iterates and Orbits 1 2. Fixed Points and Periodic Points 1 3. Attracting and Repelling Fixed Points 2 4. Bifurcation 2 5. The Magic of Period 3: Period 3 Implies Chaos 4 6. Chaotic Dynamical Systems 6 References 7 Abstract. This paper gives an introduction to dynamical systems and chaos. Among other things it proves a remarkable theorem called the period 3 theorem and states the more general Sarkovskii theorem. 1. Iterates and Orbits Definition 1.1. Let S be a set and f a function mapping the set S into itself. i.e. f : S → S. The functions f 1, f 2, ..., f n, ... are defined inductively as follows: f 1 = f if f n−1 is known than f n = f n−1 ◦ f. Each of these functions is said to be an iterate of f. 1 n Definition 1.2. Let f : S → S. If x0 ∈ S then x0, f (x0), ..., f (x0), ... is called the orbit of x0. x0 is called the seed of the orbit. Definition 1.3. Let f : S → S. A point a ∈ S is said to be a fixed point of f if f(a) = a. 2. Fixed Points and Periodic Points Definition 2.1. Let f : S → S. A point a ∈ S is said to be eventually fixed if a is not a fixed point, but some point on the orbit of a is a fixed point. 2 2 Example 2.2. Let f = x ,S = R, x0 = −1. We can see that f(x0) = 1 6= x0 but f (x0) = 1 = f(x0) hence the point 1 which is on the orbit of x0 is fixed and therefore x0 is eventually fixed.
    [Show full text]
  • Dynamics of $ C^ 1$-Diffeomorphisms: Global Description and Prospects for Classification
    Dynamics of C1-diffeomorphisms: global description and prospects for classification Sylvain Crovisier Abstract. We are interested in finding a dense part of the space of C1-diffeomorphisms which decomposes into open subsets corresponding to different dynamical behaviors: we discuss results and questions in this direction. In particular we present recent results towards a conjecture by J. Palis: any system can be approximated either by one which is hyperbolic (and whose dynamics is well un- derstood) or by one which exhibits a homoclinic bifurcation (a simple local configuration involving one or two periodic orbits). Mathematics Subject Classification (2010). Primary 37C20, 37C50, 37D25, 37D30; Secondary 37C29, 37D05, 37G25. Keywords. Differentiable dynamical systems, closing lemma, homoclinic tangency, het- erodimensional cycle, partial hyperbolicity, generic dynamics. 1. Introduction A differentiable transformation - a diffeomorphism or a flow - on a manifold defines a dynamical systems: our goal is to describe the long time behavior of its orbits. In some cases, the dynamics, though rich, can be satisfactorily understood: the hyperbolic systems introduced by Anosov and Smale [5, 78] break down into finitely many transitive pieces, can be coded by a finite alphabet, admit physical measures which represent the orbit of Lebesgue-almost every point, are structurally stable... The dynamics of a particular system may be quite particular and too com- plicated. One will instead consider a large class of systems on a fixed compact connected smooth manifold M without boundary. For instance: arXiv:1405.0305v1 [math.DS] 1 May 2014 { the spaces of Cr diffeomorphisms Diffr(M) or vector fields X r(M), for r ≥ 1, r { the subspace Diff!(M) of those preserving a volume or symplectic form !, { the spaces of Cr Hamiltonians H : M ! R (when M is symplectic), and of Cr+1 Riemannian metrics on M (defining the geodesic flows on TM), etc.
    [Show full text]
  • Periodic Orbits and Chain-Transitive Sets of C1-Diffeomorphisms
    PERIODIC ORBITS AND CHAIN-TRANSITIVE SETS OF C1-DIFFEOMORPHISMS by SYLVAIN CROVISIER ABSTRACT We prove that the chain-transitive sets of C1-generic diffeomorphisms are approximated in the Hausdorff topology by periodic orbits. This implies that the homoclinic classes are dense among the chain-recurrence classes. This result is a consequence of a global connecting lemma, which allows to build by a C1-perturbation an orbit connecting several prescribed points. One deduces a weak shadowing property satisfied by C1-generic diffeomorphisms: any pseudo-orbit is approximated in the Hausdorff topology by a finite segment of a genuine orbit. As a consequence, we obtain a criterion for proving the tolerance stability conjecture in Diff1(M). CONTENTS 0. Introduction..................................................................................... 87 1. Generalizednotionoforbitsandrecurrence.......................................................... 97 2. Connectinglemmas..............................................................................107 3. Genericpropertiesofgeneralizedorbits .............................................................111 4. Approximationofweaklytransitivesetsbyperiodicorbits..............................................117 5. Proofoftheotherperturbationresults...............................................................129 0. Introduction 0.1. The shadowing lemma in hyperbolic dynamics In the study of differentiable dynamics, a remarkably successful theory, starting from the early sixties with Smale [Sm2], describes
    [Show full text]
  • Fractal Geometry and Dynamics
    FRACTAL GEOMETRY AND DYNAMICS MOOR XU NOTES FROM A COURSE BY YAKOV PESIN Abstract. These notes were taken from a mini-course at the 2010 REU at the Pennsylvania State University. The course was taught for two weeks from July 19 to July 30; there were eight two-hour lectures and two problem sessions. The lectures were given by Yakov Pesin and the problem sessions were given by Vaughn Cli- menhaga. Contents 1. Introduction 1 2. Introduction to Fractal Geometry 2 3. Introduction to Dynamical Systems 5 4. More on Dynamical Systems 7 5. Hausdorff Dimension 12 6. Box Dimensions 15 7. Further Ideas in Dynamical Systems 21 8. Computing Dimension 25 9. Two Dimensional Dynamical Systems 28 10. Nonlinear Two Dimensional Systems 35 11. Homework 1 46 12. Homework 2 53 1. Introduction This course is about fractal geometry and dynamical systems. These areas intersect, and this is what we are interested in. We won't be able to go deep. It is new and rapidly developing.1 Fractal geometry itself goes back to Caratheodory, Hausdorff, and Besicovich. They can be called fathers of this area, working around the year 1900. For dynamical systems, the area goes back to Poincare, and many people have contributed to this area. There are so many 119 June 2010 1 2 FRACTAL GEOMETRY AND DYNAMICS people that it would take a whole lecture to list. The intersection of the two areas originated first with the work of Mandelbrot. He was the first one who advertised this to non-mathematicians with a book called Fractal Geometry of Nature.
    [Show full text]