Billiard complexity in rational polyhedra

Abstract

We give a new proof for the directional billiard complexity in the cube, which was conjectured in \cite{Ra} and proven in \cite{Ar.Ma.Sh.Ta}. Our technique gives us a similar theorem for some rational polyhedra.

9 pages, 4 figures

Cited by in corpus (3)

• Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm
• Polyhedral billiards, eigenfunction concentration and almost periodic control
• On balance properties of hypercubic billiard words