Complexity of cutting words on regular tilings
From MaRDI portal
Publication:854843
DOI10.1016/J.EJC.2005.05.009zbMATH Open1111.68095OpenAlexW1998376973MaRDI QIDQ854843FDOQ854843
Authors: Pascal Hubert, L. 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
Recommendations
- Words, tilings and combinatorial spectra
- Complexity and cohomology for cut-and-projection tilings
- scientific article; zbMATH DE number 3892611
- Words, automata and Lie theory for tilings
- scientific article; zbMATH DE number 1820116
- Decidability and periodicity of low complexity tilings
- scientific article; zbMATH DE number 7650899
- scientific article; zbMATH DE number 4085051
- The complexity of tangent words
- Maximal pattern complexity of two-dimensional words
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorics on words (68R15) Polyominoes (05B50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of trajectories in rectangular billiards
- Complexity of sequences defined by billiard in the cube
- On translating one polyomino to tile the plane
- A remark on morphic sturmian words
- Substitution invariant cutting sequences
- Complexity and growth for polygonal billiards
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Asymptotic behavior in a heap model with two pieces
Cited In (4)
This page was built for publication: Complexity of cutting words on regular tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854843)
