Complexity and growth for polygonal billiards
Authors:
- J. CassaigneJCJ. Cassaigne
- Pascal HubertPHPascal Hubert
- Serge TroubetzkoySTSerge Troubetzkoy
- 1 January 2002
- journal article
- Published by MathDoc/Centre Mersenne in Annales de l'institut Fourier
- Vol. 52 (3) , 835-847
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
All Related Versions
This publication has 14 references indexed in Scilit:
- Ergodicity of billiards in polygons with pocketsNonlinearity, 1998
- Complexity lower bounds for polygonal billiardsChaos: An Interdisciplinary Journal of Nonlinear Science, 1998
- Propriétés combinatoires des suites définies par le billard dans les triangles pavantsTheoretical Computer Science, 1996
- Local instability of orbits in polygonal and polyhedral billiardsCommunications in Mathematical Physics, 1995
- The billiard in a regular polygonGeometric and Functional Analysis, 1992
- On the number of factors of Sturmian wordsTheoretical Computer Science, 1991
- The growth rate of trajectories of a quadratic differentialErgodic Theory and Dynamical Systems, 1990
- Teichm ller curves in moduli space, Eisenstein series and an application to triangular billiardsInventiones Mathematicae, 1989
- The growth rate for the number of singular and periodic orbits for a polygonal billiardCommunications in Mathematical Physics, 1987
- Billiards in polygonsPhysica D: Nonlinear Phenomena, 1986