{"title":"On the rigidity of Arnoux-Rauzy words","authors":"V. Berthé , S. Puzynina","doi":"10.1016/j.aam.2025.102932","DOIUrl":null,"url":null,"abstract":"<div><div>An infinite word generated by a substitution is rigid if all the substitutions which fix this word are powers of the same substitution. Sturmian words as well as characteristic Arnoux-Rauzy words that are generated by iterating a substitution are known to be rigid. In the present paper, we prove that all Arnoux-Rauzy words generated by iterating a substitution are rigid. The proof relies on two main ingredients: first, the fact that the primitive substitutions that fix an Arnoux-Rauzy word share a common power, and secondly, the notion of normal form of an episturmian substitution (i.e., a substitution that fixes an Arnoux-Rauzy word). The main difficulty is then of a combinatorial nature and relies on the normalization process when taking powers of episturmian substitutions: the normal form of a square is not necessarily equal to the square of the normal forms.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"170 ","pages":"Article 102932"},"PeriodicalIF":1.3000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0196885825000946","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
An infinite word generated by a substitution is rigid if all the substitutions which fix this word are powers of the same substitution. Sturmian words as well as characteristic Arnoux-Rauzy words that are generated by iterating a substitution are known to be rigid. In the present paper, we prove that all Arnoux-Rauzy words generated by iterating a substitution are rigid. The proof relies on two main ingredients: first, the fact that the primitive substitutions that fix an Arnoux-Rauzy word share a common power, and secondly, the notion of normal form of an episturmian substitution (i.e., a substitution that fixes an Arnoux-Rauzy word). The main difficulty is then of a combinatorial nature and relies on the normalization process when taking powers of episturmian substitutions: the normal form of a square is not necessarily equal to the square of the normal forms.
期刊介绍:
Interdisciplinary in its coverage, Advances in Applied Mathematics is dedicated to the publication of original and survey articles on rigorous methods and results in applied mathematics. The journal features articles on discrete mathematics, discrete probability theory, theoretical statistics, mathematical biology and bioinformatics, applied commutative algebra and algebraic geometry, convexity theory, experimental mathematics, theoretical computer science, and other areas.
Emphasizing papers that represent a substantial mathematical advance in their field, the journal is an excellent source of current information for mathematicians, computer scientists, applied mathematicians, physicists, statisticians, and biologists. Over the past ten years, Advances in Applied Mathematics has published research papers written by many of the foremost mathematicians of our time.