Complexity and growth for polygonal billiards
Dynamical Systems
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0109208,
title = {Complexity and growth for polygonal billiards},
author = {J. Cassaigne and P. Hubert and S. Troubetzkoy},
journal= {arXiv preprint arXiv:math/0109208},
year = {2007}
}
Comments
12 pages, 4 figures