Palindromic complexity of codings of rotations |
| |
Authors: | A Blondin Massé S Brlek L Vuillon |
| |
Affiliation: | a LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale “Centre-Ville”, Montréal (QC), Canada H3C 3P8b Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie, 73376 Le Bourget-du-lac cedex, Francec LIRMM, UMR 5506 CNRS, Université Montpellier II, 34392 Montpellier, France |
| |
Abstract: | We study the palindromic complexity of infinite words obtained by coding rotations on partitions of the unit circle by inspecting the return words. The main result is that every coding of rotations on two intervals is full, that is, it realizes the maximal palindromic complexity. As a byproduct, a slight improvement about return words in codings of rotations is obtained: every factor of a coding of rotations on two intervals has at most 4 complete return words, where the bound is realized only for a finite number of factors. We also provide a combinatorial proof for the special case of complementary-symmetric Rote sequences by considering both palindromes and antipalindromes occurring in it. |
| |
Keywords: | Codings of rotations Sturmian Rote Return words Full words |
本文献已被 ScienceDirect 等数据库收录! |
|