The Discovery of the Aperiodic Monotile: How David Smith Changed Mathematics
Category Science Saturday - April 29 2023, 08:28 UTC - 10 months ago David Smith, a retired print technician from Yorkshire, England, and a team of mathematicians, programmers and tiling enthusiasts, have solved a nearly 60-year-old mathematical problem by discovering a single shape that tiles the infinite plane without repeating and overlapping. This discovery, known as the aperiodic monotile, has delighted mathematicians since its discovery by Robert Berger in the mid-1960s.
Saturday - April 29 2023, 08:28 UTC - 10 months ago
David Smith, a retired print technician from Yorkshire, England, and a team of mathematicians, programmers and tiling enthusiasts, have solved a nearly 60-year-old mathematical problem by discovering a single shape that tiles the infinite plane without repeating and overlapping. This discovery, known as the aperiodic monotile, has delighted mathematicians since its discovery by Robert Berger in the mid-1960s.
A nearly 60-year-old mathematical problem has finally been solved.The story began last fall when David Smith, a retired print technician from Yorkshire, England, came upon a shape with a tantalizing property. The life-long tiling enthusiast discovered a 13-sided shape—dubbed the hat—that is able to fill the infinite plane without overlaps or gaps in a pattern that not only never repeats but also never can be made to repeat.
This elusive shape is known to mathematicians as an aperiodic monotile or an einstein, a clever pun that takes its name from the German words ein and stein that mean one stone.
"Dave and I had been in touch over the years and we belong to the same old-fashioned listserv for people interested in tiling, a mix of tiling enthusiasts, programmers and mathematicians," recalls Cheriton School of Computer Science professor Craig S. Kaplan, who collaborated with Smith, software developer Joseph Myers and mathematician Chaim Goodman-Strauss on the paper that has proven that the elusive einstein exists.
"Dave was on to something big, something historic, but he hit the wall on what he could deduce about this shape by working with paper cut-outs. He knew I had recently published a paper about a related topic for which I developed a piece of software that we could use to understand what his shape was doing. He sent me an email asking, 'Hey, can you run this through your software and see what happens?'" .
Mathematicians had been trying to find a shape like David Smith's einstein since the 1960s when American mathematician Robert Berger discovered the first example of aperiodic tiling.
"Berger's aperiodic set of shapes was found in the mid-1960s and that set had 20,426 shapes," Professor Kaplan explained. "It was an elaborate construction with a combinatorial set of features that required a multiplicity of shapes to guarantee that the pattern doesn't repeat. That was an important discovery, but the natural next question for mathematicians is, can we get smaller sets? What's the lowest number of shapes we can do this with?" .
By 1970, the set of shapes proven to tile aperiodically was down to about 100 and in 1971 mathematician Raphael Robinson got it down to six. Then, in 1974, Sir Roger Penrose discovered the eponymous Penrose tiles, which reduced the number to two.
As shown in this looping animated GIF, the hat is one member of a continuous family of shapes that are all aperiodic, and that all tile the plane in the same way. Credit: arXiv (2023). DOI: 10.48550/arxiv.2303.10798 .
"Those two shapes in Penrose's solution had enough structure that they forbid periodicity. But for almost 50 years mathematicians have been wondering, can we get down to just one shape? Can we do this with a monotile? That's the problem we solved. We found a single shape that does what all these earlier sets of multiple shapes are able to do." .
In mathematics and computer science many problems remain open, but theoreticians have a strong sense what the answer will be even though a formal proof may be decades away.
"The famous P vs. NP problem in computer science—a question about how long it takes to execute a particular class of algorithms—is still open, but there's a consensus how that's going to play out," Professor Kaplan said. "Almost every computer scientist thinks that P is no equal to NP, but there's no proof yet. Same here. There was a widespread belief among mathematicians that there should be a single tile, an einstein, that can tile the plane aperiodically, but no one had proven it yet. That's the problem we solved." .