Complexity and growth for polygonal billiards

Authors:
  • JCJ. Cassaigne
    J. Cassaigne
  • PHPascal Hubert
    Pascal Hubert
  • STSerge Troubetzkoy
    Serge Troubetzkoy

Abstract
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.

This publication has 14 references indexed in Scilit: