DOCSLIB.ORG

Substitutions and Interval Exchange Transformations of Rotation Class

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Substitutions and Interval Exchange Transformations of Rotation Class CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Theoretical Computer Science 255 (2001) 323–344 www.elsevier.com/locate/tcs Substitutions andinterval exchange transformations of rotation class Luis-Miguel Lopez a, Philippe Narbel b;∗ a IGM, Universiteà Marne-La-Vallee.à 2, rue de la Butte Verte, 93166 Noisy-le-Grand, France b LABRI, Universiteà Bordeaux I. 351, CNRS URA 1304, Cours de la Liberationà 33405 Talence, France ReceivedSeptember 1998; revisedJune 1999 Communicatedby M. Nivat Abstract We propose a methodfor obtaining the symbolic orbits of interval exchange transformations of rotation class over n intervals by composing a ÿnite set of basic substitutions, i.e. by doing simple parallel rewriting. Basedon surface theory, this methodis shown to be closely relatedto Rauzy induction. Sturmian objects are known to correspond to interval exchange transformations over 2 intervals. In this respect, our n intervals case is shown to be also relatedto continued fractions andthe obtainedwordshave also linear complexity. c 2001 Elsevier Science B.V. All rights reserved. Keywords: Substitutions; Symbolic dynamics; Interval exchanges; Continued fractions; Sturmian words; Dehn twists 1. Introduction Substitutions are simple parallel rewriting processes on words which are usual endo- morphisms when appliedto ÿnite words.A substitution  is deÿned by the image words of each single involvedletter. For instance, over the alphabet {a; b}, let Â(a)=ab and Â(b)=a, then Â(aba)=Â(a)Â(b)Â(a)=abaab. Studying iterations of such processes has been extensively done in formal language theory, mostly under the name of D0L- systems (see for instance [27, 28]), as well as in symbolic dynamics [9, 24, 14]. Interval exchange transformations are simple piecewise isometric maps acting on an interval of the real line, say [0; 1), whose e@ect is to permute a ÿnite number of semi-open subintervals which makes a partition of it. For instance, let a ∈ (0; 1), This paper writing has been endedwhilethe ÿrst author was invitedat the Tokyo Institute of Technology. ∗ Corresponding author. E-mail addresses: [email protected] (L.-M. Lopez), [email protected] (P. Narbel). 0304-3975/01/$ - see front matter c 2001 Elsevier Science B.V. All rights reserved. PII: S0304-3975(99)00290-X 324 L.-M. Lopez, P. Narbel / Theoretical Computer Science 255 (2001) 323–344 and T(x)=x +(1− a)ifx ∈ [0;a);T(x)=x − a if x ∈ [a; 1): this deÿnes an interval exchange transformation over 2 intervals. Such a transformation is fully characterized by the length of the involvedsubintervals andthe permutation which shuFes them. When iterated, interval exchange transformations lead to generic examples of dynamical systems (see for instance [11, 30, 31, 21, 18]). Iterations of an interval exchange transformation can easily be transformedinto sym- bolic information following a traditional operation in dynamical system theory (see for instance [11]): one assigns a di@erent letter to each of the intervals so that the iterates of the interval exchange transformation, the orbits, are translatedinto words. The relationship between substitutions andinterval exchange transformations over 2 intervals, hence over alphabets of 2 letters has been already extensively deciphered, mostly under the name of Sturmian words and Sturmian substitutions (see [22, 7, 3, 4]). The main result we prove here is about a set of interval exchange transforma- tions over n intervals. This set consists of the interval exchange of rotation class (see [31, 23]) which are those which have at most two discontinuities, and for which unique ergodicity is ensured. Of course these include all the interval exchanges over 2 and3 intervals, but also many over n-intervals where n¿4. The theorem we prove here is the following: Theorem. Consider an irreducible and irrational interval exchange transformation of rotation class over n intervals, n¿2(resp. n =2). The set of its symbolicorbits can be constructively described from compositions of an explicit set of n +1 substitutions (resp. 2 substitutions) over an alphabet of n letters. The proof is basedon the so-called Rauzy induction (see mainly [26, 31, 13, 33, 23]), which is here geometrically interpretedon surfaces with a structure of non-crossing parallel curves, i.e. singular foliations. It comes out that the considered foliations can be summedup by interval exchange transformations, deÿnedby ÿrst return maps describing how curves hit some ÿnite transverse segments (see e.g. [18, p.199]). The shorter the segments, the longer the pieces of leaves between successive hits of the transverse segments. In this respect, Rauzy induction can be seen as a mecanism for systematically shrinking a set of transverse segments, andtherefore lengthening the pieces of leaves between hits (see e.g. [33]). Using the symbolic translation of the orbits of an interval exchange transformation, the idea of the proof is that this lengthening can be interpretedas the application of substitutions. Since Sturmian words are the symbolic translation of the case of interval exchange transformations over 2 intervals, we show next, ÿrst, how some of the properties of these wordsare recoveredfrom our framework, andsecondhow these properties hold in the general case over n intervals: • The complexity of an inÿnite word w is deÿned as a map N∗ → N which gives, for each m ∈ N∗ the number of subwords of length m that occur in w (see e.g. [1, 17]). This is an usual measure for the structure of inÿnite words. Sturmian words are known to have linear complexity m + 1 [22, 7, 4]. Symbolic orbits of interval ex- L.-M. Lopez, P. Narbel / Theoretical Computer Science 255 (2001) 323–344 325 change transformations over n intervals can be provedto have linear complexity (n − 1)m + 1, andtherefore: Proposition. All the inÿnite words generated by the above theorem have complexity (n − 1)m +1. • Sturmian wordsare known to be closely relatedto the classical continuedfrac- tion algorithm (see e.g. [19, 10, 3, 4]). The basic process to generate composition of substitutions in the theorem, i.e. Rauzy induction, can be seen to be this classical algorithm in the 2 intervals case, andgives a multidimensionalcontinuedfraction algorithm [25, 13, 33, 23] in the general case. We discuss the convergence property of this generalization: Proposition. For every interval exchange transformation of rotation class over n inter- vals, n¿2; Rauzy induction leads to a weakly convergent multidimensional continued fraction algorithm. We also show how this multidimensional continued fraction algorithm ÿts into the general framework of Szekeres [29, 5]. • Sturmian substitutions are those which leave stable Sturmian words. They can be generatedby sets of essentially two substitutions. We show how our framework allows one to recover one of the results about them: Proposition. Consider an interval exchange transformation over 2 intervals. Then the two substitutions given by the above theorem are the Sturmian basicones used in [10] to relate Sturmian words and classical continued fractions. 2. Interval exchange transformations Let =( 1;:::; n)beann-dimensional positive vector (n¿2) such that j j =1, calleda length vector, andlet be a permutation of {1;:::;n}.Aninterval ex- change transformation (see e.g. [31, 21, 18]) is a function T :[0; 1) → [0; 1) whose ; domain is decomposed according to b = 0 and b = i , for i =1;:::;n, i.e. as 0 i j=1 j n I where I =[b ;b), andwhose range is decomposedaccordingto the length i=1 i i i−1 i i n vector ( −1(1);:::; −1(n)) with b0 = 0 and bi = j=1 −1( j), i.e. as i=1 Ji where Ji =[bi−1;bi ). The complete expression of T ; is then given as T ; (x)=x − bi−1 + b(i)−1 for all x ∈ Ii;i=1;:::;n. One can see that the intervals Ji’s are just the intervals Ii’s gluedtogether accordingto the permutation , where the interval Ii which is in the ith place, is sent to the (i)th place. An interval exchange transformation is saidto be irreducible when its permutation does not ÿx (setwise) any strict subset {1;:::;k}⊂{1;:::;n}. The simplest non- trivial example of an irreducible T ; is given by a decomposition of [0; 1) into two 326 L.-M. Lopez, P. Narbel / Theoretical Computer Science 255 (2001) 323–344 Fig. 1. intervals (see Fig. 1(i)): =(a; 1−a), where 0¡a¡1, and (1)=2;(2) = 1. Hence, b0 =0;b1 = a; b2 =1;I1 =[0;a);I2 =[a; 1), and T ; (x)=x+(1−a)onI1;T ; (x)=x − a on I2. Another interval exchange over 3 intervals is shown in Fig. 1(ii) where 1 7 1 (1)=3;(2)=2;(3) = 1, and =(6 ; 12 ; 4 ). An interval exchange transformation is saidto be of rotation class i@ it has either one or two discontinuities [23]. For instance, over 4 intervals, if is deÿned as (1)=4;(2)=3;(3)=1;(4)=2, then T ; (x) has only two discontinuities. Let the positive orbit (resp. orbit) of a point x ∈ [0; 1) be O+(x)={T i (x);i∈ N} ; i n−1 (resp. O(x)={T ; (x);i∈ Z}), andlet I be [0; 1)\ i=1 O(bi). Then the pair (I; T ; )isadynamical system, i.e. a pair (X; T) such that X is a metric space and T : X → X is continuous. Such a system is saidto be minimal i@ for Y ⊂ X; Closure (T(Y )) = Y implies Y = X or Y = ∅. The system (I;T ; ) is minimal i@ for each x ∈ [0; 1), the orbit O(x) is dense in [0; 1) [11]. Moreover, if T ; is irreducible and irrational, i.e. the only rational relations between the i’s are multiples of 1 + ···+ n = 1, then T ; is minimal [11].
Load more

