codings of rotations are full
play

Codings of rotations are full A. Blondin Mass e S. Brlek S. Labb - PowerPoint PPT Presentation

Sep 03, 2022 •251 likes •943 views

Codings of rotations are full A. Blondin Mass e S. Brlek S. Labb e L. Vuillon Universit e du Qu ebec ` a Montr eal EUROCOMB 2009 September 11th, 2009 e et al. (UQ` Blondin Mass AM, U. Savoie) Codings of rotations are

  1. Codings of rotations are full A. Blondin Mass´ e S. Brlek S. Labb´ e L. Vuillon Universit´ e du Qu´ ebec ` a Montr´ eal EUROCOMB 2009 September 11th, 2009 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 1 / 15

  2. Palindromes L L L R R R L ressasser tenet r reconocer d r r kisik d r e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 2 / 15

  3. The Fibonacci word We define f − 1 = b , f 0 = a and, for n ≥ 1, f n = f n − 1 f n − 2 . Therefore, we have f 0 = a f 1 = ab f 2 = aba f 3 = abaab f 4 = abaababa f 5 = abaababaabaab . . . . . . The infinite word f ∞ is called the Fibonacci word. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 3 / 15

  4. The Thue-Morse word We define t 0 = a and, for n ≥ 1, t n = t n − 1 t n − 1 . so that t 0 = a t 1 = ab t 2 = abba t 3 = abbabaab t 4 = abbabaabbaababba t 5 = abbabaabbaababbabaababbaabbabaab . . . . . . The infinite word t ∞ is called the Thue-Morse word. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 4 / 15

  5. Number of distinct palindromic factors Theorem (Droubay, Justin and Pirillo, 2001) Let w be a finite word. Then | Pal ( w ) | ≤ | w | + 1 . w = p q Assume that the first occurrence of some palindromes p and q ends at the same position. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 5 / 15

  6. Number of distinct palindromic factors Theorem (Droubay, Justin and Pirillo, 2001) Let w be a finite word. Then | Pal ( w ) | ≤ | w | + 1 . w = p q q Assume that the first occurrence of some palindromes p and q ends at the same position. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 5 / 15

  7. Number of distinct palindromic factors Theorem (Droubay, Justin and Pirillo, 2001) Let w be a finite word. Then | Pal ( w ) | ≤ | w | + 1 . w = p q q Assume that the first occurrence of some palindromes p and q ends at the same position. Then p = q . e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 5 / 15

  8. Number of distinct palindromic factors Theorem (Droubay, Justin and Pirillo, 2001) Let w be a finite word. Then | Pal ( w ) | ≤ | w | + 1 . w = p q q Assume that the first occurrence of some palindromes p and q ends at the same position. Then p = q . Theorem (Droubay, Justin and Pirillo, 2001) Sturmian words are full, i.e. they realize the upper bound. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 5 / 15

  9. Palindromic complexity Number of palindrome factors Upper bound 500 Fibonacci word Thue-Morse word 400 300 200 100 Fixed point of a abb,b ba Length of prefix 100 200 300 400 500 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 6 / 15

  10. The Fibonacci word is full w = a Palindromes a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  11. The Fibonacci word is full w = a b Palindromes a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  12. The Fibonacci word is full w = a b a Palindromes a b a b a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  13. The Fibonacci word is full w = a b a a Palindromes a b a b a a a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  14. The Fibonacci word is full w = a b a a b Palindromes a b a b a a a b a a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  15. The Fibonacci word is full w = a b a a b a Palindromes a b a b a a a b a a b a b a a b a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  16. The Fibonacci word is full w = a b a a b a b Palindromes a b a b a a a b a a b a b a a b a b a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  17. The Fibonacci word is full w = a b a a b a b a Palindromes a b a b a a a b a a b a b a a b a b a b a b a b a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  18. The Fibonacci word is full w = a b a a b a b a a · · · Palindromes a b a b a a a b a a b a b a a b a b a b a b a b a a a b a b a a ... e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 7 / 15

  19. The Thue-Morse word is lacunary w = a Palindromes a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  20. The Thue-Morse word is lacunary w = a b Palindromes a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  21. The Thue-Morse word is lacunary w = a b b Palindromes a b b b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  22. The Thue-Morse word is lacunary w = a b b a Palindromes a b b b a b b a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  23. The Thue-Morse word is lacunary w = a b b a b Palindromes a b b b a b b a b a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  24. The Thue-Morse word is lacunary w = a b b a b a Palindromes a b b b a b b a b a b a b a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  25. The Thue-Morse word is lacunary w = a b b a b a a Palindromes a b b b a b b a b a b a b a a a e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  26. The Thue-Morse word is lacunary w = a b b a b a a b Palindromes a b b b a b b a b a b a b a a a b a a b e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  27. The Thue-Morse word is lacunary w = a b b a b a a b b · · · Palindromes a b b b a b b a b a b a b a a a b a a b − ... There is no new palindrome at this position! e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 8 / 15

  28. Complete return words some occurrence next occurrence w = u u v We say that v is a complete return word of u in w , if v starts at an occurrence of u and ends at the end of the next occurrence of u . Fact A word w is full if and only if every complete return word of a palindrome factor of w is a palindrome. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 9 / 15

  29. Codings of rotations (1/2) The coding of rotations of parameters ( x , α, β ) is the word 0 C = c 0 c 1 c 2 · · · such that � β 0 if x + i α ∈ [0 , β ) c i = x 1 if x + i α ∈ [ β, 1) 1 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 10 / 15

  30. Codings of rotations (1/2) The coding of rotations of parameters ( x , α, β ) is the word 0 C = c 0 c 1 c 2 · · · such that � β 0 if x + i α ∈ [0 , β ) c i = x 1 if x + i α ∈ [ β, 1) x + α 11 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 10 / 15

  31. Codings of rotations (1/2) The coding of rotations of parameters ( x , α, β ) is the word 0 C = c 0 c 1 c 2 · · · such that � β 0 if x + i α ∈ [0 , β ) c i = x 1 if x + i α ∈ [ β, 1) x + 2 α x + α 111 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 10 / 15

  32. Codings of rotations (1/2) The coding of rotations of parameters ( x , α, β ) is the word 0 C = c 0 c 1 c 2 · · · such that � β 0 if x + i α ∈ [0 , β ) x + 3 α c i = x 1 if x + i α ∈ [ β, 1) x + 2 α x + α 1111 e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 10 / 15

  33. Codings of rotations (1/2) The coding of rotations of parameters ( x , α, β ) is the word 0 C = c 0 c 1 c 2 · · · such that � β 0 if x + i α ∈ [0 , β ) x + 3 α c i = x 1 if x + i α ∈ [ β, 1) x + 2 α x + α 11111000000111 · · · e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 10 / 15

  34. Codings of rotations (2/2) Many interesting problems related to codings of rotations: Density of the letters 0 and 1, Complexity, i.e. the number of factors of length n , or palindromic and f -palindromic complexity, Applications to number theory [Adamczewski, 2002], etc. In particular, Rote (1994) expressed sequences of complexity 2 n with respect to codings of rotations. e et al. (UQ` Blondin Mass´ AM, U. Savoie) Codings of rotations are full EUROCOMB 2009 11 / 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Some Observations on Reusing One-Time Pads within Dice Codings 1 Sebastian Pape, Databases and

