Complexity of cutting words on regular tilings

DOI10.1016/j.ejc.2005.05.009zbMath1111.68095OpenAlexW1998376973MaRDI QIDQ854843

Pascal Hubert, Laurent Vuillon

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.05.009

zbMATH Keywords

tilingspolyominoescutting word

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorics on words (68R15) Polyominoes (05B50)

Related Items (4)

Complexity and cohomology for cut-and-projection tilings ⋮ Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words ⋮ An algorithm for deciding if a polyomino tiles the plane ⋮ You can hear the shape of a billiard table: symbolic dynamics and rigidity for flat surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial properties of sequences defined by the billiard in the tesselation triangles
• On translating one polyomino to tile the plane
• Substitution invariant cutting sequences
• Complexity and growth for polygonal billiards
• Complexity of trajectories in rectangular billiards
• Complexity of sequences defined by billiard in the cube
• A remark on morphic sturmian words
• Asymptotic behavior in a heap model with two pieces

This page was built for publication: Complexity of cutting words on regular tilings