by Jordana Cepelewicz, Senior Writer, Quanta Magazine
December 15, 2022
One of the oldest and simplest problems in geometry has caught mathematicians off guard — and not for the first time.
Since antiquity, artists and geometers have wondered how shapes can tile the entire plane without gaps or overlaps. And yet, “not a lot has been known until fairly recent times,” said Alex Iosevich, a mathematician at the University of Rochester.
The most obvious tilings repeat: It’s easy to cover a floor with copies of squares, triangles or hexagons. In the 1960s, mathematicians found strange sets of tiles that can completely cover the plane, but only in ways that never repeat.
“You want to understand the structure of such tilings,” said Rachel Greenfeld, a mathematician at the Institute for Advanced Study in Princeton, New Jersey. “How crazy can they get?”
Pretty crazy, it turns out.
The first such non-repeating, or aperiodic, pattern relied on a set of 20,426 different tiles. Mathematicians wanted to know if they could drive that number down. By the mid-1970s, Roger Penrose (who would go on to win the 2020 Nobel Prize in Physics for work on black holes) proved that a simple set of just two tiles, dubbed “kites” and “darts,” sufficed.
It’s not hard to come up with patterns that don’t repeat. Many repeating, or periodic, tilings can be tweaked to form non-repeating ones. Consider, say, an infinite grid of squares, aligned like a chessboard. If you shift each row so that it’s offset by a distinct amount from the one above it, you’ll never be able to find an area that can be cut and pasted like a stamp to re-create the full tiling.
The real trick is to find sets of tiles — like Penrose’s — that can cover the whole plane, but only in ways that don’t repeat.
Read more:
https://www.quantamagazine.org/nasty-geometry-breaks-decades-old-tiling-conjecture-20221215