Notes on Rauzy Fractals
|
|
- Marybeth Carson
- 5 years ago
- Views:
Transcription
1 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 infinite words generated in algebraic or combinatorial way. 1 Backgrounds on Symbolic Dynamics An alphabet A is a finite set of letters. A word is a finite sequence of letters. Denote the set of words by A +. For a word u = u 1 u 2 u n A +, u is called the length of u. For each letter a, we denote by u a the number of occurrence of a in u. Full Shifts. Let A Z be the set of all biinfinite sequences of alphabets from A, i.e. A Z = {x = (x i ) i Z : x i A, i Z}. Consider a shifting operator σ : A Z A Z given by σ(x) n = x n+1. We call the dynamical system (A Z, σ) a full shift. The full shift endowed with the product topology on A Z. Two elements x, y A Z are regarded as close if they agree on a large block: x [ n,n] = y [ n,n] for some large n. Substitutions. Let A be an alphabet consisting of at least 2 letters. A substitution on A is a map σ : A A +. The map σ can be iterated, and σ k : A A + is again a substitution. 2 Geometric Construction of the Fibonacci Word Let A = {a, b} and a substitution σ : a ab, b a. Starting with the word a, we obtain a sequence of words {w n } n 0 w 0 = a, w 1 = ab, w 2 = aba, w 3 = abaab,. The length of the words are Fibonacci numbers (this is because w n = w n a + w n b. Since w n a = w n 1 and w n b = w n 1 a = w n 2 ). w n a φ = w n b 2 Moreover, the word w n is a prefix of the next one. 1
2 Definition 2.1. A point is periodic if σ d (a) = a.... A Fibonacci word is the infinite word abaab... that is fixed under σ. A Geometric Representation. We want to embed the Fibonacci word in a subspace of R n. Every a (resp. b) gives a step to the right (1, 0) (resp. a step up (0, 1)) (See Figure 1). The path has asymptotic slope 1/φ. Figure 1: Geometric construction of the Fibonacci word Let M be the associated matrix given by the substitution ( ) 1 1 M =. 1 0 The matrix M has one expanding direction (φ, 1) associated with eigenvalue φ and one contracting direction (1, 1 1φ ) with eigenvalue 1/φ = Therefore, the points associated with the finite Fibonacci words σ n (a) tend to the expanding space. More generally, any initial word U of the infinite Fibonacci word is of the format U = σ k (i k ) σ(i 1 )i 0, for i n {, a}. e.g. σ 4 (a) = abaababa = σ 3 (a)σ(a)a. The corresponding coordinates of U are finite sums and they are bounded by a geometric series whose ratio are eigenvalues of M. Therefore, the points U of the Fibonacci word are convergent in the contracting direction. The vertices of the path must lie in a bounded distance of the expanding direction. We can draw a corridor by sliding the unit square with upper right corner at the origin along the expanding direction, the path lies within this corridor and is determined by it. Therefore, we can recover the Fibonacci sequence by this corridor: its nth letter is an a (resp. b) if [(n + 1)/φ] [n/φ] is equal to 1 (resp. 0). Dynamical Interpretation. We can shift the Fibonacci word by erasing its first letter. If we consider the closure of the shift-orbit for the natural topology on infinite words, we get a symbolic dynamical system. This set projects continuously to the interval, and the projection conjugates the shift to the rotation by φ. 2
3 This can be seen on the window, which is divided into two intervals corresponding to the two letters; the point corresponding to the next vertex of the path is obtained by exchanging two intervals. This translation of intervals corresponds to the step to the right or up associated with each letter. 3 Rauzy Fractals Let σ be the substitution σ : 1 12, 2 13, 3 1. Consider the iteration of σ on the letter a. We have 1, 12, 1213, ,. The limit σ (a) is a fixed point of the substitution. 3.1 Primitive Subsutitution. Definition 3.1. A substitution σ is primitive if there exists k such that all letters appears in the image of all letters through σ k. For example, σ(1) = 12, σ(2) = 32, σ(3) = 23 is not primitive. There arises a natural question: how to know a substitution is primitive? Proposition 3.2. Let M be an incidence matrix. A substitution σ is primitive iff there exists a k > 0 such that M k has only positive coefficients. Example 3.3. Let σ(1) = 12, σ(2) = 13, σ(3) = 1 and M be the incidence matrix Since M 3 > 0, the substitution σ is primitive. Example 3.4. The substitution σ(1) = 12, σ2 = 32 and σ(3) = 23 is not primitive, since M n always has zeros in the first line where M the incidence matrix M = Geometric Interpretation of a Fixed Point Let P be a linear map taking letters to n independent vectors e 1,, e n. P : w 1 w k A + e w1 + + e wk R n. Theorem 3.5 (Commutation Formula). P (σ(w )) = MP (W ). 3
4 Figure 2: Geometric interpretation for Piscot Case When the incidence matrix M has one expanding eigenvalue β and all other eigenvalues β (i) are contracting. We say the substitution σ of Piscot type. Let σ be a substitution of Pisot type on a n letter-alphabet. Suppose H e is the expanding line of M and H c is the contracting plane of M. Let π : R n H c be the projection along H e. Then h = πm is a contraction on the hyperplane H c. It follows that the projection of P (σ(w )) is smaller than P (W ). Proposition 3.6. If σ is of Piscot type, then the stair of any periodic point remains at a finite distance from the expanding line. Proof. 1. Let the word u 0 u k be a periodic point fixed by σ d. σ d (u 0 u l ) u 0 u k < σ d (u 0 u l+1 ) 2. There exists a prefix p 0 of σ d (u l ) such that u 0 u k = σ d (u 0 u l )p 0, σ d (u l ) = p 0 u k+1 s 3. Iterate this decomposition u 0 u k = σ d (u 0 u l )p 0 = σ d (σ d (p 2 )p 1 )p 0 = σ dn p N σ N 1 (p N 1 ) σ d (p 1 )p Linearize: πp (u 0 u k ) = h dn P (p N ) + h d(n 1) P (p n 1 ) + h d P (p 1 ) + P (p 0 ) 5. Since h is a contraction and p k s are in finite number, the projections of the stair along the expanding line are bounded. 4
5 Figure 3: The projection of stairs 3.4 Rauzy Fractal A Rauzy fractal (central tile) is the closure of the image under the projection of the nodes in the stair to the contraction plane, i.e. We set for each i A T = {π P (u 0 u N 1 ) N N}. T (i) = {π P (u 0 u N 1 ) N N, u N = i}. Figure 4: The central tile and its subtitles for the Tribonacci substitution Theorem 3.7. Let σ be a unit Pisot irreducible substitution. The central tile T and the subtiles T (i) are compact sets. Proof. The boundness of the subtiles T (i) is a direct consequence of the compactness of T, since they are closed subsets of T σ. To prove the compactness of T, it is sufficient to show that the points π P (u 0 u N 1 ) remain at a uniformly bounded distance of the origin in H c. We have shown this by the previous theorem. 3.5 Decomposition Definition 3.8. Given a collection of finitely many compact sets {K 1,, K q }. Each set K i can be decomposed as a union of contracted copies of itself and the other sets K j. We associated these relations with a natural graph G: 1. the vertices is given by {K i : 1 i q} 5
6 2. there is an edge e from K i to K j if the there is a contraction τ e such that τ e (K j ) K i. We call (G, {τ e } e E ) a graph-directed iterated function system (GIFS). By a fixed point argument that given a GIFS (G, {τ e } e E ) there exists a unique collection of non-empty compact sets K 1,, K q R n K i = τ e (K j ) i j where the union runs over all edges in G (see [1]). We apply this GIFS to the the subtiles T (i) which we call prefix-suffix graph which is given by the formula: i j iff σ(j) = pis. An edge from the vertex i to j is labeled by (p, i, s) A + A A + such that σ(j) = pis. Figure 5: The prefix-suffix graph for σ(1) = 12, σ(2) = 13, σ(3) = 1 Consider the substituion σ(1) = 12, σ(2) = 13 and σ(3) = 1. The map h = πm is a contraction on the hyperplane H c of angle 2/3. We have a decomposition of each tiles: T (1) = ht (1) ht (2) ht (3). T (2) = ht (1) + πp (1), T (3) = ht (2) + πp (1). Theorem 3.9. T (i) = ht (j) + πp (p). j A, i j Proof. Fix i A and assume that u k = i. By definition π P (u 0 u k 1 ) T (i). By previous argument, there exist L and a decomposition of σ(σ l ) as σ(u l ) = pu k s = pis such that P (u 0 u k 1 ) = h π P (u 0 u l 1 ) + π P (p), thus P (u 0 u k 1 ) h(t (u l )) + π P (p). This is true for each N with u N = i, T (i) = h(t (j)) + π P (p). (p,i,s),σ(j)=pis 6
7 To show the disjointness, it is sufficient to show that βµ(t (i)) = j A m ij µ(t (j)) where β is the dominant eigenvalue of the incident matrix M. By measure theory, we know that βµ(t (i)) j A m ij µ(t (j)). The reverse sign is given by the Perron-Frobenius theorem: Assume that M is a matrix with positive entries. Let β be its dominant eigenvalue. Let v be a vector with positive entries. Then we have Mv βv. The equality holds only when v is a dominant eigenvector of M. It follows that the pieces are disjoint in the decomposition of each subtile. Now, we want to know that if the subtitles are disjoint. Definition A substitution σ over the alphabet A satisfies strong coincidence condition if for every (j 1, j 2 ) A 2, we have with P (p 1 ) = P (p 2 ) or P (s 1 ) = P (s 2 ). σ k (j 1 ) = p 1 is 1 σ k (j 2 ) = p s is 2 Theorem If σ satisfies the strong coincidence condition, then the subtile T (i) of the central tile T have disjoint interiors. Proof. The pieces ht (j 1 )+P (p 1 ) and ht (j 2 )+P (p 2 ) both appear in the GIFS decomposition of T (i). References [1] D. Mauldin, and S. Williams. Hausdorff dimension in graph directed constructions. Transactions of the AMS, Vol. 309, No.2,
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 information5 Substitutions, Rauzy fractals, and tilings
5 Substitutions, Rauzy fractals, and tilings V. Berthé LIRMM - Université Montpelier II - CNRS UMR 5506 161 rue Ada, F-34392 Montpellier cedex 5, France A. Siegel CNRS - Université Rennes 1- INRIA, IRISA
More informationS-adic sequences A bridge between dynamics, arithmetic, and geometry
S-adic sequences A bridge between dynamics, arithmetic, and geometry J. M. Thuswaldner (joint work with P. Arnoux, V. Berthé, M. Minervino, and W. Steiner) Marseille, November 2017 PART 3 S-adic Rauzy
More informationGEOMETRICAL MODELS FOR SUBSTITUTIONS
GEOMETRICAL MODELS FOR SUBSTITUTIONS PIERRE ARNOUX, JULIEN BERNAT, AND XAVIER BRESSAUD Abstract. We consider a substitution associated with the Arnoux-Yoccoz Interval Exchange Transformation (IET) related
More informationFRACTAL REPRESENTATION OF THE ATTRACTIVE LAMINATION OF AN AUTOMORPHISM OF THE FREE GROUP
FRACTAL REPRESENTATION OF THE ATTRACTIVE LAMINATION OF AN AUTOMORPHISM OF THE FREE GROUP PIERRE ARNOUX, VALÉRIE BERTHÉ, ARNAUD HILION, AND ANNE SIEGEL Abstract. In this paper, we extend to automorphisms
More informationAnne Siegel Jörg M. Thuswaldner TOPOLOGICAL PROPERTIES OF RAUZY FRACTALS
Anne Siegel Jörg M. Thuswaldner TOPOLOGICAL PROPERTIES OF RAUZY FRACTALS A. Siegel IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France. E-mail : Anne.Siegel@irisa.fr J. M. Thuswaldner Chair of Mathematics
More informationS-adic sequences A bridge between dynamics, arithmetic, and geometry
S-adic sequences A bridge between dynamics, arithmetic, and geometry J. M. Thuswaldner (joint work with P. Arnoux, V. Berthé, M. Minervino, and W. Steiner) Marseille, November 2017 REVIEW OF PART 1 Sturmian
More informationTOPOLOGICAL PROPERTIES OF A CLASS OF CUBIC RAUZY FRACTALS
Loridant, B. Osaka J. Math. 53 (2016), 161 219 TOPOLOGICAL PROPERTIES OF A CLASS OF CUBIC RAUZY FRACTALS BENOÎT LORIDANT (Received September 11, 2014, revised December 4, 2014) Abstract We consider the
More informationGeometrical Models for Substitutions
Geometrical Models for Substitutions Pierre Arnoux, Julien Bernat, Xavier Bressaud To cite this version: Pierre Arnoux, Julien Bernat, Xavier Bressaud. Geometrical Models for Substitutions. Experimental
More information#A2 INTEGERS 11B (2011) MULTIDIMENSIONAL EUCLIDEAN ALGORITHMS, NUMERATION AND SUBSTITUTIONS
#A2 INTEGERS 11B (2011) MULTIDIMENSIONAL EUCLIDEAN ALGORITHMS, NUMERATION AND SUBSTITUTIONS Valerie Berthé Laboratoire d Informatique Algorithmique : Fondements et Applications Université Paris Diderot,
More informationTo appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.
To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? DE-JUN FENG, SU HUA, AND YUAN JI Abstract. Let U λ be the union of two unit intervals
More informationPisot conjecture and Tilings
Pisot conjecture and Tilings Shigeki Akiyama (Niigata University, Japan) (, ) 6 July 2010 at Guangzhou Typeset by FoilTEX Typeset by FoilTEX 1 A Pisot number is an algebraic integer > 1 such that all conjugates
More informationSUBSTITUTIONS. Anne Siegel IRISA - Campus de Beaulieu Rennes Cedex - France.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(3) (2005), #A02 TILINGS ASSOCIATED WITH BETA-NUMERATION AND SUBSTITUTIONS Valérie Berthé 1 LIRMM - 161 rue Ada -34392 Montpellier Cedex 5-
More informationWhat is Pisot conjecture?
What is Pisot conjecture? Shigeki Akiyama (Niigata University, Japan) 11 June 2010 at Leiden Typeset by FoilTEX Let (X, B, µ) be a probability space and T : X X be a measure preserving transformation.
More informationPisot Substitutions and Rauzy fractals
Pisot Substitutions and Rauzy fractals Pierre Arnoux Shunji Ito Abstract We prove that the dynamical system generated by a primitive unimodular substitution of the Pisot type on d letters satisfying a
More informationProof: 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 informationLecture 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 informationOne-sided shift spaces over infinite alphabets
Reasoning Mind West Coast Operator Algebra Seminar October 26, 2013 Joint work with William Ott and Mark Tomforde Classical Construction Infinite Issues New Infinite Construction Shift Spaces Classical
More informationTribonacci aperiodic tiling as a SFT
Tribonacci aperiodic tiling as a SFT Pytheas FOGG Document de travail April, 009 Abstract We give an aperiodic set of tiles for which the tilings of the plane project onto the Tribonacci substitutive aperiodic
More informationExtensions naturelles des. et pavages
Extensions naturelles des bêta-transformations généralisées et pavages Wolfgang Steiner LIAFA, CNRS, Université Paris Diderot Paris 7 (travail en commun avec Charlene Kalle, Universiteit Utrecht, en ce
More informationMapping 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 informationbeta-numeration and Rauzy fractals for non-unit Pisot numbers
beta-numeration and Rauzy fractals for non-unit Pisot numbers Anne Siegel (Irisa, CNRS, Rennes) Kanazawa, June 05 Overview β-expansion: expand a positive real number in a non-integer Pisot basis β Represent
More informationMath 354 Transition graphs and subshifts November 26, 2014
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
More informationarxiv: v1 [math.ds] 6 May 2009
Symbolic coding for linear trajectories in the regular octagon John Smillie orinna Ulcigrai arxiv:0905.0871v1 [math.s] 6 May 2009 bstract We consider a symbolic coding of linear trajectories in the regular
More informationNon-Unimodularity. Bernd Sing. CIRM, 24 March Department of Mathematical Sciences. Numeration: Mathematics and Computer Science
Department of Mathematical Sciences CIRM, 24 March 2009 Numeration: Mathematics and Computer Science β-substitutions Let β > 1 be a PV-number (Pisot-number) and consider the greedy expansion to base β.
More informationAn Introduction to Entropy and Subshifts of. Finite Type
An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview
More informationON SUBSTITUTION INVARIANT STURMIAN WORDS: AN APPLICATION OF RAUZY FRACTALS
ON SUBSTITUTION INVARIANT STURMIAN WORDS: AN APPLICATION OF RAUZY FRACTALS V. BERTHÉ, H. EI, S. ITO AND H. RAO Abstract. Sturmian words are infinite words that have exactly n + 1 factors of length n for
More informationMultidimensional Euclid s algorithms, numeration and substitutions
Multidimensional Euclid s algorithms, numeration and substitutions V. Berthé LIAFA-CNRS-Paris-France berthe@liafa.jussieu.fr http ://www.liafa.jussieu.fr/~berthe Numeration Lorentz Center June 2010 Substitutions
More informationTilings, quasicrystals, discrete planes, generalized substitutions and multidimensional continued fractions
Tilings, quasicrystals, discrete planes, generalized substitutions and multidimensional continued fractions Pierre Arnoux and Valérie Berthé and Hiromi Ei and Shunji Ito Institut de Mathématiques de Luminy
More informationPERRON-FROBENIUS THEORY AND FREQUENCY CONVERGENCE FOR REDUCIBLE SUBSTITUTIONS
PERRON-FROBENIUS THEORY AND FREQUENCY CONVERGENCE FOR REDUCIBLE SUBSTITUTIONS MARTIN LUSTIG AND CAGLAR UYANIK Abstract. We prove a general version of the classical Perron-Frobenius convergence property
More informationTopology Final Exam. Instructor: W. D. Gillam Date: January 15, 2014
Topology Final Exam Instructor: W. D. Gillam Date: January 15, 2014 Instructions: Print your name and Topology Final Exam in the upper right corner of the first page. Also be sure to put your name in the
More informationarxiv: 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 informationBoundary of central tiles associated with Pisot beta-numeration and purely periodic expansions
Boundary of central tiles associated with Pisot beta-numeration and purely periodic expansions Shigeki Akiyama, Guy Barat, Valerie Berthe, Anne Siegel To cite this version: Shigeki Akiyama, Guy Barat,
More informationVíctor F. Sirvent 1 Departamento de Matemáticas, Universidad Simón Bolívar, Caracas, Venezuela
# A5 INTEGERS B (2) SYMMETRIES IN K-BONACCI ADIC SYSTEMS Víctor F. Sirvent Departamento de Matemáticas, Universidad Simón Bolívar, Caracas, Venezuela vsirvent@usb.ve Received: 9/2/, Revised: 3/7/, Accepted:
More informationATotallyDisconnectedThread: Some Complicated p-adic Fractals
ATotallyDisconnectedThread: Some Complicated p-adic Fractals Je Lagarias, University of Michigan Invited Paper Session on Fractal Geometry and Dynamics. JMM, San Antonio, January 10, 2015 Topics Covered
More informationOn Pisot Substitutions
On Pisot Substitutions Bernd Sing Department of Mathematics The Open University Walton Hall Milton Keynes, Buckinghamshire MK7 6AA UNITED KINGDOM b.sing@open.ac.uk Substitution Sequences Given: a finite
More informationGeometrical Models for Substitutions Pierre Arnoux a ; Julien Bernat b ; Xavier Bressaud c a
This article was downloaded by: [Arnoux, Pierre] On: 10 March 011 Access details: Access Details: [subscription number 934653803] Publisher Taylor & Francis Informa Ltd Registered in England and Wales
More informationSturmian Words, Sturmian Trees and Sturmian Graphs
Sturmian Words, Sturmian Trees and Sturmian Graphs A Survey of Some Recent Results Jean Berstel Institut Gaspard-Monge, Université Paris-Est CAI 2007, Thessaloniki Jean Berstel (IGM) Survey on Sturm CAI
More informationThe Hurewicz Theorem
The Hurewicz Theorem April 5, 011 1 Introduction The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors,
More informationTHE CLASSIFICATION OF TILING SPACE FLOWS
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLI 2003 THE CLASSIFICATION OF TILING SPACE FLOWS by Alex Clark Abstract. We consider the conjugacy of the natural flows on one-dimensional tiling
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: May 16, 2017 5 Review of Root Systems In this section, let us have a brief introduction to root system and finite Lie type classification
More informationSequence of maximal distance codes in graphs or other metric spaces
Electronic Journal of Graph Theory and Applications 1 (2) (2013), 118 124 Sequence of maximal distance codes in graphs or other metric spaces C. Delorme University Paris Sud 91405 Orsay CEDEX - France.
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationSemigroup invariants of symbolic dynamical systems
Semigroup invariants of symbolic dynamical systems Alfredo Costa Centro de Matemática da Universidade de Coimbra Coimbra, October 6, 2010 Discretization Discretization Discretization 2 1 3 4 Discretization
More informationEigenvectors Via Graph Theory
Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal
More informationRobustly transitive diffeomorphisms
Robustly transitive diffeomorphisms Todd Fisher tfisher@math.byu.edu Department of Mathematics, Brigham Young University Summer School, Chengdu, China 2009 Dynamical systems The setting for a dynamical
More informationCombinatorics On Sturmian Words. Amy Glen. Major Review Seminar. February 27, 2004 DISCIPLINE OF PURE MATHEMATICS
Combinatorics On Sturmian Words Amy Glen Major Review Seminar February 27, 2004 DISCIPLINE OF PURE MATHEMATICS OUTLINE Finite and Infinite Words Sturmian Words Mechanical Words and Cutting Sequences Infinite
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationC*-algebras associated with interval maps
C*-algebras associated with interval maps Valentin Deaconu and Fred Shultz Brazilian Operator Algebras Conference Florianópolis, July 24-28, 2006 For each piecewise monotonic map τ of [0, 1], we associate
More informationPalindromic complexity of infinite words associated with simple Parry numbers
Palindromic complexity of infinite words associated with simple Parry numbers Petr Ambrož (1)(2) Christiane Frougny (2)(3) Zuzana Masáková (1) Edita Pelantová (1) March 22, 2006 (1) Doppler Institute for
More informationINTERIOR 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 informationAN ABSTRACT OF THE DISSERTATION OF
AN ABSTRACT OF THE DISSERTATION OF David Josiah Wing for the degree of Doctor of Philosophy in Mathematics presented on March 3, 20 Title: Notions of Complexity in Substitution Dynamical Systems Abstract
More informationSection 1.7: Properties of the Leslie Matrix
Section 1.7: Properties of the Leslie Matrix Definition: A matrix A whose entries are nonnegative (positive) is called a nonnegative (positive) matrix, denoted as A 0 (A > 0). Definition: A square m m
More informationRepresentation theory & the Hubbard model
Representation theory & the Hubbard model Simon Mayer March 17, 2015 Outline 1. The Hubbard model 2. Representation theory of the symmetric group S n 3. Representation theory of the special unitary group
More informationCombinatorics of tilings
Combinatorics of tilings V. Berthé LIAFA-CNRS-Paris-France berthe@liafa.jussieu.fr http ://www.liafa.jussieu.fr/~berthe Substitutive tilings and fractal geometry-guangzhou-july 200 Tilings Definition Covering
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationThe matrix approach for abstract argumentation frameworks
The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationCOBHAM S THEOREM AND SUBSTITUTION SUBSHIFTS
COBHAM S THEOREM AND SUBSTITUTION SUBSHIFTS FABIEN DURAND Abstract. This lecture intends to propose a first contact with subshift dynamical systems through the study of a well known family: the substitution
More informationarxiv: v1 [math.co] 8 Feb 2014
COMBINATORIAL STUDY OF THE DELLAC CONFIGURATIONS AND THE q-extended NORMALIZED MEDIAN GENOCCHI NUMBERS ANGE BIGENI arxiv:1402.1827v1 [math.co] 8 Feb 2014 Abstract. In two recent papers (Mathematical Research
More informationFractal Tilings. Katie Moe and Andrea Brown. December 14, 2006
Fractal Tilings Katie Moe and Andrea Brown December 4, 26 Abstract In this paper we will discuss how to create fractal tilings from a few simple matrices and formulas. We will do this by drawing several
More informationEnumeration Schemes for Words Avoiding Permutations
Enumeration Schemes for Words Avoiding Permutations Lara Pudwell November 27, 2007 Abstract The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching
More informationPart II. Geometry and Groups. Year
Part II Year 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2014 Paper 4, Section I 3F 49 Define the limit set Λ(G) of a Kleinian group G. Assuming that G has no finite orbit in H 3 S 2, and that Λ(G),
More informationLECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES
LECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES 1. Proper actions Suppose G acts on M smoothly, and m M. Then the orbit of G through m is G m = {g m g G}. If m, m lies in the same orbit, i.e. m = g m for
More informationWANNIER TRANSFORM APERIODIC SOLIDS. for. Jean BELLISSARD. Collaboration:
WANNIER TRANSFORM for APERIODIC SOLIDS Jean BELLISSARD Georgia Institute of Technology, Atlanta School of Mathematics & School of Physics e-mail: jeanbel@math.gatech.edu Collaboration: G. DE NITTIS (SISSA,
More informationMath 730 Homework 6. Austin Mohr. October 14, 2009
Math 730 Homework 6 Austin Mohr October 14, 2009 1 Problem 3A2 Proposition 1.1. If A X, then the family τ of all subsets of X which contain A, together with the empty set φ, is a topology on X. Proof.
More informationLaplacians 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 informationBounded-rank tensors are defined in bounded degree. J. Draisma and J. Kuttler
Bounded-rank tensors are defined in bounded degree J. Draisma and J. Kuttler REPORT No. 15, 2010/2011, spring ISSN 1103-467X ISRN IML-R- -15-10/11- -SE+spring BOUNDED-RANK TENSORS ARE DEFINED IN BOUNDED
More informationIntroduction to Techniques for Counting
Introduction to Techniques for Counting A generating function is a device somewhat similar to a bag. Instead of carrying many little objects detachedly, which could be embarrassing, we put them all in
More informationarxiv: v2 [math.co] 24 Oct 2012
On minimal factorizations of words as products of palindromes A. Frid, S. Puzynina, L. Zamboni June 23, 2018 Abstract arxiv:1210.6179v2 [math.co] 24 Oct 2012 Given a finite word u, we define its palindromic
More informationELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS
ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS J. WARNER SUMMARY OF A PAPER BY J. CARLSON, E. FRIEDLANDER, AND J. PEVTSOVA, AND FURTHER OBSERVATIONS 1. The Nullcone and Restricted Nullcone We will need
More informationThe free group F 2, the braid group B 3, and palindromes
The free group F 2, the braid group B 3, and palindromes Christian Kassel Université de Strasbourg Institut de Recherche Mathématique Avancée CNRS - Université Louis Pasteur Strasbourg, France Deuxième
More informationON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD. A. M. Vershik, S. V. Kerov
ON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD A. M. Vershik, S. V. Kerov Introduction. The asymptotic representation theory studies the behavior of representations of large classical groups and
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/32076 holds various files of this Leiden University dissertation Author: Junjiang Liu Title: On p-adic decomposable form inequalities Issue Date: 2015-03-05
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationArithmetic properties of the adjacency matrix of quadriculated disks
Arithmetic properties of the adjacency matrix of quadriculated disks arxiv:math/00762v2 [mathco] 3 Aug 2003 Nicolau C Saldanha and Carlos Tomei December 22, 203 Abstract Let be a bicolored quadriculated
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationROOT SYSTEMS AND DYNKIN DIAGRAMS
ROOT SYSTEMS AND DYNKIN DIAGRAMS DAVID MEHRLE In 1969, Murray Gell-Mann won the nobel prize in physics for his contributions and discoveries concerning the classification of elementary particles and their
More informationEXAMENSARBETEN I MATEMATIK
EXAMENSARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Shift Spaces and Two Notions of Entropy av Gunnar Höglund 2007 - No 11 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET, 10691
More informationarxiv:math/ v1 [math.ds] 11 Sep 2003
A GENERALIZED BALANCED PAIR ALGORITHM arxiv:math/0309194v1 [math.ds] 11 Sep 003 BRIAN F. MARTENSEN Abstract. We present here a more general version of the balanced pair algorithm. This version works in
More informationREPRESENTATION 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 informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationSTURM NUMBERS AND SUBSTITUTION INVARIANCE OF 3IET WORDS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008, #A14 STURM NUMBERS AND SUBSTITUTION INVARIANCE OF 3IET WORDS Pierre Arnoux Institut de Mathématiques de Luminy, CNRS UPR 9016, 163,
More informationcorrelated to the Washington D.C. Public Schools Learning Standards Algebra I
correlated to the Washington D.C. Public Schools Learning Standards Algebra I McDougal Littell Algebra 1 2007 correlated to the Washington DC Public Schools Learning Standards Algebra I NUMBER SENSE AND
More informationFACTOR MAPS BETWEEN TILING DYNAMICAL SYSTEMS KARL PETERSEN. systems which cannot be achieved by working within a nite window. By. 1.
FACTOR MAPS BETWEEN TILING DYNAMICAL SYSTEMS KARL PETERSEN Abstract. We show that there is no Curtis-Hedlund-Lyndon Theorem for factor maps between tiling dynamical systems: there are codes between such
More informationCOUNTEREXAMPLES TO THE COARSE BAUM-CONNES CONJECTURE. Nigel Higson. Unpublished Note, 1999
COUNTEREXAMPLES TO THE COARSE BAUM-CONNES CONJECTURE Nigel Higson Unpublished Note, 1999 1. Introduction Let X be a discrete, bounded geometry metric space. 1 Associated to X is a C -algebra C (X) which
More informationMASTERS 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 informationRectilinear Polygon Exchange Transformations via Cut-and-Project Methods
Rectilinear Polygon Exchange Transformations via Cut-and-Project Methods Ren Yi (joint work with Ian Alevy and Richard Kenyon) Zero Entropy System, CIRM 1/39 Outline 1. Polygon Exchange Transformations
More informationTheoretical Computer Science
Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic September 22, 2017 Z. Sawa (TU Ostrava)
More informationThe Zorich Kontsevich Conjecture
The Zorich Kontsevich Conjecture Marcelo Viana (joint with Artur Avila) IMPA - Rio de Janeiro The Zorich Kontsevich Conjecture p.1/27 Translation Surfaces Compact Riemann surface endowed with a non-vanishing
More information#A36 INTEGERS 12 (2012) FACTOR FREQUENCIES IN LANGUAGES INVARIANT UNDER SYMMETRIES PRESERVING FACTOR FREQUENCIES
#A36 INTEGERS 2 (202) FACTOR FREQUENCIES IN LANGUAGES INVARIANT UNDER SYMMETRIES PRESERVING FACTOR FREQUENCIES L ubomíra Balková Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering,
More informationIntroduction to mathematical quasicrystals
Introduction to mathematical quasicrystals F S W Alan Haynes Topics to be covered Historical overview: aperiodic tilings of Euclidean space and quasicrystals Lattices, crystallographic point sets, and
More informationMATH 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 informationThe L 3 (4) near octagon
The L 3 (4) near octagon A. Bishnoi and B. De Bruyn October 8, 206 Abstract In recent work we constructed two new near octagons, one related to the finite simple group G 2 (4) and another one as a sub-near-octagon
More informationThe Zeta Function of a Cyclic Language with Connections to Elliptic Curves and Chip-Firing Games
The Zeta Function of a Cyclic Language with Connections to Elliptic Curves and Chip-Firing Games University of California, San Diego March 14, 2007 University of California, San Diego Slide 1 OUTLINE I.
More information