Math 354 Transition graphs and subshifts November 26, 2014

Size: px
Start display at page:

Download "Math 354 Transition graphs and subshifts November 26, 2014"

Transcription

1 Math 54 Transition graphs and subshifts November 6, 04. Transition graphs Let I be a closed interval in the real line. Suppose F : I I is function. Let I 0, I,..., I N be N closed subintervals in I with pairwise disjoint interiors. Assume that F is continuous on each I j Figure.. An example of a function F. Let I j = [j, j + ], for j = 0,,,. The transition graph of F is a graph G formed by () one vertex for each subinterval I j, labelled by the index j, and () an arrow i j if F (I i ) I j. Figure.. The transition graph for the example in Figure.. Theorem.. Suppose F is as above. Let p = v 0 v v n be an infinitely repeating path of vertices in the graph G. Suppose that

2 () n is the smallest period of p (so p is not of the form v 0 v v m for some m < n), and () the endpoints of the interval I v0 do not have itinerary p. Then there exists a point x I v0 of exact period n for F with the itinerary p. Before giving the proof of Theorem., let s see how it applies for the example in Figure.. Consider first the repeating sequence p = =, with period n =. Look at the itineraries of the endpoints of I = [, ]. Note that x = lies in a cycle of period. The itinerary of x = is not well defined, but it can be any sequence of the following form: x 0 x x x = (0 or )( or )(0 or )( or ) That is, every even entry must be a 0 or, and every odd entry must be a or a. In particular, our p = cannot be the itinerary of x =. The itinerary of x = is more straightforward: it is x 0 x x x = ( or )0 so it cannot coincide with p. Therefore, this function F has a fixed point inside I. Of course, we can see immediately from the graph of F that it has a fixed point in I. For a less straightforward example, consider p = 0 of period 4. Again we begin by computing the itineraries of the endpoints of I 0. The itinerary of x = 0 begins with 0, so it cannot coincide with p. We have already computed the itinerary of x =. Interestingly, our given p is one of the possible itineraries for the point x =. So unfortunately, we cannot deduce from Theorem. whether or not there exists a point of period 4 in I 0. On the other hand, consider the sequence p = 0. The Theorem does allow us to conclude that there is a point of period exactly 4 with this itinerary in I 0. The graphs of the nd and 4th iterates of F in Figure.. Note that the 4th iterate has exactly one fixed point in I 0 in addition to its endpoint (which has exact period ). The itinerary of that point must be 0. We see that there is no point of period exactly 4 with itinerary Figure.. The nd and 4th iterates of the function in Figure.. The points x = and x = are in a cycle of period. There is a point in I 0 that has period exactly 4 and itinerary 0. *** INSERT PROOF OF THEOREM. HERE ***

