2 papers
math.DS2001
Complexity and growth for polygonal billiards
J. Cassaigne, P. Hubert, S. Troubetzkoy
We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity funct…
math.CO2001
Palindrome complexity
Jean-Paul Allouche, Michael Baake, Julien Cassaigne +1
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We sur…