Institut de Mathématiques de Luminy

Abstract 2001-40

Cassaigne Julien, Hubert Pascal, Troubetzkoy Serge
Complexity and growth for polygonal billiards

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 function has cubic upper and lower bounds. In the tiling case the complexity has cubic asymptotic growth.


Last update : december 4, 2001, EL.