{"title":"Morphisms preserving the set of words coding three interval exchange","authors":"Tomáš Hejda","doi":"10.1051/ita/2012009","DOIUrl":null,"url":null,"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 η .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2012009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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 η .