Complexity of trajectories in rectangular billiards
From MaRDI portal
Abstract: Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the trajectory are parallel. The complexity of the trajectory is the number of different words of length occurring in it. We prove that for generic trajectories the complexity is well defined and calculate it, confirming the conjecture of Arnoux, Mauduit, Shiokawa and Tamura [AMST].
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 16592 (Why is no real title available?)
- scientific article; zbMATH DE number 98759 (Why is no real title available?)
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Complexity of sequences defined by billiard in the cube
Cited in
(29)- The complexity of functions on lattices
- Billiard complexity in rational polyhedra
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- scientific article; zbMATH DE number 5830202 (Why is no real title available?)
- On smooth sets of integers
- Statistics of patterns in typical cut and project sets
- Digital geometry in image-based metrology
- Episturmian words and episturmian morphisms
- Constructing partial words with subword complexities not achievable by full words
- Complexity of cutting words on regular tilings
- *-Sturmian words and complexity
- Assigning multiple job types to parallel specialized servers
- Sturmian jungle (or garden?) On multiliteral alphabets
- Complexity and cohomology for cut-and-projection tilings
- Second Order Balance Property on Christoffel Words
- A geometrical characterization of factors of multidimensional billiard words and some applications
- Palindromic factors of billiard words
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Minimal Complexities for Infinite Words Written with d Letters
- Complexity lower bounds for polygonal billiards
- The subword complexity of a class of infinite binary words
- Complexity of Degenerated Three Dimensional Billiard Words
- 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
- Episturmian words: a survey
- Analysis of billiard ball computation using phase space logics
This page was built for publication: Complexity of trajectories in rectangular billiards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903332)
