Combinatorial properties of sequences defined by the billiard in the tesselation triangles

DOI10.1016/0304-3975(95)00208-1zbMath0871.68146MaRDI QIDQ671428

Pascal Hubert

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00208-1

zbMATH Keywords

infinite words; billiard trajectories; coding sequences

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R15: Combinatorics on words

37E99: Low-dimensional dynamical systems

Related Items

Complexity of cutting words on regular tilings, Itineraries of rigid rotations and diffeomorphisms of the circle, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Coding rotations on intervals, Complexity and growth for polygonal billiards, \(m\)-balanced words: A generalization of balanced words, Natural exact covering systems and the reversion of the Möbius series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of factors of Sturmian words
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Fibonacci morphisms and Sturmian words
• Arithmetical properties of a certain power series
• Sequences with subword complexity \(2n\)
• Some combinatorial properties of Sturmian words
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Complexity of sequences defined by billiard in the cube
• Complexité de suites définies par des billards rationnels
• Sequences with minimal block growth
• Billiards in polygons