Some Observations on Reusing One-Time Pads within Dice Codings 1 Sebastian Pape, Databases and

10. Kryptotag Sebastian Pape Some Observations on Reusing One-Time Pads within Dice Codings 1 Sebastian Pape, Databases and Interactive Systems Research Group Overview Dice Codings Invalid Keys Attacking the Key Pad

312 views • 20 slides
/ AVL trees and rotations This week, you should be able to perform rotations on

/ AVL trees and rotations This week, you should be able to perform rotations on

1/8/2018 / AVL trees and rotations This week, you should be able to perform rotations on height-balanced trees, on paper and in code write a rotate() method search for the kth item in-order using rank Term project partners

139 views • 9 slides
/ AVL trees and rotations This week, you should be able to perform rotations on

/ AVL trees and rotations This week, you should be able to perform rotations on

/ AVL trees and rotations This week, you should be able to perform rotations on height-balanced trees, on paper and in code write a rotate() method search for the kth item in-order using rank Term project partners posted

459 views • 22 slides
/ AVL trees and rotations This week, you should be able to perform rotations on

/ AVL trees and rotations This week, you should be able to perform rotations on

/ AVL trees and rotations This week, you should be able to perform rotations on height-balanced trees, on paper and in code write a rotate() method search for the kth item in-order using rank } Term project partners posted

