Abstract
At the heart of the ideas of the work of Dutch graphic artist M.C. Escher is the idea of automation; we consider a problem that was inspired by some of his earlier and lesser known work. Specifically, a motif fragment is a connected region contained in a closed unit square. Consider a union of motif fragments and call the result an Escher tile T. One can then construct a pattern in the Euclidean plane, as Escher did, with the set of horizontal and vertical unit length translations of T. The resulting pattern gives rise to infinitely many sets of motif fragments (each set may be finite or infinite) that are related visually by way of the interconnections across boundaries of the unit squares that underly the construction; a set of related motif fragments sometimes gives the appearance of a ribbon and thus the resulting pattern in the plane is called a ribbon pattern. Escher’s designs gave rise to beautiful artwork and inspired equally aesthetic combinatorial questions as well. In his sketchbooks, Escher colored the ribbon patterns with pleasing results. Coloring the ribbon patterns led naturally to a question of periodicity: is there a prototile that generates a well-colored pattern? The current work answers the question in the affirmative by way of tools from graph theory, algorithms, and number theory. We end with a list of open questions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. No. 66, 72 (1966)
Cohen, E., Megiddo, N.: Recognizing properties of periodic graphs. In: Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 4, pp. 135–146. Amer. Math. Soc., Providence (1991)
Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol. 138. Springer, Berlin (1993)
Davis, D.: On a tiling scheme from M. C. Escher. Electron. J. Combin., 4(2): Research Paper 23, approx. 11 (electronic) (1997); The Wilf Festschrift (Philadelphia, PA, 1996)
Escher, G.: Potato printing: a game for winter evenings. In: Coxeter, H.S.M., Emmer, M., Penrose, R., Teuber, M. (eds.) M.C. Escher: Art and Science, pp. 9–11. North Holland, Amsterdam (1986)
Joseph Fowler, J., Gethner, E.: Counting Escher’s m×m ribbon patterns. J. Geom. Graph. 10(1), 1–13 (2006)
Gardner, M.: Penrose tiles to trapdoor ciphers. MAA Spectrum. Mathematical Association of America, Washington, DC. …and the return of Dr. Matrix, Revised reprint of the 1989 original (1997)
Gethner, E.: On a generalization of a combinatorial problem posed by M. C. Escher. In: Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, vol. 153, pp. 77–96 (2001)
Gethner, E., Schattschneider, D., Passiouras, S., Joseph Fowler, J.: Combinatorial enumeration of 2×2 ribbon patterns. European J. Combin. 28(4), 1276–1311 (2007)
Mabry, R., Wagon, S., Schattschneider, D.: Automating Escher’s combinatorial patterns. Mathematica in Education and Research 5, 38–52 (1996)
Osborne, H.: The Oxford companion to art. Clarendon P. (1970)
Pisanski, T., Schattschneider, D., Servatius, B.: Applying Burnside’s lemma to a one-dimensional Escher problem. Math. Mag. 79(3), 167–180 (2006)
Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12, 177–209 (1971)
Schattschneider, D., Escher, M.C.: M.C. Escher: visions of symmetry. Harry N. Abrams, Inc. (2004)
Schattschneider, D.: Escher’s combinatorial patterns. Electron. J. Combin. 4(2): Research Paper 17, approx. 31 (electronic) (1997); The Wilf Festschrift (Philadelphia, PA, 1996)
Sysło, M.M.: On cycle bases of a graph. Networks 9(2), 123–132 (1979)
van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Appl. Math., vol. 187, pp. 331–363. Dekker, New York (1997)
Wang, H.: Notes on a class of tiling problems. VIII, Fundamenta Mathematicae, 82:295305, 1974/5. Collection of articles dedicated to Andrzej Mostowski on his sixtieth birthday
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gethner, E., Kirkpatrick, D.G., Pippenger, N.J. (2012). M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)