Computational aspects of M. C. Escher's ribbon patterns
From MaRDI portal
Publication:489754
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 17635 (Why is no real title available?)
- scientific article; zbMATH DE number 1735725 (Why is no real title available?)
- scientific article; zbMATH DE number 1014067 (Why is no real title available?)
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- Applying Burnside's lemma to a one-dimensional Escher problem
- Combinatorial enumeration of \(2\times 2\) ribbon patterns
- Counting Escher's \(m\times m\) ribbon patterns
- Escher's combinatorial patterns
- Notes on a class of tiling problems
- On a tiling scheme from M. C. Escher
- On cycle bases of a graph
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(7)- Applying Burnside's lemma to a one-dimensional Escher problem
- Combinatorial enumeration of \(2\times 2\) ribbon patterns
- An efficient exhaustive search algorithm for the Escherization problem
- Counting Escher's \(m\times m\) ribbon patterns
- Maximum eigenvalue problem for Escherization
- Combinatorial aspects of Escher tilings
- scientific article; zbMATH DE number 3991431 (Why is no real title available?)
This page was built for publication: Computational aspects of M. C. Escher's ribbon patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489754)