Complexity and growth for polygonal billiards
J. Cassaigne, P. Hubert, S. Troubetzkoy
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.
Create a lesson
Related papers
Adjoint-Based Stochastic Analysis for Fatigue of Aeroelastic and Frictional Systems
Justin H. Porter
Asymptotic Analysis of Discrete-Time Self-Attention Dynamics in Transformers
Claudio Altafini
Dimension theory of group actions by circle diffeomorphisms I: Stationary measures
Weikun He, Yuxiang Jiao, Disheng Xu
Hausdorff Dimension and Flexibility for Attractors of Non-Uniformly Hyperbolic Flows
Elias Rego, Paulo Varandas
Finiteness of planar central configurations of five bodies for all positive masses
Tejasvi Singh Tomar
Khintchine dichotomy for images of self-similar measures and almost random walks
Liyang Shao