Complexity and growth for polygonal billiards

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages, 4 figures

Keywords

Dynamical Systems, 37C

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/62268

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0109208
 http://arxiv.org/abs/math/0109208
 Annales de l'Institut Fourier 52 (2002) 1001-1013.

Collections

arXiv