<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Geometry on Yunhai Xiang</title><link>https://yunhaimath.com/tags/geometry/</link><description>Recent content in Geometry on Yunhai Xiang</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 23 Jun 2026 00:00:01 -0400</lastBuildDate><atom:link href="https://yunhaimath.com/tags/geometry/index.xml" rel="self" type="application/rss+xml"/><item><title>Aperiodic Tilings</title><link>https://yunhaimath.com/posts/aperiodic-tilings/</link><pubDate>Tue, 23 Jun 2026 00:00:01 -0400</pubDate><guid>https://yunhaimath.com/posts/aperiodic-tilings/</guid><description>&lt;aside class="yh-pullquote" style="--yh-pullquote-w: 50%;"&gt;
&lt;div class="yh-pullquote-text"&gt;
There is no such thing as quasicrystals, only quasi-scientists.
&lt;/div&gt;&lt;div class="yh-pullquote-attrib"&gt;— Linus Pauling&lt;/div&gt;&lt;/aside&gt;
&lt;p&gt;I have been interested in aperiodic tilings for a long time. Despite being somewhat niche and underexplored, it seems to me a branch of math that potentially can have lots of connections to number theory. While tiling itself has a long artistic history, the modern study of aperiodic tilings is closely tied to physics: in 1982, Dan Shechtman observed diffraction patterns with sharp fivefold symmetry in an aluminium-manganese alloy, contradicting the old crystallographic expectation that crystals must be periodic. The mathematical models for such quasicrystals are not random patterns, but ordered non-periodic structures, with Penrose tilings as the prototypical example.&lt;/p&gt;
&lt;h2 id="periodic-tilings"&gt;Periodic Tilings&lt;/h2&gt;
&lt;p&gt;Periodic tilings are much more well understood than aperiodic ones. These are tilings which can be transformed to itself by translation, rotation, or reflection. Regular polygons already admit periodic tilings, and they are represented with the Schläfli symbol $\{n,q\}$ meaning “$q$-regular $n$-gons” meet at each vertax.&lt;/p&gt;
&lt;p&gt;&lt;div class="math-env style-plain"
data-kind="theorem"
data-lang="en"
data-numbered="true"&gt;
&lt;span class="math-heading"&gt;
&lt;span class="math-title"
data-label='Theorem'&gt;&lt;/span&gt;
&lt;/span&gt;
&lt;div class="math-body"&gt;
The only (edge-to-edge) periodic tilings by a regular polygon are $\{3, 6\},\{4, 4\}, \{6, 3\}$.
&lt;/div&gt;
&lt;/div&gt;
&lt;div class="proof-env" data-compact="true"&gt;
&lt;span class="proof-heading"&gt;
&lt;span class="proof-title"&gt;Proof.&lt;/span&gt;
&lt;/span&gt;
&lt;div class="proof-body"&gt;
The interior angle is $\frac{(n-2)\pi}{n}$, and around each vertax the sum of angles $q\frac{(n-2)\pi}{n}=2\pi$. We obtain the diophantine equation $q(n-2)=2n$, which only gives these solutions.
&lt;/div&gt;
&lt;span class="proof-qed"&gt;&lt;/span&gt;
&lt;/div&gt;
&lt;/p&gt;
&lt;p&gt;For nonregular polygon tilings, we know every triangle can tile periodically. Every quadrilateral also tiles periodically by gluing to itself rotated 180 degrees &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="GS87" data-cite-note="Chapter 9"&gt;
⟦cite:GS87⟧
&lt;/span&gt;. For convex pentagons and hexagons, all monohedral tilings by a convex prototile have been classified: there are 15 types for convex pentagons &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="Rao17"&gt;
⟦cite:Rao17⟧
&lt;/span&gt; and 3 types for convex hexagons &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="Rei18"&gt;
⟦cite:Rei18⟧
&lt;/span&gt;. For concave ones, we don't know a full classification for pentagons or hexagons. For convex $n$-gons with $n\ge 7$, no periodic tilings can exist &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="GS87" data-cite-note="Chapter 9"&gt;
⟦cite:GS87⟧
&lt;/span&gt;.&lt;/p&gt;
&lt;p&gt;For periodic tilings with more than 1 prototile, it is more complicated. An &lt;em&gt;Archimedean tiling&lt;/em&gt; is a tiling of possibly multiple prototiles all regular polygon, such that the same cyclic arrangement of polygons occurs at every vertex. They are completely classified and there are 11 of them. An &lt;em&gt;$m$-Archimedean tiling&lt;/em&gt; is the generalization where one allows $m$ cyclic arrangement of polygons. These have been enumerated for small $m$. There are $20$ for $m=2$, $61$ for $m=3$, $151$ for $m=4$, and so on.&lt;/p&gt;
&lt;h2 id="aperiodic-tiling"&gt;Aperiodic Tiling&lt;/h2&gt;
&lt;p&gt;An aperiodic tiling is a tiling whose prototiles can ONLY tile aperiodically. Wang tiles are the first aperiodic tiling. Wang tiles are squares with colored edges (which can be replaced with jaggedness), neighboring tiles must match edge colors, and you cannot rotate or translate tiles. Berger showed there are a set of Wang tiles that can only tile aperiodically. He also showed there are sets of Wang tiles where whether one could tile the plane is undecidable. For more aperiodic tilings, see &lt;a href="https://tilings.math.uni-bielefeld.de/"&gt;here&lt;/a&gt;. One famous example is Penrose tiling. They have two prototiles, kite and dart &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="Pen74"&gt;
⟦cite:Pen74⟧
&lt;/span&gt;. This came from the study of quasicrystals in physics &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="Sen06"&gt;
⟦cite:Sen06⟧
&lt;/span&gt;. Another famous example is the aperiodic monotile (Einstein problem): the hat and spectre, discovered by Smith, Myers, Kaplan, and Goodman-Strauss &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="SMKG24a"&gt;
⟦cite:SMKG24a⟧
&lt;/span&gt; &lt;span class="yh-ref" data-ref-kind="bib"
data-cite-key="SMKG24b"&gt;
⟦cite:SMKG24b⟧
&lt;/span&gt;.&lt;/p&gt;
&lt;p&gt;One of the main ways to create aperiodic tilings is by &lt;em&gt;substitution tiling&lt;/em&gt;. One defines how to expand a tile and subdivide it into prototiles, and then repeat. It will cover more and more parts of the plane, but one has to show this stabilizes. Penrose tilings are the prototypical substitution tiling. For the hat shape, it is not a substitution tiling. Its aperiodicity is shown with something called metatiles. Clusters of hats are grouped together called a metatile, and these metatiles satisfy a substitution tiling pattern.&lt;/p&gt;
&lt;h2 id="references"&gt;References&lt;/h2&gt;
&lt;div class="bib-env"&gt;
&lt;ul class="bib-list"&gt;
&lt;li id="bib-GS87" data-bib-key="GS87"&gt;
&lt;span class="bib-label"&gt;[GS87]&lt;/span&gt;Branko Grünbaum and G. C. Shephard. &lt;em&gt;Tilings and Patterns&lt;/em&gt;. W. H. Freeman. 1987.&lt;/li&gt;
&lt;li id="bib-Rei18" data-bib-key="Rei18"&gt;
&lt;span class="bib-label"&gt;[Rei18]&lt;/span&gt;Karl Reinhardt. &lt;em&gt;Über die Zerlegung der Ebene in Polygone&lt;/em&gt;. Druck von Robert Noske. 1918.&lt;/li&gt;
&lt;li id="bib-Rao17" data-bib-key="Rao17"&gt;
&lt;span class="bib-label"&gt;[Rao17]&lt;/span&gt;Michaël Rao. &lt;em&gt;Exhaustive Search of Convex Pentagons Which Tile the Plane&lt;/em&gt;. 2017. &lt;a href="https://arxiv.org/abs/1708.00274"&gt;arXiv:1708.00274&lt;/a&gt;.&lt;/li&gt;
&lt;li id="bib-Gar89" data-bib-key="Gar89"&gt;
&lt;span class="bib-label"&gt;[Gar89]&lt;/span&gt;Martin Gardner. &lt;em&gt;Penrose Tiles to Trapdoor Ciphers&lt;/em&gt;. W. H. Freeman. 1989.&lt;/li&gt;
&lt;li id="bib-Tre23" data-bib-key="Tre23"&gt;
&lt;span class="bib-label"&gt;[Tre23]&lt;/span&gt;Rodrigo Treviño. &lt;em&gt;Aperiodic Tilings, Order, and Randomness&lt;/em&gt;. Notices of the American Mathematical Society. 70(10). pp. 1640--1651. 2023.&lt;/li&gt;
&lt;li id="bib-BG13" data-bib-key="BG13"&gt;
&lt;span class="bib-label"&gt;[BG13]&lt;/span&gt;Michael Baake and Uwe Grimm. &lt;em&gt;Aperiodic Order. Volume 1: A Mathematical Invitation&lt;/em&gt;. Cambridge University Press. 2013.&lt;/li&gt;
&lt;li id="bib-Sen06" data-bib-key="Sen06"&gt;
&lt;span class="bib-label"&gt;[Sen06]&lt;/span&gt;Marjorie Senechal. &lt;em&gt;What is... a Quasicrystal?&lt;/em&gt;. Notices of the American Mathematical Society. 53(8). pp. 886--887. 2006.&lt;/li&gt;
&lt;li id="bib-Ber66" data-bib-key="Ber66"&gt;
&lt;span class="bib-label"&gt;[Ber66]&lt;/span&gt;Robert Berger. &lt;em&gt;The Undecidability of the Domino Problem&lt;/em&gt;. Memoirs of the American Mathematical Society. Vol. 66. American Mathematical Society. 1966.&lt;/li&gt;
&lt;li id="bib-Rob71" data-bib-key="Rob71"&gt;
&lt;span class="bib-label"&gt;[Rob71]&lt;/span&gt;Raphael M. Robinson. &lt;em&gt;Undecidability and Nonperiodicity for Tilings of the Plane&lt;/em&gt;. Inventiones Mathematicae. 12. pp. 177--209. 1971.&lt;/li&gt;
&lt;li id="bib-Pen74" data-bib-key="Pen74"&gt;
&lt;span class="bib-label"&gt;[Pen74]&lt;/span&gt;Roger Penrose. &lt;em&gt;The Role of Aesthetics in Pure and Applied Mathematical Research&lt;/em&gt;. Bulletin of the Institute of Mathematics and its Applications. 10. pp. 266--271. 1974.&lt;/li&gt;
&lt;li id="bib-dB81a" data-bib-key="dB81a"&gt;
&lt;span class="bib-label"&gt;[dB81a]&lt;/span&gt;N. G. de Bruijn. &lt;em&gt;Algebraic Theory of Penrose's Non-Periodic Tilings of the Plane. I&lt;/em&gt;. Indagationes Mathematicae. 43. pp. 39--52. 1981.&lt;/li&gt;
&lt;li id="bib-dB81b" data-bib-key="dB81b"&gt;
&lt;span class="bib-label"&gt;[dB81b]&lt;/span&gt;N. G. de Bruijn. &lt;em&gt;Algebraic Theory of Penrose's Non-Periodic Tilings of the Plane. II&lt;/em&gt;. Indagationes Mathematicae. 43. pp. 53--66. 1981.&lt;/li&gt;
&lt;li id="bib-SMKG24a" data-bib-key="SMKG24a"&gt;
&lt;span class="bib-label"&gt;[SMKG24a]&lt;/span&gt;David Smith, Joseph Samuel Myers, Craig S. Kaplan, and Chaim Goodman-Strauss. &lt;em&gt;An Aperiodic Monotile&lt;/em&gt;. Combinatorial Theory. 4(1). 2024. &lt;a href="https://arxiv.org/abs/2303.10798"&gt;arXiv:2303.10798&lt;/a&gt;.&lt;/li&gt;
&lt;li id="bib-SMKG24b" data-bib-key="SMKG24b"&gt;
&lt;span class="bib-label"&gt;[SMKG24b]&lt;/span&gt;David Smith, Joseph Samuel Myers, Craig S. Kaplan, and Chaim Goodman-Strauss. &lt;em&gt;A Chiral Aperiodic Monotile&lt;/em&gt;. Combinatorial Theory. 4(1). 2024. &lt;a href="https://arxiv.org/abs/2305.17743"&gt;arXiv:2305.17743&lt;/a&gt;.&lt;/li&gt;
&lt;/ul&gt;
&lt;/div&gt;</description></item></channel></rss>