Imbalances in Arnoux-Rauzy sequences

被引:44
作者
Cassaigne, J
Ferenczi, S
Zamboni, LQ
机构
[1] Inst Math Luminy, F-13288 Marseille 9, France
[2] CNRS, Lab Math & Phys Theor, F-37200 Tours, France
[3] Univ N Texas, Dept Math, Denton, TX 76203 USA
关键词
infinite words; rotations; return times; bounded remainder sets;
D O I
10.5802/aif.1792
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In a 1982 paper Rauzy showed that the subshift (X,T) generated by the morphism 1 --> 12, 2 --> 13 and 3 --> 1 is a natural coding of a rotation on the two-dimensional torus T-2, i.e., is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in R-2, each domain being translated by the same vector module a lattice. It was believed more generally that each sequence of block complexity 2n + 1 satisfying a combinatorial criterion known as the (*) condition of Arnoux and Rauzy codes the orbit of a point under a rotation on T-2. In this note we exhibit a counterexample to this conjecture. We first build an Arnoux-Rauzy sequence w(*) which is unbalanced in the following sense: for each N > 0 there exist two factors of w(*) of equal length, with one having at least N more occurrences of a given letter than the other. We then invoke a result due to Rauzy on bounded remainder sets to establish the existence of an Arnoux-Rauzy sequence which is not a natural coding of a rotation on T-2.
引用
收藏
页码:1265 / +
页数:13
相关论文
共 31 条
[1]   EXAMPLE OF SEMICONJUGACY BETWEEN INTERVAL EXCHANGE AND TRANSLATION ON A TORUS [J].
ARNOUX, P .
BULLETIN DE LA SOCIETE MATHEMATIQUE DE FRANCE, 1988, 116 (04) :489-500
[2]   GEOMETRIC REPRESENTATION OF SEQUENCES OF COMPLEXITY 2N+1 [J].
ARNOUX, P ;
RAUZY, G .
BULLETIN DE LA SOCIETE MATHEMATIQUE DE FRANCE, 1991, 119 (02) :199-215
[3]  
ARNOUX P, 1999, DISCRETE PLANES Z2 A
[4]  
ARNOUX P, 1998, 9818 I MATH LUM
[5]  
BERTHE V, 1997, 9719 I MATH LUM
[6]  
CANTERINI V, 1999, GEOMETRIC REPRESENTA
[7]   Fine and Wilf's theorem for three periods and a generalization of Sturmian words [J].
Castelli, MG ;
Mignosi, F ;
Restivo, A .
THEORETICAL COMPUTER SCIENCE, 1999, 218 (01) :83-94
[9]  
CHEKHOVA N, 1998, 9824 I MATH LUM
[10]  
CHEKHOVA N, 1999, FONCTIONS RECURRENCE