Morphisms preserving the set of words coding three interval exchange

Tomáš Hejda

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2012)

  • Volume: 46, Issue: 1, page 107-122
  • ISSN: 0988-3754

Abstract

top
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.

How to cite

top

Hejda, Tomáš. "Morphisms preserving the set of words coding three interval exchange." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 46.1 (2012): 107-122. <http://eudml.org/doc/273079>.

@article{Hejda2012,
abstract = {Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.},
author = {Hejda, Tomáš},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {interval exchange; three interval exchange; amicable sturmian morphisms; incidence matrix of morphism; amicable Sturmian morphisms},
language = {eng},
number = {1},
pages = {107-122},
publisher = {EDP-Sciences},
title = {Morphisms preserving the set of words coding three interval exchange},
url = {http://eudml.org/doc/273079},
volume = {46},
year = {2012},
}

TY - JOUR
AU - Hejda, Tomáš
TI - Morphisms preserving the set of words coding three interval exchange
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2012
PB - EDP-Sciences
VL - 46
IS - 1
SP - 107
EP - 122
AB - Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.
LA - eng
KW - interval exchange; three interval exchange; amicable sturmian morphisms; incidence matrix of morphism; amicable Sturmian morphisms
UR - http://eudml.org/doc/273079
ER -

References

top
  1. [1] P. Ambrož, Z. Masáková and E. Pelantová, Matrices of 3-iet preserving morphisms. Theoret. Comput. Sci.400 (2008) 113–136. Zbl1161.68042
  2. [2] P. Ambrož, Z. Masáková and E. Pelantová, Morphisms fixing words associated with exchange of three intervals. RAIRO – Theor. Inf. Appl.44 (2010) 3–17. Zbl1186.68342MR2604932
  3. [3] P. Ambrož, A.E. Frid, Z. Masáková and E. Pelantová, On the number of factors in codings of three interval exchange. Discrete Math. Theoret. Comput. Sci.13 (2011) 51–66. Zbl1283.68274MR2854338
  4. [4] P. Arnoux, V. Berthé, Z. Masáková and E. Pelantová, Sturm numbers and substitution invariance of 3iet words. Integers 8 (2008) A14, 17. Zbl1202.11021MR2393372
  5. [5] J. Berstel, Recent results in Sturmian words, in Developments in language theory II. Magdeburg (1995). World Sci. Publ., River Edge, NJ (1996) 13–24. Zbl1096.68689MR1466181
  6. [6] J. Berstel and P. Séébold, Morphismes de sturm. Bull. Belg. Math. Soc.1 (1994) 175–189. Zbl0803.68095MR1318967
  7. [7] J. Cassaigne, Sequences with grouped factors, in Developments in language theory III. Aristotle University of Thessaloniki, Greece (1998) 211–222. 
  8. [8] E.M. Coven and G.A. Hedlund, Sequences with minimal block growth. Math. Syst. Theor.7 (1973) 138–153. Zbl0256.54028MR322838
  9. [9] S. Ferenczi, C. Holton and L.Q. Zamboni, Structure of three-interval exchange transformations. II. A combinatorial description of the trajectories. J. Anal. Math. 89 (2003) 239–276. Zbl1130.37324MR1981920
  10. [10] L. Háková, Morphisms on generalized sturmian words. Master’s thesis, Czech Technical University in Prague (2008). 
  11. [11] A.B. Katok and A.M. Stepin, Approximations in ergodic theory. Uspehi Mat. Nauk22 (1967) 81–106. Zbl0172.07202MR219697
  12. [12] M. Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge 90 (2002). Zbl1001.68093MR1905123
  13. [13] M. Morse and G.A. Hedlund, Symbolic dynamics II. Sturmian trajectories. Amer. J. Math. 62 (1940) 1–42. Zbl0022.34003MR745JFM66.0188.03
  14. [14] P. Séébold, On the conjugation of standard morphisms. Theoret. Comput. Sci.195 (1998) 91–109. Zbl0981.68104MR1603835

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.