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.
Recommendations
- Billiard complexity in the hypercube
- Complexity lower bounds for polygonal billiards
- Billiard combinatorics in polyhedra
- Complexity and growth for polygonal billiards
- Planar structures and billiards in rational polygons
- scientific article; zbMATH DE number 2079141
- Billiards and Rational Periodic Directions in Polygons
- Complexity of trajectories in rectangular billiards
- Complexité de suites définies par des billards rationnels
- Billiards on almost integrable polyhedral surfaces
Cited in
(17)- Billiard combinatorics in polyhedra
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Homotopical complexity of 2D billiard orbits
- Complexity of trajectories in rectangular billiards
- Description of sequences defined by billiards in the cube
- Constructing partial words with subword complexities not achievable by full words
- A geometrical characterization of factors of multidimensional billiard words and some applications
- Minimal Complexities for Infinite Words Written with d Letters
- Boundary behaviour of a billiard trajectory in ann-dimensional cube
- Polyhedral billiards, eigenfunction concentration and almost periodic control
- The subword complexity of a class of infinite binary words
- Code and order in polygonal billiards
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- Minoration of the complexity function associated to a translation on the torus
- Billiard complexity in the hypercube
- Classification of rotations on the torus \(\mathbb T^2\)
- Directional complexity of the hypercubic billiard
This page was built for publication: Billiard complexity in rational polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407959)