365 views • 19 slides
/ AVL trees and rotations This week, you should be able to perform rotations on height

/ AVL trees and rotations This week, you should be able to perform rotations on height

/ AVL trees and rotations This week, you should be able to perform rotations on height -balanced trees, on paper and in code write a rotate() method search for the kth item in-order using rank Tests back later Mini-test next

231 views • 19 slides
/ AVL trees and rotations This week, you should be able to perform rotations on height

/ AVL trees and rotations This week, you should be able to perform rotations on height

/ AVL trees and rotations This week, you should be able to perform rotations on height -balanced trees, on paper and in code write a rotate() method search for the kth item in-order using rank See schedule page Consider an

403 views • 18 slides
12.1 Quaternions and Rotations Hao Li http://cs420.hao-li.com 1 Rotations Very important in

12.1 Quaternions and Rotations Hao Li http://cs420.hao-li.com 1 Rotations Very important in

Fall 2017 CSCI 420 Computer Graphics 12.1 Quaternions and Rotations Hao Li http://cs420.hao-li.com 1 Rotations Very important in computer animation and robotics Joint angles, rigid body orientations, camera parameters 2D

541 views • 31 slides
12.1 Quaternions and Rotations Kyle Morgenroth http://cs420.hao-li.com 1 Rotations Very

12.1 Quaternions and Rotations Kyle Morgenroth http://cs420.hao-li.com 1 Rotations Very

Fall 2018 CSCI 420 Computer Graphics 12.1 Quaternions and Rotations Kyle Morgenroth http://cs420.hao-li.com 1 Rotations Very important in computer animation and robotics Joint angles, rigid body orientations, camera

590 views • 31 slides
Rotations & Switches Rotations Terms to know Open low Top Side Close Ball

Rotations & Switches Rotations Terms to know Open low Top Side Close Ball

Rotations & Switches Rotations Terms to know Open low Top Side Close Ball Lines 45 degrees-shoulders Move to referee-STAND STILL TO MAKE DECISIONS Referee first-Rotate later Position Basics CENTER-free

488 views • 27 slides
CS 225 Data Structures Oct. 13 AVL Rotations BST Reflection We know the height of a tree. We

CS 225 Data Structures Oct. 13 AVL Rotations BST Reflection We know the height of a tree. We

CS 225 Data Structures Oct. 13 AVL Rotations BST Reflection We know the height of a tree. We know if a tree is full , complete , and/or perfect . We know that every binary tree has ________ NULL pointers. We know many traversals of trees. We

374 views • 16 slides
Section 5.5 Complex Eigenvalues Motivation: Describe rotations Among transformations, rotations

Section 5.5 Complex Eigenvalues Motivation: Describe rotations Among transformations, rotations

Section 5.5 Complex Eigenvalues Motivation: Describe rotations Among transformations, rotations are very simple to describe geometrically. Where are the eigenvectors? A no nonzero vector x is collinear with Ax The corresponding matrix has no

529 views • 15 slides
10 3D rotations and quaternions Steve Marschner CS5625 Spring 2019 Parameterizing rotations

10 3D rotations and quaternions Steve Marschner CS5625 Spring 2019 Parameterizing rotations

10 3D rotations and quaternions Steve Marschner CS5625 Spring 2019 Parameterizing rotations Euler angles rotate around x, then y, then z nice and simple R ( x , y , z ) = R z ( z ) R y ( y ) R x ( x )

484 views • 34 slides
CS-184: Computer Graphics Lecture #5: 3D Transformations and Rotations Prof. James OBrien

CS-184: Computer Graphics Lecture #5: 3D Transformations and Rotations Prof. James OBrien

CS-184: Computer Graphics Lecture #5: 3D Transformations and Rotations Prof. James OBrien University of California, Berkeley V2013-F-05-1.0 1 Today Transformations in 3D Rotations Matrices Euler angles Exponential maps

508 views • 21 slides
Rotations Angharad Ratliff, PharmD, BCPS,BCCCP Clinical Assistant Professor UAA/ISU College of

Rotations Angharad Ratliff, PharmD, BCPS,BCCCP Clinical Assistant Professor UAA/ISU College of

Creating Excellent Student Rotations Angharad Ratliff, PharmD, BCPS,BCCCP Clinical Assistant Professor UAA/ISU College of Pharmacy Alaska Regional Hospital Objectives Appropriately categorize learning activities for IPPE rotations

