Applying Burnside's lemma to a one-dimensional Escher problem

DOI10.2307/27642932MaRDI QIDQ3018979zbMATH OpenOpenAlexFDO

Authors Tomaž Pisanski, Doris Schattschneider, Brigitte Servatius

Publication date 27 July 2011

Full work available at URL https://doi.org/10.2307/27642932

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Recommendations

• scientific article; zbMATH DE number 1735725
• Counting Escher's \(m\times m\) ribbon patterns
• Escher's combinatorial patterns
• Computational aspects of M. C. Escher's ribbon patterns
• scientific article; zbMATH DE number 617587

Cited in

(4)

• Counting Escher's \(m\times m\) ribbon patterns
• Burnside's lemma
• Computational aspects of M. C. Escher's ribbon patterns
• Combinatorial enumeration of \(2\times 2\) ribbon patterns

This page was built for publication: Applying Burnside's lemma to a one-dimensional Escher problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018979)