3 . Transition matrices and the subshift The transition matrix is an N-by-N matrix T that contains the same information as the transition graph, only presented in a different format. If we index the rows and columns by 0,,..., N, then ij-th entry in the matrix is a 0 or, where T ij = there is an arrow from i to j in G For the example in Figures. and., we have the matrix (.) T = Recall that the shift space on N symbols is Σ N = {0,,..., N } N, the set of all infinite sequences s = s 0 s s such that s i {0,,..., N } for all i. Recall that we defined a distance on Σ N by { 0 if s = t d(s, t) = if n = min{i : s n i t i } The subshift space associated to a transition matrix T is the set Or, in terms of the graph G, Σ T = {s 0 s s Σ N : T si s i+ = for all i}. Σ T = {sequences that are infinite paths in the graph}. Sometimes I will write Σ G for Σ T to emphasize the dependence on a graph. Figure. shows the simple transition graph I presented in class. For this example, the space Σ T is fairly easy to describe. It is: Σ T = {0, 0,, 0, 0, 00, 00, 000, 000,...} Figure.. Another transition graph. The subshift defined by a transition graph G or its transition matrix T is simply the shift map restricted to Σ T. That is, σ : Σ T Σ T defined by σ(s 0 s s ) = s s s. For the example of Figure., the sequence is fixed by σ, and the points 0 and 0 form a cycle of period. All other elements of Σ T are prefixed; after some number of iterates, they land on.

4 4 There is a definite advantage to encoding the data of G in matrix form, as the transition matrix T, as the following result shows. Theorem.. Let T be a transition matrix, and let σ : Σ T Σ T be the associated subshift. Then the number of fixed points of the n-th iterate σ n is equal to the trace of the matrix T n. Recall that the trace of a matrix is the sum of its diagonal entries. So for n = in the statement of the theorem, we have that tr T = #Fix(σ). Indeed, tr(t ) = T 00 + T + + T N,N, which must coincide with the number of fixed points of σ, by the definition of the transition matrix. For the example of Figure. with transition matrix (.), there is one sequence fixed by σ. The trace of T is also. Since the fixed point of σ is also fixed by σ, we see that there are no points of period exactly in Σ T. On the other hand, tr(t ) = 4, so there are four sequences in Σ T fixed by σ. These are {, 0, 0, 0}. Among these, one is the fixed point and the other three form a cycle of period. *** INSERT PROOF OF THEOREM. HERE ***. Chaotic subshifts Now we move to the question of when a subshift is chaotic. Recall that a dynamical system f : X X on a metric space X is chaotic if three conditions are satisfied: () periodic points are dense in X; () there exists a point x X with a dense orbit; and () f depends sensitively on initial conditions. Condition () means that there is a constant δ > 0 so that for every x X and every ε > 0, we can find a point y X and an iterate n N, so that d(x, y) < ε and d(f n x, f n y) δ. From the definitions, we may observe that the example in Figure. does not define a chaotic subshift. For example, this subshift fails to satisfy condition (). There are only three periodic points in Σ T, and none of these is close to the point s = 0. In fact, d(0, x) = / for each of the three periodic points x. So periodic points cannot be dense in this Σ T. By contrast, the next theorem will show that the example from Figure. is chaotic. Theorem.. Let G be a transition graph. Assume each vertex in G has at least one arrow pointing from it. Then the subshift σ : Σ G Σ G is chaotic if and only if G is irreducible and there exists a vertex with at least two arrows pointing from it. A transition graph is irreducible if for any pair of vertices i, j {0,,..., N }, there is a path from i to j. The examples from Figures. and. are both irreducible. In terms of the transition matrix T, the graph G is irreducible if and only if for each pair i, j, there is a power n so that (T n ) ij > 0. *** INSERT PROOF OF THEOREM. HERE ***

5 4. Transferring the information back to the original function It remains to relate these properties of the subshift back to properties of the original function F on an interval or union of intervals. Assume that X = I 0 I I N is a union of N closed intervals in R, with pairwise disjoint interiors. A differentiable function F is said to be expanding on X if there is a constant β > so that F (x) β for all x X. We also allow F to be non-differentiable at the endpoints of the intervals I j, as in Figure.. For that example in Figure., however, F is not expanding on all of X = I, since its slope is equal to on I 0 and I. But it is expanding on I I, where the slope is greater than in absolute value. Theorem 4.. Assume that F : X R is expanding. Assume also that F is one-to-one on each of the intervals I j. Let G be the transition graph for F with N vertices, and let σ : Σ G Σ G be the associated subshift. () For every sequence s Σ G, there is a unique point x X with itinerary s. From (), we see there is a well-defined map h : Σ G X sending s to this x. Let Λ G = h(σ G ) X. () The map h : Σ G Λ G induces a semiconjugacy from σ to F ; that is, F h = h σ. () If σ is chaotic on Σ G, then F is chaotic on Λ G. Though the function F from Figure. is not expanding, the third iterate of F is expanding. One can exploit this fact to deduce that Theorem 4. will apply also to this example. Therefore, this F is chaotic on the interval [0, ]. I leave it for you to think about why this might be true. There is only one key idea in the proof of Theorem 4. that you need to know. It is the construction of the point x with itinerary s. We have seen this before when studying the dynamics of Q c (x) = x + c with c <. For a given itinerary s = s 0 s s, look at the intersection I s0 F (I s ) F n (I sn ). Any point x in this intersection will satisfy F j (x) I sj for all j n. Since F is one-toone and continuous on each interval, this intersection will be a closed interval. Since F is expanding with expansion constant β >, this interval has length at most /β n times the length of the largest of the subintervals I j. In particular, as n, the infinite intersection will consist of a single point. That is our desired x. By construction, we have F n (x) I sn for each n Tent map. Let s illustrate Theorem 4. with an important example, the tent map on the unit interval [0, ]. Recall that the tent map of slope is defined by { x if 0 x T (x) = x if x 5

6 Figure 4.. The tent map of slope. For the tent map, we define I 0 = [0, /] and I = [/, ]. Note that T is expanding, since T (x) = at all points where the derivative is defined. The subshift for T with this choice of intervals I 0, I is actually the full shift on symbols, σ : Σ Σ, where every transition 00, 0, 0, is allowable. We have seen in class that the full shift is chaotic. Theorem 4. then implies that T is chaotic on the interval [0, ]. Moreover, T is semiconjugate to σ. Note that this semi-conjugacy cannot be a conjugacy! There is no homeomorphism between Σ and the interval [0, ]. After all, Σ is a Cantor set (and so totally disconnected), while the interval is connected. But the itinerary map h : Σ [0, ] is a continuous projection onto the interval. Its failure to be one-to-one can be seen quite easily. Note that the critical point x c = / does not have a well-defined address. This point x c lies in both I 0 and I. So it is described by two different itineraries, 0000 and 000 Part of the content of Theorem 4. is that x c is the only point in [0, ] with either of these itineraries. Similarly, look at the preimages of x c, namely x 0 = /4 and x = /4. Each of these points also has two itineraries; for x 0, they are and 0000, while for x they are 0000 and 000. The critical point and its preimages under iteration of T are the only points with multiple itineraries. Excluding these points and itineraries, h becomes a conjugacy. 4.. Quadratic examples. As another example, recall that the quadratic function Q (x) = x on [, ] is conjugate to the tent map T. We gave the explicit conjugating function, expressed in terms of the sine function, in class. It follows that Q is chaotic on [, ] (and semiconjugate to the full shift on symbols), as we have mentioned many times throughout the quarter. But Theorem 4. gives us a proof of this fact. An even more interesting example is the quadratic polynomial Q c (x) = x + c, where c = c is chosen so that the critical point x = 0 has period exactly. Thus c.755 lies in

7 the period- window of the bifurcation diagram. Since the derivative of Q c will be 0 at 0, this cycle of period is attracting. For this c, note that Q c (0) = c and Q c(0) = c +c = c (since Q c(0) = 0). The graph of Q c on the interval I = [c, c] is shown in Figure Figure 4.. The graph of Q c with c.755, on the interval I = [c, c] Set I 0 = [c, 0] and I = [0, c]. The transition matrix for Q c : I I is ( ) T = 0 You can check that the subshift σ : Σ T Σ T is chaotic. But note that Q c is not chaotic on I. After all, Q c has an attracting cycle of period. So there is a small interval around 0 that follows the orbit of 0. More precisely, the iterates (Q c) n (x) 0 as n for all x in a small neighborhood of 0. In particular, there cannot be a dense orbit in I and the periodic points cannot be dense. On the other hand, the subshift σ : Σ T Σ T is still useful for understanding the dynamics of Q c : I I. It is still the case that every allowable sequence s Σ T must be the itinerary of some point x I. This follows from the same ideas that go into proving Theorem.. What fails is that the point is not uniquely determined by its itinerary because of the presence of the attracting cycle. For example, there is a small number δ > 0 so that all x in the interval ( δ, 0) have the same itinerary, namely, 00, and all x in the interval (0, δ) have the itinerary 000. The critical point x = 0 has an ambiguous address and therefore the ambiguous itinerary of (0 or )0(0 or )0(0 or )0. But only two possibilities actually lie in Σ T, since is not an allowable transition. Therefore, the only allowable itineraries for the critical point are (0 or )000.

PERIODIC POINTS OF THE FAMILY OF TENT MAPS

PERIODIC POINTS OF THE FAMILY OF TENT MAPS PERIODIC POINTS OF THE FAMILY OF TENT MAPS ROBERTO HASFURA-B. AND PHILLIP LYNCH 1. INTRODUCTION. Of interest in this article is the dynamical behavior of the one-parameter family of maps T (x) = (1/2 x

More information

CHAOTIC UNIMODAL AND BIMODAL MAPS

CHAOTIC UNIMODAL AND BIMODAL MAPS CHAOTIC UNIMODAL AND BIMODAL MAPS FRED SHULTZ Abstract. We describe up to conjugacy all unimodal and bimodal maps that are chaotic, by giving necessary and sufficient conditions for unimodal and bimodal

More information

The Dynamics of Two and Three Circle Inversion Daniel M. Look Indiana University of Pennsylvania

The Dynamics of Two and Three Circle Inversion Daniel M. Look Indiana University of Pennsylvania The Dynamics of Two and Three Circle Inversion Daniel M. Look Indiana University of Pennsylvania AMS Subject Classification: Primary: 37F10 Secondary: 51N05, 54D70 Key Words: Julia Set, Complex Dynamics,

More information

MATH 614 Dynamical Systems and Chaos Lecture 7: Symbolic dynamics (continued).

MATH 614 Dynamical Systems and Chaos Lecture 7: Symbolic dynamics (continued). MATH 614 Dynamical Systems and Chaos Lecture 7: Symbolic dynamics (continued). Symbolic dynamics Given a finite set A (an alphabet), we denote by Σ A the set of all infinite words over A, i.e., infinite

More information

MAT335H1F Lec0101 Burbulla

MAT335H1F Lec0101 Burbulla Fall 2011 Q 2 (x) = x 2 2 Q 2 has two repelling fixed points, p = 1 and p + = 2. Moreover, if I = [ p +, p + ] = [ 2, 2], it is easy to check that p I and Q 2 : I I. So for any seed x 0 I, the orbit of

More information

Topological conjugacy and symbolic dynamics

Topological conjugacy and symbolic dynamics Chapter 4 Topological conjugacy and symbolic dynamics Conjugacy is about when two maps have precisely the same dynamical behaviour. Equivalently it is about changing the co-ordinate system we use to describe

More information

Singular Perturbations in the McMullen Domain

Singular Perturbations in the McMullen Domain Singular Perturbations in the McMullen Domain Robert L. Devaney Sebastian M. Marotta Department of Mathematics Boston University January 5, 2008 Abstract In this paper we study the dynamics of the family

More information

PHY411 Lecture notes Part 5

PHY411 Lecture notes Part 5 PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2

More information

Chaos induced by coupled-expanding maps

Chaos induced by coupled-expanding maps First Prev Next Last Seminar on CCCN, Jan. 26, 2006 Chaos induced by coupled-expanding maps Page 1 of 35 Yuming Shi Department of Mathematics Shandong University, China ymshi@sdu.edu.cn Collaborators:

More information

Chapter 1 The Real Numbers

Chapter 1 The Real Numbers Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus

More information

Section 2: Classes of Sets

Section 2: Classes of Sets Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks

More information

PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA

PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,

More information

Dynamics on Hubbard trees

Dynamics on Hubbard trees FUNDAME NTA MATHEMATICAE 164(2000) Dynamics on Hubbard trees by Lluís Alsedà and Núria Fagella (Barcelona) Abstract. It is well known that the Hubbard tree of a postcritically finite complex polynomial

More information

Lecture 16 Symbolic dynamics.

Lecture 16 Symbolic dynamics. Lecture 16 Symbolic dynamics. 1 Symbolic dynamics. The full shift on two letters and the Baker s transformation. 2 Shifts of finite type. 3 Directed multigraphs. 4 The zeta function. 5 Topological entropy.

More information

Dynamical Systems 2, MA 761

Dynamical Systems 2, MA 761 Dynamical Systems 2, MA 761 Topological Dynamics This material is based upon work supported by the National Science Foundation under Grant No. 9970363 1 Periodic Points 1 The main objects studied in the

More information

MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics.

MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics. MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics. Metric space Definition. Given a nonempty set X, a metric (or distance function) on X is a function d : X X R that satisfies the following

More information

INVARIANTS OF TWIST-WISE FLOW EQUIVALENCE

INVARIANTS OF TWIST-WISE FLOW EQUIVALENCE ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 3, Pages 126 130 (December 17, 1997) S 1079-6762(97)00037-1 INVARIANTS OF TWIST-WISE FLOW EQUIVALENCE MICHAEL C. SULLIVAN (Communicated

More information

Synchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology

Synchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology Synchronization, Chaos, and the Dynamics of Coupled Oscillators Supplemental 1 Winter 2017 Zachary Adams Undergraduate in Mathematics and Biology Outline: The shift map is discussed, and a rigorous proof

More information

1 The Local-to-Global Lemma

1 The Local-to-Global Lemma Point-Set Topology Connectedness: Lecture 2 1 The Local-to-Global Lemma In the world of advanced mathematics, we are often interested in comparing the local properties of a space to its global properties.

More information

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd

More information

Mapping Class Groups MSRI, Fall 2007 Day 2, September 6

Mapping Class Groups MSRI, Fall 2007 Day 2, September 6 Mapping Class Groups MSRI, Fall 7 Day, September 6 Lectures by Lee Mosher Notes by Yael Algom Kfir December 4, 7 Last time: Theorem (Conjugacy classification in MCG(T. Each conjugacy class of elements

More information

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved. Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124

More information

Dynamical Systems and Ergodic Theory PhD Exam Spring Topics: Topological Dynamics Definitions and basic results about the following for maps and

Dynamical Systems and Ergodic Theory PhD Exam Spring Topics: Topological Dynamics Definitions and basic results about the following for maps and Dynamical Systems and Ergodic Theory PhD Exam Spring 2012 Introduction: This is the first year for the Dynamical Systems and Ergodic Theory PhD exam. As such the material on the exam will conform fairly

More information

TOWARDS AUTOMATED CHAOS VERIFICATION

TOWARDS AUTOMATED CHAOS VERIFICATION TOWARDS AUTOMATED CHAOS VERIFICATION SARAH DAY CDSNS, Georgia Institute of Technology, Atlanta, GA 30332 OLIVER JUNGE Institute for Mathematics, University of Paderborn, 33100 Paderborn, Germany KONSTANTIN

More information

Dynamics of Tangent. Robert L. Devaney Department of Mathematics Boston University Boston, Mass Linda Keen

Dynamics of Tangent. Robert L. Devaney Department of Mathematics Boston University Boston, Mass Linda Keen Dynamics of Tangent Robert L. Devaney Department of Mathematics Boston University Boston, Mass. 02215 Linda Keen Department of Mathematics Herbert H. Lehman College, CUNY Bronx, N.Y. 10468 Abstract We

More information

REPRESENTATION THEORY OF S n

REPRESENTATION THEORY OF S n REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November

More information

arxiv: v1 [math.ds] 9 Feb 2014

arxiv: v1 [math.ds] 9 Feb 2014 ENTROPY IN DIMENSION ONE arxiv:1402.2008v1 [math.ds] 9 Feb 2014 WILLIAM P. THURSTON 1. Introduction Figure 1. This is a plot of roughly 8 108 roots of defining polynomials for exp(h(f )), where f ranges

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

ALGORITHMS FOR RIGOROUS ENTROPY BOUNDS AND SYMBOLIC DYNAMICS

ALGORITHMS FOR RIGOROUS ENTROPY BOUNDS AND SYMBOLIC DYNAMICS ALGORITHMS FOR RIGOROUS ENTROPY BOUNDS AND SYMBOLIC DYNAMICS SARAH DAY, RAFAEL FRONGILLO, AND RODRIGO TREVIÑO Abstract. The aim of this paper is to introduce a method for computing rigorous lower bounds

More information

ADMISSIBILITY OF KNEADING SEQUENCES AND STRUCTURE OF HUBBARD TREES FOR QUADRATIC POLYNOMIALS

ADMISSIBILITY OF KNEADING SEQUENCES AND STRUCTURE OF HUBBARD TREES FOR QUADRATIC POLYNOMIALS ADMISSIBILITY OF KNEADING SEQUENCES AND STRUCTURE OF HUBBARD TREES FOR QUADRATIC POLYNOMIALS HENK BRUIN AND DIERK SCHLEICHER Abstract. Hubbard trees are invariant trees connecting the points of the critical

More information

Mapping Class Groups MSRI, Fall 2007 Day 8, October 25

Mapping Class Groups MSRI, Fall 2007 Day 8, October 25 Mapping Class Groups MSRI, Fall 2007 Day 8, October 25 November 26, 2007 Reducible mapping classes Review terminology: An essential curve γ on S is a simple closed curve γ such that: no component of S

More information

Notes on Rauzy Fractals

Notes on Rauzy Fractals Notes on Rauzy Fractals It is a tradition to associate symbolic codings to dynamical systems arising from geometry or mechanics. Here we introduce a classical result to give geometric representations to

More information

x y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0

x y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0 Section. Systems of Linear Equations The equations x + 3 y =, x y + z =, and 3w + x + y + z = 0 have a common feature: each describes a geometric shape that is linear. Upon rewriting the first equation

More information

4 There are many equivalent metrics used in the literature. 5 Sometimes the definition is that for any open sets U

4 There are many equivalent metrics used in the literature. 5 Sometimes the definition is that for any open sets U 5. The binary shift 5 SYMBOLIC DYNAMICS Applied Dynamical Systems This file was processed January 7, 208. 5 Symbolic dynamics 5. The binary shift The special case r = 4 of the logistic map, or the equivalent

More information

Segment Description of Turbulence

Segment Description of Turbulence Dynamics of PDE, Vol.4, No.3, 283-291, 2007 Segment Description of Turbulence Y. Charles Li Communicated by Y. Charles Li, received August 25, 2007. Abstract. We propose a segment description for turbulent

More information

arxiv: v4 [math.rt] 9 Jun 2017

arxiv: v4 [math.rt] 9 Jun 2017 ON TANGENT CONES OF SCHUBERT VARIETIES D FUCHS, A KIRILLOV, S MORIER-GENOUD, V OVSIENKO arxiv:1667846v4 [mathrt] 9 Jun 217 Abstract We consider tangent cones of Schubert varieties in the complete flag

More information

SEMI-CONJUGACIES AND INVERSE LIMIT SPACES

SEMI-CONJUGACIES AND INVERSE LIMIT SPACES SEMI-CONJUGACIES AND INVERSE LIMIT SPACES LOUIS BLOCK, JAMES KEESLING, AND DENNIS LEDIS Abstract. Let f be a continuous map of the interval to itself. We prove that if f has a k-horseshoe, then f is topologically

More information

ADDING MACHINES, ENDPOINTS, AND INVERSE LIMIT SPACES. 1. Introduction

ADDING MACHINES, ENDPOINTS, AND INVERSE LIMIT SPACES. 1. Introduction ADDING MACHINES, ENDPOINTS, AND INVERSE LIMIT SPACES LORI ALVIN AND KAREN BRUCKS Abstract. Let f be a unimodal map in the logistic or symmetric tent family whose restriction to the omega limit set of the

More information

INDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS

INDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS INDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS JAMES P. KELLY AND JONATHAN MEDDAUGH Abstract. In this paper, we develop a sufficient condition for the inverse limit of upper semi-continuous

More information

TOEPLITZ KNEADING SEQUENCES AND ADDING MACHINES

TOEPLITZ KNEADING SEQUENCES AND ADDING MACHINES TOEPLITZ KNEADING SEQUENCES AND ADDING MACHINES LORI ALVIN Department of Mathematics and Statistics University of West Florida 11000 University Parkway Pensacola, FL 32514, USA Abstract. In this paper

More information

EXISTENCE OF QUADRATIC HUBBARD TREES. 1. Introduction

EXISTENCE OF QUADRATIC HUBBARD TREES. 1. Introduction EXISTENCE OF QUADRATIC HUBBARD TREES HENK BRUIN, ALEXANDRA KAFFL, AND DIERK SCHLEICHER Abstract. A (quadratic) Hubbard tree is an invariant tree connecting the critical orbit within the Julia set of a

More information

Solution to Homework #5 Roy Malka 1. Questions 2,3,4 of Homework #5 of M. Cross class. dv (x) dx

Solution to Homework #5 Roy Malka 1. Questions 2,3,4 of Homework #5 of M. Cross class. dv (x) dx Solution to Homework #5 Roy Malka. Questions 2,,4 of Homework #5 of M. Cross class. Bifurcations: (M. Cross) Consider the bifurcations of the stationary solutions of a particle undergoing damped one dimensional

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information

A Readable Introduction to Real Mathematics

A Readable Introduction to Real Mathematics Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 10: Sizes of Infinite Sets 1. Show that the set of all polynomials

More information

Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: Solutions Math 201A: Fall 2016 Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

More information

April 13, We now extend the structure of the horseshoe to more general kinds of invariant. x (v) λ n v.

April 13, We now extend the structure of the horseshoe to more general kinds of invariant. x (v) λ n v. April 3, 005 - Hyperbolic Sets We now extend the structure of the horseshoe to more general kinds of invariant sets. Let r, and let f D r (M) where M is a Riemannian manifold. A compact f invariant set

More information

CHAOS ON THE INTERVAL a survey of relationship between the various kinds of chaos for continuous interval maps. Sylvie Ruette

CHAOS ON THE INTERVAL a survey of relationship between the various kinds of chaos for continuous interval maps. Sylvie Ruette CHAOS ON THE INTERVAL a survey of relationship between the various kinds of chaos for continuous interval maps Sylvie Ruette...... f f... f Author Sylvie Ruette Laboratoire de Mathématiques d Orsay Université

More information

notes 5d. Details of the Construction of the Smale horseshoe map.

notes 5d. Details of the Construction of the Smale horseshoe map. by 3940-07 notes 5d Details of the Construction of the Smale horseshoe map. Let f (x; y) = ( 4 x + 8 ; 5y ). Then f maps D onto the rectangle R de ned 8 x 3 8 y 9 : In particular, it squeezes D horizontally

More information

DYNAMICAL SYSTEMS PROBLEMS. asgor/ (1) Which of the following maps are topologically transitive (minimal,

DYNAMICAL SYSTEMS PROBLEMS.  asgor/ (1) Which of the following maps are topologically transitive (minimal, DYNAMICAL SYSTEMS PROBLEMS http://www.math.uci.edu/ asgor/ (1) Which of the following maps are topologically transitive (minimal, topologically mixing)? identity map on a circle; irrational rotation of

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

Relations and Functions (for Math 026 review)

Relations and Functions (for Math 026 review) Section 3.1 Relations and Functions (for Math 026 review) Objective 1: Understanding the s of Relations and Functions Relation A relation is a correspondence between two sets A and B such that each element

More information

Measure and Category. Marianna Csörnyei. ucahmcs

Measure and Category. Marianna Csörnyei.   ucahmcs Measure and Category Marianna Csörnyei mari@math.ucl.ac.uk http:/www.ucl.ac.uk/ ucahmcs 1 / 96 A (very short) Introduction to Cardinals The cardinality of a set A is equal to the cardinality of a set B,

More information

Laplacians of Graphs, Spectra and Laplacian polynomials

Laplacians of Graphs, Spectra and Laplacian polynomials Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial

More information

Lecture 25 Markov Partitions

Lecture 25 Markov Partitions Lecture 25 Markov Partitions March 24, 2008 Let Λ be a locally maximal hyperbolic set and ɛ, δ > 0 constants for the local product structure where δ < ɛ/2 and ɛ is also a constant for expansion on Λ. For

More information

Bichain graphs: geometric model and universal graphs

Bichain graphs: geometric model and universal graphs Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United

More information

Evolution of the McMullen Domain for Singularly Perturbed Rational Maps

Evolution of the McMullen Domain for Singularly Perturbed Rational Maps Volume 32, 2008 Pages 301 320 http://topology.auburn.edu/tp/ Evolution of the McMullen Domain for Singularly Perturbed Rational Maps by Robert L. Devaney and Sebastian M. Marotta Electronically published

More information

MASTERS EXAMINATION IN MATHEMATICS SOLUTIONS

MASTERS EXAMINATION IN MATHEMATICS SOLUTIONS MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of

More information

SHADOWING AND ω-limit SETS OF CIRCULAR JULIA SETS

SHADOWING AND ω-limit SETS OF CIRCULAR JULIA SETS SHADOWING AND ω-limit SETS OF CIRCULAR JULIA SETS ANDREW D. BARWELL, JONATHAN MEDDAUGH, AND BRIAN E. RAINES Abstract. In this paper we consider quadratic polynomials on the complex plane f c(z) = z 2 +

More information

7 Planar systems of linear ODE

7 Planar systems of linear ODE 7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

More information

arxiv: v1 [math.gr] 20 Jan 2012

arxiv: v1 [math.gr] 20 Jan 2012 A THOMPSON GROUP FOR THE BASILICA JAMES BELK AND BRADLEY FORREST arxiv:1201.4225v1 [math.gr] 20 Jan 2012 Abstract. We describe a Thompson-like group of homeomorphisms of the Basilica Julia set. Each element

More information

2 n intervals in the attractor of the tent map

2 n intervals in the attractor of the tent map 2 n intervals in the attractor of the tent map Peter Barendse revised December 2010 Abstract In this paper we give a elementary proof explaining the phenomenon of band-splitting, first explained in [2,

More information

SUBCONTINUA OF FIBONACCI-LIKE INVERSE LIMIT SPACES.

SUBCONTINUA OF FIBONACCI-LIKE INVERSE LIMIT SPACES. SUBCONTINUA OF FIBONACCI-LIKE INVERSE LIMIT SPACES. H. BRUIN Abstract. We study the subcontinua of inverse limit spaces of Fibonacci-like unimodal maps. Under certain combinatorial constraints no other

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

INFINITY: CARDINAL NUMBERS

INFINITY: CARDINAL NUMBERS INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex

More information

arxiv: v2 [math.ds] 19 Jul 2012

arxiv: v2 [math.ds] 19 Jul 2012 arxiv:1107.2430v2 [math.ds] 19 Jul 2012 An algorithm to identify automorphisms which arise from self-induced interval exchange transformations Yann Jullian Abstract We give an algorithm to determine if

More information

PRIMES Math Problem Set

PRIMES Math Problem Set PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.

More information

New rotation sets in a family of toral homeomorphisms

New rotation sets in a family of toral homeomorphisms New rotation sets in a family of toral homeomorphisms Philip Boyland, André de Carvalho & Toby Hall Surfaces in São Paulo April, 2014 SP, 2014 p.1 Outline The rotation sets of torus homeomorphisms: general

More information

Correlation dimension for self-similar Cantor sets with overlaps

Correlation dimension for self-similar Cantor sets with overlaps F U N D A M E N T A MATHEMATICAE 155 (1998) Correlation dimension for self-similar Cantor sets with overlaps by Károly S i m o n (Miskolc) and Boris S o l o m y a k (Seattle, Wash.) Abstract. We consider

More information

LINEAR CHAOS? Nathan S. Feldman

LINEAR CHAOS? Nathan S. Feldman LINEAR CHAOS? Nathan S. Feldman In this article we hope to convience the reader that the dynamics of linear operators can be fantastically complex and that linear dynamics exhibits the same beauty and

More information

Mid Term-1 : Practice problems

Mid Term-1 : Practice problems Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to

More information

Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet

Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet Week # 1 Order of Operations Step 1 Evaluate expressions inside grouping symbols. Order of Step 2 Evaluate all powers. Operations Step

More information

INTERIOR COMPONENTS OF A TILE ASSOCIATED TO A QUADRATIC CANONICAL NUMBER SYSTEM

INTERIOR COMPONENTS OF A TILE ASSOCIATED TO A QUADRATIC CANONICAL NUMBER SYSTEM INTERIOR COMPONENTS OF A TILE ASSOCIATED TO A QUADRATIC CANONICAL NUMBER SYSTEM BENOIT LORIDANT AND JÖRG M. THUSWALDNER Abstract. Let α = 2 + 1 be a root of the polynomial p(x) = x 2 + 4x + 5. It is well

More information

SOME STRUCTURE THEOREMS FOR INVERSE LIMITS WITH SET-VALUED FUNCTIONS

SOME STRUCTURE THEOREMS FOR INVERSE LIMITS WITH SET-VALUED FUNCTIONS http://topology.auburn.edu/tp/ TOPOLOGY PROCEEDINGS Volume 42 (2013) Pages 237-258 E-Published on January 10, 2013 SOME STRUCTURE THEOREMS FOR INVERSE LIMITS WITH SET-VALUED FUNCTIONS M. M. MARSH Abstract.

More information

Classical transcendental curves

Classical transcendental curves Classical transcendental curves Reinhard Schultz May, 2008 In his writings on coordinate geometry, Descartes emphasized that he was only willing to work with curves that could be defined by algebraic equations.

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19 832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,

More information

Exact Devaney Chaos and Entropy

Exact Devaney Chaos and Entropy QUALITATIVE THEORY DYNAMICAL SYSTEMS 6, 169 179 (2005) ARTICLE NO. 95 Exact Devaney Chaos and Entropy Dominik Kwietniak Institute of Mathematics, Jagiellonian University, Reymonta 4, 30-059 Kraków, Poland

More information

Introduction to Group Theory

Introduction to Group Theory Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)

More information

Symbolic dynamics for Lozi maps

Symbolic dynamics for Lozi maps Symbolic dynamics for Lozi maps M. Misiurewicz, S. Štimac Abstract We study the family of the Lozi maps L a,b : R 2 R 2, L a,b (x, y) = (1+y a x, bx), and their strange attractors Λ a,b. We introduce the

More information

ON THE SET OF PERIODS OF SIGMA MAPS OF DEGREE 1. Sylvie Ruette. (Communicated by Sylvain Crovisier)

ON THE SET OF PERIODS OF SIGMA MAPS OF DEGREE 1. Sylvie Ruette. (Communicated by Sylvain Crovisier) DISCRETE AND CONTINUOUS doi:1.3934/dcds.215.35.4683 DYNAMICAL SYSTEMS Volume 35, Number 1, October 215 pp. 4683 4734 ON THE SET O PERIODS O SIGMA MAPS O DEGREE 1 Lluís Alsedà Departament de Matemàtiques,

More information

Problems for Putnam Training

Problems for Putnam Training Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,

More information

Math 105A HW 1 Solutions

Math 105A HW 1 Solutions Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S

More information

SOME ASPECTS OF TOPOLOGICAL TRANSITIVITY A SURVEY

SOME ASPECTS OF TOPOLOGICAL TRANSITIVITY A SURVEY 3 SOME ASPECTS OF TOPOLOGICAL TRANSITIVITY A SURVEY SERGIĬ KOLYADA Institute of Mathematics, Ukrainian Academy of Sciences Tereschenkivs ka 3, 252601 Kiev, Ukraine L UBOMÍR SNOHA Department of Mathematics,

More information

Math General Topology Fall 2012 Homework 8 Solutions

Math General Topology Fall 2012 Homework 8 Solutions Math 535 - General Topology Fall 2012 Homework 8 Solutions Problem 1. (Willard Exercise 19B.1) Show that the one-point compactification of R n is homeomorphic to the n-dimensional sphere S n. Note that

More information

Rotation set for maps of degree 1 on sun graphs. Sylvie Ruette. January 6, 2019

Rotation set for maps of degree 1 on sun graphs. Sylvie Ruette. January 6, 2019 Rotation set for maps of degree 1 on sun graphs Sylvie Ruette January 6, 2019 Abstract For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for

More information

Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015

Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015 Math 30-: Final Exam Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A closed and bounded subset of C[0, 1] which is

More information

arxiv: v2 [math.co] 30 Jun 2013

arxiv: v2 [math.co] 30 Jun 2013 A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation

More information

A. Incorrect! Apply the rational root test to determine if any rational roots exist.

A. Incorrect! Apply the rational root test to determine if any rational roots exist. College Algebra - Problem Drill 13: Zeros of Polynomial Functions No. 1 of 10 1. Determine which statement is true given f() = 3 + 4. A. f() is irreducible. B. f() has no real roots. C. There is a root

More information

Regular graphs with a small number of distinct eigenvalues

Regular graphs with a small number of distinct eigenvalues Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular

More information

Math Solutions to homework 5

Math Solutions to homework 5 Math 75 - Solutions to homework 5 Cédric De Groote November 9, 207 Problem (7. in the book): Let {e n } be a complete orthonormal sequence in a Hilbert space H and let λ n C for n N. Show that there is

More information

Math 190: Fall 2014 Homework 4 Solutions Due 5:00pm on Friday 11/7/2014

Math 190: Fall 2014 Homework 4 Solutions Due 5:00pm on Friday 11/7/2014 Math 90: Fall 04 Homework 4 Solutions Due 5:00pm on Friday /7/04 Problem : Recall that S n denotes the n-dimensional unit sphere: S n = {(x 0, x,..., x n ) R n+ : x 0 + x + + x n = }. Let N S n denote

More information

The Mandelbrot Set. Andrew Brown. April 14, 2008

The Mandelbrot Set. Andrew Brown. April 14, 2008 The Mandelbrot Set Andrew Brown April 14, 2008 The Mandelbrot Set and other Fractals are Cool But What are They? To understand Fractals, we must first understand some things about iterated polynomials

More information

Notes for Science and Engineering Foundation Discrete Mathematics

Notes for Science and Engineering Foundation Discrete Mathematics Notes for Science and Engineering Foundation Discrete Mathematics by Robin Whitty BSc PhD CMath FIMA 2009/2010 Contents 1 Introduction 1 1.1 The Laws of Arithmetic....................... 2 2 Polynomial

More information

Substitutions, Rauzy fractals and Tilings

Substitutions, Rauzy fractals and Tilings Substitutions, Rauzy fractals and Tilings Anne Siegel CANT, 2009 Reminder... Pisot fractals: projection of the stair of a Pisot substitution Self-replicating substitution multiple tiling: replace faces

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Articles HIGHER BLOCK IFS 2: RELATIONS BETWEEN IFS WITH DIFFERENT LEVELS OF MEMORY

Articles HIGHER BLOCK IFS 2: RELATIONS BETWEEN IFS WITH DIFFERENT LEVELS OF MEMORY Fractals, Vol. 8, No. 4 (200) 399 408 c World Scientific Publishing Company DOI: 0.42/S028348X0005044 Articles Fractals 200.8:399-408. Downloaded from www.worldscientific.com HIGHER BLOCK IFS 2: RELATIONS

More information

SHADOWING, ENTROPY AND MINIMAL SUBSYSTEMS

SHADOWING, ENTROPY AND MINIMAL SUBSYSTEMS SHADOWING, ENTROPY AND MINIMAL SUBSYSTEMS T.K. SUBRAHMONIAN MOOTHATHU AND PIOTR OPROCHA Abstract. We consider non-wandering dynamical systems having the shadowing property, mainly in the presence of sensitivity

More information

Math 215B: Solutions 1

Math 215B: Solutions 1 Math 15B: Solutions 1 Due Thursday, January 18, 018 (1) Let π : X X be a covering space. Let Φ be a smooth structure on X. Prove that there is a smooth structure Φ on X so that π : ( X, Φ) (X, Φ) is an

More information

arxiv: v6 [math.gt] 8 May 2017

arxiv: v6 [math.gt] 8 May 2017 RECTANGLE CONDITION AND ITS APPLICATIONS BO-HYUN KWON arxiv:404.765v6 [math.gt] 8 May 07 Abstract. In this paper, we define the rectangle condition on the bridge sphere for a n-bridge decomposition of

More information

Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.

Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another. Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation

More information