Complexity and growth for polygonal billiards - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annales de l'Institut Fourier Année : 2002

Complexity and growth for polygonal billiards

Résumé

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.

Dates et versions

hal-00133481 , version 1 (26-02-2007)

Identifiants

Citer

J. Cassaigne, P. Hubert, Serge Troubetzkoy. Complexity and growth for polygonal billiards. Annales de l'Institut Fourier, 2002, 52, pp.1001-1013. ⟨hal-00133481⟩
86 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More