Recommended publications
  • The Topological Entropy Conjecture
    mathematics Article The Topological Entropy Conjecture Lvlin Luo 1,2,3,4 1 Arts and Sciences Teaching Department, Shanghai University of Medicine and Health Sciences, Shanghai 201318, China; [email protected] or [email protected] 2 School of Mathematical Sciences, Fudan University, Shanghai 200433, China 3 School of Mathematics, Jilin University, Changchun 130012, China 4 School of Mathematics and Statistics, Xidian University, Xi’an 710071, China Abstract: For a compact Hausdorff space X, let J be the ordered set associated with the set of all finite open covers of X such that there exists nJ, where nJ is the dimension of X associated with ¶. Therefore, we have Hˇ p(X; Z), where 0 ≤ p ≤ n = nJ. For a continuous self-map f on X, let a 2 J be f an open cover of X and L f (a) = fL f (U)jU 2 ag. Then, there exists an open fiber cover L˙ f (a) of X induced by L f (a). In this paper, we define a topological fiber entropy entL( f ) as the supremum of f ent( f , L˙ f (a)) through all finite open covers of X = fL f (U); U ⊂ Xg, where L f (U) is the f-fiber of − U, that is the set of images f n(U) and preimages f n(U) for n 2 N. Then, we prove the conjecture log r ≤ entL( f ) for f being a continuous self-map on a given compact Hausdorff space X, where r is the maximum absolute eigenvalue of f∗, which is the linear transformation associated with f on the n L Cechˇ homology group Hˇ ∗(X; Z) = Hˇ i(X; Z).
    [Show full text]
  • Topological Invariance of the Sign of the Lyapunov Exponents in One-Dimensional Maps
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 134, Number 1, Pages 265–272 S 0002-9939(05)08040-8 Article electronically published on August 19, 2005 TOPOLOGICAL INVARIANCE OF THE SIGN OF THE LYAPUNOV EXPONENTS IN ONE-DIMENSIONAL MAPS HENK BRUIN AND STEFANO LUZZATTO (Communicated by Michael Handel) Abstract. We explore some properties of Lyapunov exponents of measures preserved by smooth maps of the interval, and study the behaviour of the Lyapunov exponents under topological conjugacy. 1. Statement of results In this paper we consider C3 interval maps f : I → I,whereI is a compact interval. We let C denote the set of critical points of f: c ∈C⇔Df(c)=0.We shall always suppose that C is finite and that each critical point is non-flat: for each ∈C ∈ ∞ 1 ≤ |f(x)−f(c)| ≤ c ,thereexist = (c) [2, )andK such that K |x−c| K for all x = c.LetM be the set of ergodic Borel f-invariant probability measures. For every µ ∈M, we define the Lyapunov exponent λ(µ)by λ(µ)= log |Df|dµ. Note that log |Df|dµ < +∞ is automatic since Df is bounded. However we can have log |Df|dµ = −∞ if c ∈Cis a fixed point and µ is the Dirac-δ measure on c. It follows from [15, 1] that this is essentially the only way in which log |Df| can be non-integrable: if µ(C)=0,then log |Df|dµ > −∞. The sign, more than the actual value, of the Lyapunov exponent can have signif- icant implications for the dynamics. A positive Lyapunov exponent, for example, indicates sensitivity to initial conditions and thus “chaotic” dynamics of some kind.
    [Show full text]
  • Writing the History of Dynamical Systems and Chaos
    Historia Mathematica 29 (2002), 273–339 doi:10.1006/hmat.2002.2351 Writing the History of Dynamical Systems and Chaos: View metadata, citation and similar papersLongue at core.ac.uk Dur´ee and Revolution, Disciplines and Cultures1 brought to you by CORE provided by Elsevier - Publisher Connector David Aubin Max-Planck Institut fur¨ Wissenschaftsgeschichte, Berlin, Germany E-mail: [email protected] and Amy Dahan Dalmedico Centre national de la recherche scientifique and Centre Alexandre-Koyre,´ Paris, France E-mail: [email protected] Between the late 1960s and the beginning of the 1980s, the wide recognition that simple dynamical laws could give rise to complex behaviors was sometimes hailed as a true scientific revolution impacting several disciplines, for which a striking label was coined—“chaos.” Mathematicians quickly pointed out that the purported revolution was relying on the abstract theory of dynamical systems founded in the late 19th century by Henri Poincar´e who had already reached a similar conclusion. In this paper, we flesh out the historiographical tensions arising from these confrontations: longue-duree´ history and revolution; abstract mathematics and the use of mathematical techniques in various other domains. After reviewing the historiography of dynamical systems theory from Poincar´e to the 1960s, we highlight the pioneering work of a few individuals (Steve Smale, Edward Lorenz, David Ruelle). We then go on to discuss the nature of the chaos phenomenon, which, we argue, was a conceptual reconfiguration as
    [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]
  • Arxiv:1812.04689V1 [Math.DS] 11 Dec 2018 Fasltigipisteeitneo W Oitos Into Foliations, Two Years
    FOLIATIONS AND CONJUGACY, II: THE MENDES CONJECTURE FOR TIME-ONE MAPS OF FLOWS JORGE GROISMAN AND ZBIGNIEW NITECKI Abstract. A diffeomorphism f: R2 →R2 in the plane is Anosov if it has a hyperbolic splitting at every point of the plane. The two known topo- logical conjugacy classes of such diffeomorphisms are linear hyperbolic automorphisms and translations (the existence of Anosov structures for plane translations was originally shown by W. White). P. Mendes con- jectured that these are the only topological conjugacy classes for Anosov diffeomorphisms in the plane. We prove that this claim holds when the Anosov diffeomorphism is the time-one map of a flow, via a theorem about foliations invariant under a time one map. 1. Introduction A diffeomorphism f: M →M of a compact manifold M is called Anosov if it has a global hyperbolic splitting of the tangent bundle. Such diffeomor- phisms have been studied extensively in the past fifty years. The existence of a splitting implies the existence of two foliations, into stable (resp. unsta- ble) manifolds, preserved by the diffeomorphism, such that the map shrinks distances along the stable leaves, while its inverse does so for the unstable ones. Anosov diffeomorphisms of compact manifolds have strong recurrence properties. The existence of an Anosov structure when M is compact is independent of the Riemann metric used to define it, and the foliations are invariants of topological conjugacy. By contrast, an Anosov structure on a non-compact manifold is highly dependent on the Riemann metric, and the recurrence arXiv:1812.04689v1 [math.DS] 11 Dec 2018 properties observed in the compact case do not hold in general.
    [Show full text]
  • Quasiconformal Homeomorphisms in Dynamics, Topology, and Geometry
    Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986 Quasiconformal Homeomorphisms in Dynamics, Topology, and Geometry DENNIS SULLIVAN Dedicated to R. H. Bing This paper has four parts. Each part involves quasiconformal homeomor­ phisms. These can be defined between arbitrary metric spaces: <p: X —* Y is Ä'-quasiconformal (or K qc) if zjf \ _ r SUP 1^0*0 ~ Piv) wnere \x - y\ = r and x is fixed r_>o inf \<p(x) — <p(y)\ where \x — y\ = r and x is fixed is at most K where | | means distance. Between open sets in Euclidean space, H(x) < K implies <p has many interesting analytic properties. (See Gehring's lecture at this congress.) In the first part we discuss Feigenbaum's numerical discoveries in one-dimen­ sional iteration problems. Quasiconformal conjugacies can be used to define a useful coordinate independent distance between real analytic dynamical systems which is decreased by Feigenbaum's renormalization operator. In the second part we discuss de Rham, Atiyah-Singer, and Yang-Mills the­ ory in its foundational aspect on quasiconformal manifolds. The discussion (which is joint work with Simon Donaldson) connects with Donaldson's work and Freedman's work to complete a nice picture in the structure of manifolds— each topological manifold has an essentially unique quasiconformal structure in all dimensions—except four (Sullivan [21]). In dimension 4 both parts of the statement are false (Donaldson and Sullivan [3]). In the third part we discuss the C-analytic classification of expanding analytic transformations near fractal invariant sets. The infinite dimensional Teichmüller ^spare-ofnsuch=systemrìs^embedded=in^ for the transformation on the fractal.
    [Show full text]
  • Mostly Conjugate: Relating Dynamical Systems — Beyond Homeomorphism
    Mostly Conjugate: Relating Dynamical Systems — Beyond Homeomorphism Joseph D. Skufca1, ∗ and Erik M. Bollt1, † 1 Department of Mathematics, Clarkson University, Potsdam, New York (Dated: April 24, 2006) A centerpiece of Dynamical Systems is comparison by an equivalence relationship called topolog- ical conjugacy. Current state of the field is that, generally, there is no easy way to determine if two systems are conjugate or to explicitly find the conjugacy between systems that are known to be equivalent. We present a new and highly generalizable method to produce conjugacy functions based on a functional fixed point iteration scheme. In specific cases, we prove that although the conjugacy function is strictly increasing, it is a.e. differentiable, with derivative 0 everywhere that it exists — a Lebesgue singular function. When applied to non-conjugate dynamical systems, we show that the fixed point iteration scheme still has a limit point, which is a function we now call a “commuter” — a non-homeomorphic change of coordinates translating between dissimilar systems. This translation is natural to the concepts of dynamical systems in that it matches the systems within the language of their orbit structures. We introduce methods to compare nonequivalent sys- tems by quantifying how much the commuter functions fails to be a homeomorphism, an approach that gives more respect to the dynamics than the traditional comparisons based on normed linear spaces, such as L2. Our discussion includes fundamental issues as a principled understanding of the degree to which a “toy model” might be representative of a more complicated system, an important concept to clarify since it is often used loosely throughout science.
    [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]
  • Quasiconformal Homeomorphisms and Dynamics III: the Teichmüller Space of a Holomorphic Dynamical System
    Quasiconformal Homeomorphisms and Dynamics III: The Teichm¨uller space of a holomorphic dynamical system Curtis T. McMullen and Dennis P. Sullivan ∗ Harvard University, Cambridge MA 02138 CUNY Grad Center, New York, NY and SUNY, Stony Brook, NY 20 November, 1993 Contents 1 Introduction.................................... 2 2 Statementofresults ............................... 3 3 Classificationofstableregions. 8 4 The Teichm¨uller space of a holomorphic dynamical system . ......... 11 5 FoliatedRiemannsurfaces . .. .. .. .. .. .. .. .. 19 6 The Teichm¨uller space of a rational map . 22 7 Holomorphic motions and quasiconformal conjugacies . 28 8 Hyperbolicrationalmaps ............................ 36 9 Complex tori and invariant line fields on the Julia set . 37 10 Example: Quadraticpolynomials . 39 ∗ Research of both authors partially supported by the NSF. 1 1 Introduction This paper completes in a definitive way the picture of rational mappings begun in [30]. It also provides new proofs for and expands upon an earlier version [46] from the early 1980s. In the meantime the methods and conclusions have become widely used, but rarely stated in full generality. We hope the present treatment will provide a useful contribution to the foundations of the field. Let f : C C be a rational map on the Riemann sphere C, with degree d>1, whose → iterates are to be studied. ! ! ! The sphere is invariantly divided into the compact Julia set J, which is dynamically chaotic and usually fractal, and the Fatou set Ω= C J consisting of countably many open − connected stable regions each of which is eventually periodic under forward iteration (by the ! main theorem of [44]). The cycles of stable regions are of five types: parabolic, attractive and superattractive basins; Siegel disks; and Herman rings.
    [Show full text]
  • ERGODIC and SPECTRAL PROPERTIES an Interval Exchange
    STRUCTURE OF THREE-INTERVAL EXCHANGE TRANSFORMATIONS III: ERGODIC AND SPECTRAL PROPERTIES SEBASTIEN´ FERENCZI, CHARLES HOLTON, AND LUCA Q. ZAMBONI ABSTRACT. In this paper we present a detailed study of the spectral/ergodic properties of three- interval exchange transformations. Our approach is mostly combinatorial, and relies on the dio- phantine results in Part I and the combinatorial description in Part II. We define a recursive method of generating three sequences of nested Rokhlin stacks which describe the system from a measure- theoretic point of view and which in turn gives an explicit characterization of the eigenvalues. We obtain necessary and sufficient conditions for weak mixing which, in addition to unifying all previ- ously known examples, allow us to exhibit new examples of weakly mixing three-interval exchanges. Finally we give affirmative answers to two questions posed by W.A. Veech on the existence of three- interval exchanges having irrational eigenvalues and discrete spectrum. 1. INTRODUCTION An interval exchange transformation is given by a probability vector (α1, α2, . , αk) together with a permutation π of {1, 2, . , k}. The unit interval [0, 1) is partitioned into k sub-intervals of lengths α1, α2, . , αk which are then rearranged according to the permutation π. Katok and Stepin [20] used interval exchanges to exhibit a class of systems having simple continuous spectrum. Interval exchange transformations have been extensively studied by several people including Keane [21] [22], Keynes and Newton [23], Veech [31] to [36], Rauzy [28], Masur [24], Del Junco [14], Boshernitzan [5, 6], Nogueira and Rudolph [27], Boshernitzan and Carroll [7], Berthe,´ Chekhova, and Ferenczi [4], Chaves and Nogueira [10] and Boshernitzan and Nogueira [8].
    [Show full text]
  • Abstract Similarity, Fractals and Chaos
    Abstract Similarity, Fractals and Chaos The art of doing mathematics consists in finding that special case which contains all the germs of generality. David Hilbert Marat Akhmet∗ and Ejaily Milad Alejaily Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski fractals, Koch curve as well as Cantor set satisfy the definition. A similarity map is introduced and the problem of chaos presence for the sets is solved by considering the dynamics of the map. This is true for Poincar´e,Li-Yorke and Devaney chaos, even in multi-dimensional cases. Original numerical simulations which illustrate the results are delivered. 1 Introduction Self-similarity is one of the most important concepts in modern science. From the geometrical point of view, it is defined as the property of objects whose parts, at all scales, are similar to the whole. Dealing with self-similarity goes back to the 17th Century when Gottfried Leibniz introduced the notions of recursive self-similarity [1]. Since then, history has not recorded any thing about self-similarity until the late 19th century when Karl Weierstrass introduced in 1872 a function that being everywhere continuous but nowhere differentiable. The graph of the Weierstrass function became an example of a self-similar curve. The set constructed by Georg Cantor in 1883 is considered as the most essential and influential self similar set since it is a simple and perfect example for theory and applications of this field.
    [Show full text]
  • Lecture 4. Entropy and Markov Chains
    preliminary version : Not for di®usion Lecture 4. Entropy and Markov Chains The most important numerical invariant related to the orbit growth in topological dynamical systems is topological entropy.1 It represents the exponential growth rate of the number of orbit segments which are distinguishable with an arbitrarily high but ¯nite precision. Of course, topological entropy is invariant by topological conjugacy. For measurable dynamical systems, an entropy can be de¯ned using the invariant measure. It gives an indication of the amount of randomness or complexity of the system. The relation between measure{theoretical entropy and topological entropy is given by a variational principle. 4.1 Topological Entropy We will follow the de¯nition given by Rufus Bowen in [Bo, Chapter 4]. Let X be a compact metric space. De¯nition 4.1 Let S ½ X, n 2 N and " > 0. S is a (n; "){spanning set if for every x 2 X there exists y 2 S such that d(f j(x); f j(y)) · " for all 0 · j · n. It is immediate to check that the compactness of X implies the existence of ¯nite spanning sets. Let r(n; ") be the least number of points in an (n; "){spanning set. If we bound the time of observation of our dynamical system by n and our precision in making measurements is " we will see at most r(n; ") orbits. Exercise 4.2 Show that if X admits a cover by m sets of diameter · " then r(n; ") · mn+1. De¯nition 4.3 The topological entropy htop(f) of f is given by 1 htop(f) = lim lim sup log r(n; ") : [4:1] "!0 n!+1 n In the previous de¯nition one cannot replace lim sup with lim since there exist examples of maps for which the limit does not exist.
    [Show full text]