N. Chekova, P. Hubert and A .Messaoudi, Propri'et'es combinatoires,ergodiques et arithm'etiques de la substitution de Tribonacci, prepublication 98-24 IML. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Structure Of Three-Interval Exchange Transformations I.. - Ferenczi, Holton.. (2001) (2 citations) (Correct)
.... of sequences of complexity 2n 1 introduced by Arnoux and Rauzy in [5] which are a natural generalization of the Sturmian sequences; the arithmetic component is given by a 2 dimensional division algorithm originally defined by Arnoux and Rauzy in [5] and later studied in greater generality in [13, 43, 44] Though the resulting arithmetic ergodic combinatorial interaction is very satisfying in the special case of the so called Tribonacci system, as pioneered by work of Arnoux and Rauzy [3, 5, 35] a more general canonical equivalence (through what is called a natural coding) between two dimensional ....
N. CHEKHOVA, P. HUBERT, A. MESSAOUDI, Proprietes combinatoires, ergodiques et arithmetiques de la substitution de tribonacci, Journal des Theorie de Nombres de Bordeaux, (2001), in press.
Return Words In Sturmian And Episturmian Words - Justin, Vuillon (2000) (2 citations) (Correct)
.... words (episturmian words on a finite alphabet are a natural generalization of Sturmian words introduced in [7] which includes in particular Sturmian words and Arnoux Rauzy sequences [2] This allows (Section 5) to calculate the recurrence function, obtaining or completing known results [5, 11], and to state a kind of balance property of episturmian words which when applied to Sturmian words coincides with the well known balance property of these words. 1. Definitions and notations 1.1. Words Given a finite alphabet A; A is the set of words on A and A = A n f g with the empty ....
N. Chekova, P. Hubert and A .Messaoudi, Propri'et'es combinatoires,ergodiques et arithm'etiques de la substitution de Tribonacci, prepublication 98-24 IML.
Return Words In Sturmian And Episturmian Words - Justin, Vuillon (2000) (2 citations) (Correct)
.... words (episturmian words on a finite alphabet are a natural generalization of Sturmian words introduced in [6] which includes in particular Sturmian words and Arnoux Rauzy sequences [2] This allows (section 5) to calculate the recurrence function, obtaining or completing known results [10, 5], and to state a kind of balance property of episturmian words which when applied to Sturmian words coincides with the well known balance property of these words. 2 1 Definitions and notations 1.1 Words Given a finite alphabet A; A is the set of words on A and A = A n f g with the ....
N. Chekova, P. Hubert and A .Messaoudi, Propri'et'es combinatoires, ergodiques et arithm'etiques de la substitution de Tribonacci, prepublication 98-24 IML.
Return Words In Sturmian And Episturmian Words - Justin, Vuillon (2000) (2 citations) (Correct)
No context found.
N. Chekova, P. Hubert and A .Messaoudi, Propri'et'es combinatoires,ergodiques et arithm'etiques de la substitution de Tribonacci, prepublication 98-24 IML.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC