Palindromic complexity of infinite words associated with simple Parry numbers

Details Palindromic complexity of infinite words associated with simple Parry numbers Palindromic complexity of infinite words associated with simple Parry numbers

2006-03-26

arxiv.org/abs/math/0603608v1

Mathematics

Combinatorics

28 pages, to appear in Annales de l'Institut Fourier

Scientific paper

A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a substitution associated with a simple Parry number \beta. It is shown that the word u_\beta contains infinitely many palindromes if and only if t_1=t_2= ... =t_{m-1} \geq t_m. Numbers \beta satisfying this condition are the so-called confluent Pisot numbers. If t_m=1 then u_\beta is an Arnoux-Rauzy word. We show that if \beta is a confluent Pisot number then P(n+1)+ P(n) = C(n+1) - C(n)+ 2, where P(n) is the number of palindromes and C(n) is the number of factors of length n in u_\beta. We then give a complete description of the set of palindromes, its structure and properties.

Affiliated with

Also associated with

No associations

Rating

Palindromic complexity of infinite words associated with simple Parry numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Palindromic complexity of infinite words associated with simple Parry numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Palindromic complexity of infinite words associated with simple Parry numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607939