arXiv · chao-dyn/9406001
Complexity of Trajectories in Rectangular Billiards
Abstract
Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the trajectory are parallel. The complexity of the trajectory is the number of different words of length $n$ occurring in it. We prove that for generic trajectories the complexity is well defined and calculate it, confirming the conjecture of Arnoux, Mauduit, Shiokawa and Tamura [AMST].
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yuliy Baryshnikov. 1994-11-08. Complexity of Trajectories in Rectangular Billiards. https://doi.org/10.1007/bf02099463
Cite the original work for its findings. Save a collection to share your selection of sources.