35 research outputs found
Palindromic complexity of codings of rotations
International audienceWe 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
On Words with the Zero Palindromic Defect
We study the set of finite words with zero palindromic defect, i.e., words
rich in palindromes. This set is factorial, but not recurrent. We focus on
description of pairs of rich words which cannot occur simultaneously as factors
of a longer rich word
Enumerating Abelian Returns to Prefixes of Sturmian Words
We follow the works of Puzynina and Zamboni, and Rigo et al. on abelian
returns in Sturmian words. We determine the cardinality of the set
of abelian returns of all prefixes of a Sturmian word in
terms of the coefficients of the continued fraction of the slope, dependingly
on the intercept. We provide a simple algorithm for finding the set
and we determine it for the characteristic Sturmian words.Comment: 19page
ITINERARIES INDUCED BY EXCHANGE OF THREE INTERVALS
We focus on a generalization of the three gap theorem well known in the framework of exchange of two intervals. For the case of three intervals, our main result provides an analogue of this result implying that there are at most 5 gaps. To derive this result, we give a detailed description of the return times to a subinterval and the corresponding itineraries