312 views • 19 slides
AVL trees BST rotations AVL introduction February 26, 2020 Cinda Heeren / Andy Roth / Geoffrey

AVL trees BST rotations AVL introduction February 26, 2020 Cinda Heeren / Andy Roth / Geoffrey

AVL trees BST rotations AVL introduction February 26, 2020 Cinda Heeren / Andy Roth / Geoffrey Tien 1 Rotations An item must be inserted into a BST at the correct position The shape of a tree is determined by The values of the

570 views • 27 slides
Understanding Rotations Jim Van Verth Senior Engine Programmer, Insomniac Games

Understanding Rotations Jim Van Verth Senior Engine Programmer, Insomniac Games

Understanding Rotations Jim Van Verth Senior Engine Programmer, Insomniac Games jim@essentialmath.com Introductions. Name a little misleading, as truly understanding rotations would require a deep understanding of group theory, which I

1.43k views • 119 slides
Circular Coinduction A Proof Theoretical Foundation su 1 Dorel Lucanu 2 Grigore Ro 1

Circular Coinduction A Proof Theoretical Foundation su 1 Dorel Lucanu 2 Grigore Ro 1

Circular Coinduction A Proof Theoretical Foundation su 1 Dorel Lucanu 2 Grigore Ro 1 Department of Computer Science University of Illinois at Urbana-Champaign, USA grosu@illinois.edu 2 Faculty of Computer Science Alexandru Ioan Cuza

506 views • 26 slides
Block-Level Relaxation for Timing-Robust Asynchronous Circuits Based on Eager Evaluation Cheolj

Block-Level Relaxation for Timing-Robust Asynchronous Circuits Based on Eager Evaluation Cheolj

Block-Level Relaxation for Timing-Robust Asynchronous Circuits Based on Eager Evaluation Cheolj oo Jeong* S teven M. Nowick Computer S cience Department Columbia University *[now at Cadence Design S ystems] Outline 1. Introduction

766 views • 54 slides
Policy Exploration for JITDs (Java) Team Datum Recap Experimentation on current policies

Policy Exploration for JITDs (Java) Team Datum Recap Experimentation on current policies

Policy Exploration for JITDs (Java) Team Datum Recap Experimentation on current policies against Zipfian distribution Cracking vs Adaptive Merge vs Swap Current target Workload : Zipfian Read Heavy Workload Answer High-Probable

437 views • 18 slides
Social Network Games Krzysztof R. Apt CWI & and University of Amsterdam Joint work with

Social Network Games Krzysztof R. Apt CWI & and University of Amsterdam Joint work with

Social Network Games Krzysztof R. Apt CWI & and University of Amsterdam Joint work with Sunil Simon A Caveat A story should have a beginning, a middle and an end, but not necessarily in that order. Jean-Luc Godard Krzysztof R. Apt

972 views • 65 slides
Dendric words and dendric subshifts Paulina CECCHI B . (Joint work with Val e ) erie Berth

Dendric words and dendric subshifts Paulina CECCHI B . (Joint work with Val e ) erie Berth

Dendric words and dendric subshifts Paulina CECCHI B . (Joint work with Val e ) erie Berth Institute de Recherche en Informatique Fondamentale Universit e Paris Diderot - Paris 7 Departamento de Matem atica y Ciencia de la Computaci

1.31k views • 99 slides
r rts rtrst

r rts rtrst

r rts rtrst s t r sttt r rt

534 views • 19 slides
What is a mathematician? What do I do? Teaching & Service Research How did I get Lara

What is a mathematician? What do I do? Teaching & Service Research How did I get Lara

What is a mathemati- cian? Lara Pudwell What is a mathematician? What do I do? Teaching & Service Research How did I get Lara Pudwell here? High School Assistant Professor of Mathematics and Computer Science College Graduate

1.02k views • 67 slides
in Lambda Calculus with letrec (Work In Progress) Jan Rochel and Clemens Grabmayer Dept. of

in Lambda Calculus with letrec (Work In Progress) Jan Rochel and Clemens Grabmayer Dept. of

Avoiding Repetitive Reduction Patterns in letrec Rochel, Grabmayer 1 Avoiding Repetitive Reduction Patterns in Lambda Calculus with letrec (Work In Progress) Jan Rochel and Clemens Grabmayer Dept. of Computer Science, and Dept. of

1.12k views • 83 slides

More recommend