Page 1 Next

Displaying 1 – 20 of 113

Showing per page

Palindromic complexity of infinite words associated with non-simple Parry numbers

L'ubomíra Balková, Zuzana Masáková (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study the palindromic complexity of infinite words u β , the fixed points of the substitution over a binary alphabet, ϕ ( 0 ) = 0 a 1 , ϕ ( 1 ) = 0 b 1 , with a - 1 b 1 , which are canonically associated with quadratic non-simple Parry numbers β .

Palindromic complexity of infinite words associated with non-simple Parry numbers

L'ubomíra Balková, Zuzana Masáková (2008)

RAIRO - Theoretical Informatics and Applications

We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, φ(0) = 0a1, φ(1) = 0b1, with a - 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.

Palindromic complexity of infinite words associated with simple Parry numbers

Petr Ambrož, Zuzana Masáková, Edita Pelantová, Christiane Frougny (2006)

Annales de l’institut Fourier

A simple Parry number is a real number β > 1 such that the Rényi expansion of 1 is finite, of the form d β ( 1 ) = t 1 t m . We study the palindromic structure of infinite aperiodic words u β that are the fixed point of a substitution associated with a simple Parry number β . It is shown that the word u β contains infinitely many palindromes if and only if t 1 = t 2 = = t m - 1 t m . Numbers β satisfying this condition are the so-called confluent Pisot numbers. If t m = 1 then u β is an Arnoux-Rauzy word. We show that if β is a confluent Pisot number then...

Periodic Jacobi-Perron expansions associated with a unit

Brigitte Adam, Georges Rhin (2011)

Journal de Théorie des Nombres de Bordeaux

We prove that, for any unit ϵ in a real number field K of degree n + 1 , there exits only a finite number of n-tuples in  K n which have a purely periodic expansion by the Jacobi-Perron algorithm. This generalizes the case of continued fractions for n = 1 . For n = 2 we give an explicit algorithm to compute all these pairs.

Currently displaying 1 – 20 of 113

Page 1 Next