1995/02/06 by Kai T. Hansen, Hansen, Kai T., Predrag Cvitanović +1 · 1 citation
Computer Science · Mathematics · #Cellular Automata and Applications #Chaotic Dynamics (nlin.CD) #FOS: Physical sciences #Mathematical Dynamics and Fractals #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.chao-dyn/9502005
openalex publication_date 1995/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.