tiling theory

tiling theory
Name	Tiling theory
Field	Mathematics
Related	Combinatorics, Geometry, Topology

tiling theory

Tiling theory studies the covering of spaces by nonoverlapping pieces called tiles, linking combinatorial, geometric, and algorithmic questions. Developed through contributions from figures and institutions across Europe and North America, the subject connects to problems studied at venues such as the Princeton University workshops, the Institute for Advanced Study, and conferences organized by the American Mathematical Society and the European Mathematical Society. Research spans classical results associated with mathematicians like Hermann Minkowski, William Thurston, John Conway, Roger Penrose, and modern computational work influenced by teams at MIT, Stanford University, and the University of Cambridge.

Introduction

Tiling theory originated in questions addressed by Johannes Kepler and was formalized by researchers including M. C. Escher-inspired studies and problems posed by David Hilbert in the context of decomposition of space. Influential events such as the International Congress of Mathematicians sessions amplified connections to topics treated by Felix Klein and Henri Poincaré. The field overlaps with research programs at institutions like the Max Planck Institute for Mathematics, the Institut Henri Poincaré, and the Mathematical Sciences Research Institute.

Definitions and Basic Concepts

Fundamental notions include a tile, tessellation, prototile, and lattice, with formalizations influenced by the work of Augustin-Louis Cauchy on polyhedra and Ludwig Bieberbach on crystallographic groups. Key objects such as periodic tilings relate to the Crystallographic Restriction Theorem and classifications tied to Bravais lattice theory seen in studies by scientists at CERN and the Royal Society. Concepts of aperiodicity trace to examples constructed by Berger, with later refinements by Robert Berger's students and collaborators at universities like Harvard University and Yale University.

Types of Tilings and Examples

Classic families include regular tilings associated with the Platonic solids and semiregular tilings linked to the work of Johannes Kepler. Notable nonperiodic examples include the Penrose tiling introduced by Roger Penrose and variants studied by researchers at Bell Labs and the Royal Institution. Substitution tilings draw from ideas present in the study of Aperiodic tilings and symbolic dynamics appearing in seminars at California Institute of Technology and University of Chicago. Other constructions involve Wang tiles, developed by Hao Wang and later explored in depth by groups at Bell Labs and the University of Washington.

Mathematical Results and Theorems

Major theorems include results on decidability and undecidability stemming from work of Emil Post and Alan Turing in computability theory, with undecidability proofs by Robert Berger and advances by researchers affiliated with Princeton University and Columbia University. Structural results relate to cohomology and K-theory approaches investigated by mathematicians such as Jean-Pierre Serre and Alexander Grothendieck-inspired techniques discussed at the Institute for Advanced Study. Rigidity and classification results connect to the studies of William Thurston on geometric structures and of Mikhail Gromov on hyperbolic groups, often presented at the Courant Institute and the Clay Mathematics Institute programs.

Computational and Algorithmic Aspects

Algorithmic tiling problems intersect with computational complexity explored by researchers like Stephen Cook and Richard Karp, whose results at conferences such as the ACM Symposium on Theory of Computing informed NP-completeness discussions. The domino problem and Wang tile decision problems were advanced by Hao Wang and Robert Berger, with further computational work arising from labs at IBM Research and Microsoft Research. Software and algorithmic frameworks developed at Google and by teams at University of California, Berkeley handle large simulations of substitution systems and quasicrystals, using methods related to automata theory studied by Michael Rabin and Dana Scott.

Applications and Connections

Applications range from crystallography and quasicrystals studied at the Max Planck Institute for Solid State Research to architectural patterns exemplified by works housed at the Victoria and Albert Museum and the Metropolitan Museum of Art. Connections to physics include models in statistical mechanics investigated at the Princeton Plasma Physics Laboratory and diffraction studies conducted at facilities like the European Synchrotron Radiation Facility. Intersections with computer graphics and manufacturing link to industry labs such as Adobe Systems and research groups at ETH Zurich and Carnegie Mellon University.

Open Problems and Research Directions

Active questions involve classification of aperiodic prototile sets following the legacy of Roger Penrose and Robert Berger, spectral properties of tiling dynamical systems pursued by teams at Duke University and University of Warwick, and decidability boundaries tied to computational complexity programs linked to Stanford University and the University of Oxford. Emerging directions include connections with topological data analysis championed at the Simons Foundation and applications to materials science explored at the National Institute of Standards and Technology and the Lawrence Berkeley National Laboratory.

Category:Mathematics