arXiv · chao-dyn/9502005
Symbolic Dynamics and Markov Partitions for the Stadium Billiard
Abstract
We investigate the Bunimovich stadium dynamics and find that in the limit of infinitely long stadium the symbolic dynamics is a subshift of finite type. For a stadium of finite length the Markov partitions are infinite, but the inadmissible symbol sequences can be determined exactly by means of the appropriate pruning front. We outline a construction of a sequence of finite Markov graph approximations by means of approximate pruning fronts with finite numbers of steps.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kai T. Hansen, Predrag Cvitanovic. 1995-02-06. Symbolic Dynamics and Markov Partitions for the Stadium Billiard. https://arxiv.org/abs/chao-dyn/9502005
Cite the original work for its findings. Save a collection to share your selection of sources.