2000 character limit reached
Billiard complexity in the hypercube (1109.6410v1)
Published 29 Sep 2011 in math.DS and math.CO
Abstract: We consider the billiard map in the hypercube of $\mathbb{R}d$. We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that $n{3d-3}$ is the order of magnitude of the complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.