Complexity and growth for polygonal billiards
classification
🧮 math.DS
keywords
complexitycasecubicgrowthpolygonalasymptoticbilliardbilliards
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.