Billiard complexity in rational polyhedra

DOI10.1070/RD2003V008N01ABEH000228zbMath1023.37024arXiv1203.4350MaRDI QIDQ1407959

Nicolas Bédaride

Publication date: 14 September 2003

Published in: Regular and Chaotic Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.4350

zbMATH Keywords

complexitybilliardrational polyhedraRauzy conjecture

Mathematics Subject Classification ID

Dynamical systems involving homeomorphisms and diffeomorphisms of planes and surfaces (37E30) Symbolic dynamics (37B10)

Related Items (11)

The subword complexity of a class of infinite binary words ⋮ Billiard complexity in the hypercube ⋮ A geometrical characterization of factors of multidimensional billiard words and some applications ⋮ Minoration of the complexity function associated to a translation on the torus ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm ⋮ Classification of rotations on the torus \(\mathbb T^2\) ⋮ Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words ⋮ Directional complexity of the hypercubic billiard ⋮ Polyhedral billiards, eigenfunction concentration and almost periodic control

This page was built for publication: Billiard complexity in rational polyhedra