Symbolic Dynamics and Markov Partitions for the Stadium Billiard Export

@misc{citeulike:3020494, abstract = {e 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.}, archivePrefix = {arXiv}, author = {Hansen, Kai T. and Cvitanovic, Predrag}, citeulike-article-id = {3020494}, citeulike-linkout-0 = {http://arxiv.org/abs/chao-dyn/9502005}, citeulike-linkout-1 = {http://arxiv.org/pdf/chao-dyn/9502005}, day = {6}, eprint = {chao-dyn/9502005}, keywords = {billiard, chaos, dynamics, markov, nonlinear, symbolic}, month = {Feb}, posted-at = {2008-07-19 04:44:13}, priority = {2}, title = {Symbolic Dynamics and Markov Partitions for the Stadium Billiard}, url = {http://arxiv.org/abs/chao-dyn/9502005}, year = {1995} }

TY - ELEC ID - citeulike:3020494 L3 - citeulike-article-id:3020494 N2 - e 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. TI - Symbolic Dynamics and Markov Partitions for the Stadium Billiard KW - billiard KW - chaos KW - dynamics KW - markov KW - nonlinear KW - symbolic AU - Hansen, Kai AU - Cvitanovic, Predrag PY - 1995/Feb/06/ UR - http://arxiv.org/abs/chao-dyn/9502005 ER -