Concept

Tiling

A covering of a region by pieces meeting edge to edge with no gap and no overlap. Whether a set of pieces can tile the plane is undecidable in general, though any particular attempt either closes up or does not.

Named by 15 essays across 6 fields — each of them below, with the objects they name alongside it.

Euclid's algorithm on a 34 by 13 rectangle. The rectangle is tiled by peeling off the largest square that fits, again and again, until nothing is left.

The oldest algorithm, drawn as a tiling

Euclid's method for finding a greatest common divisor is usually presented as a loop. It is also a way of tiling a rectangle with squares, and the tiling explains why it works.

geometry · Euclidean algorithm
The five Platonic solids. Tetrahedron, cube, octahedron, dodecahedron and icosahedron, drawn at a common scale.

Why the list of perfect solids stops at five

There are infinitely many regular polygons and exactly five regular solids. The reason is not deep, but it is very sharp, and it can be checked on a single row of corners.

geometry · Regular polyhedra
The whirling squares. Squares with Fibonacci sides 1, 1, 2, 3, 5, 8, 13, each attached to the long side of what came before. They fill a 13 by 21 rectangle exactly.

The rectangle that eats itself

Cut a square off a golden rectangle and what is left is a golden rectangle. That single property is the whole of the golden ratio, and it explains both what the number really does and most of what is wrongly claimed for it.

geometry · Golden ratio
The plane divided by nearest neighbour. 10 sites, and every point of the rectangle shaded by which site is closest to it. The boundaries are the places where two sites tie.

The plane, divided by whoever is nearest

Scatter some points and colour every other point of the plane by which one is closest. The result is a tiling nobody designed, and its dual triangulation has a property that no part of the construction mentions.

geometry · Voronoi
A tree branching at most 3 ways, to depth 4, and the path through it. A tree drawn level by level, with the nodes that die out faint and a highlighted path that always steps to a node with descendants at the bottom.

An infinite tree has an infinite path

A tree that goes on forever, in which every node has only finitely many children, must contain a single branch that goes on forever. The proof is a rule for walking, and the rule is the whole of why finite information can decide an infinite question.

logic · Models
A square cut into 7 pieces and a remainder. A square divided by cutting off a fixed fraction of what is left, over and over, so that the pieces are the terms of a geometric series and the uncut corner is the tail.

The sum that fits in one square

Half, then a quarter, then an eighth, forever. Adding infinitely many things sounds like it should give infinity, and the picture that says otherwise is a square with a corner left uncut.

analysis · Geometric series
The unit ball at p = 2.00. The set of points one unit from the origin, when distance is measured by the p-th power sum. At p = 1 it is a diamond, at p = 2 a circle, and as p grows it fills out a square.

Circles that are diamonds and squares

The theorem hands over a formula for distance. Take the formula as a definition, change the exponent in it, and the set of points one unit from the origin stops being round — while remaining, in every sense that matters, a circle.

geometry · Pythagoras
Fences of 300 against a straight wall. Fences made of two, three and four straight pieces with both ends on a wall, beside a half-circle with the same length of fence, each labelled with the area it holds.

Half a circle against a wall

Lay a fence of fixed length with both ends against a straight wall and the best shape is a half-circle, holding exactly twice what a full circle of the same fence holds. The proof is a mirror: doubled in the wall, any fence becomes a closed curve with twice the length and twice the area, and the closed-curve answer carries over. In a corner the same mirrors give a slice of a circle — until the corner's angle stops dividing a half-turn.

geometry · Isoperimetric
A patch of Penrose's rhombs. A disc of Penrose rhombus tiling after 5 subdivisions, thick and thin rhombs shaded differently: 550 thick and 340 thin half-rhombs.

Tiles that never repeat

Two rhombs with angles taken from the pentagon, cut each into halves, and cut each half into smaller copies of the two halves by a fixed rule. Repeat, and the pieces fill the plane with no gaps and no overlaps, in a pattern with five-fold stars everywhere and no period anywhere. The reason it cannot repeat is a single number: thick tiles outnumber thin ones by φ, and a repeating pattern would make that ratio a fraction.

geometry · Golden ratio
Three tilings by cells of one area, and the wall each needs. Panels of triangles, squares and hexagons, all with cells of the same area, labelled with the wall length each cell needs once shared walls are split between neighbours: the hexagons need the least.

The least wall for equal rooms

Divide the plane into rooms of equal area using as little wall as possible, and every wall does double duty. Bees settled on hexagons long ago, and the proof that nothing does better — not even rooms with curved walls — came in 1999. The straight-walled half of it is two facts: the rooms of any division average six sides, and more sides never cost more wall.

geometry · Isoperimetric
The Moser spindle: 7 points, every edge one unit, and no three-colouring. the Moser spindle drawn to scale with 7 vertices and 11 unit-length edges, coloured with four colours; none of its 2187 three-colourings is proper.

How many colours the plane needs

Colour every point of the plane so that no two points exactly one unit apart share a colour. Seven colours are enough, by a tiling with hexagons, and four are necessary, by a graph of seven points. For sixty-eight years nothing better was known on either side; then in 2018 a graph of 1,581 points showed four is not enough — and the answer is still somewhere from five to seven.

discrete · Graph colouring
The two-handled surface's octagon, eight to a corner. Regular hyperbolic octagon with angles π/4 and 64 neighbouring copies in the Poincaré disc.

An octagon only the hyperbolic plane can hold

Glue an octagon's sides in the pattern that makes a surface with two handles and its eight corners become one point, so their angles must add to a single turn. A flat octagon's add to three. The octagon that fits has corners of 45° and lives in the hyperbolic plane, where its area is forced to be exactly 4π and its four gluing moves are motions of the plane whose commutators multiply to the identity.

topology · Surface classification
Cells of points scattered at random. Poisson–Voronoi tessellation of 600 points on a torus; mean sides 6.000000000; side counts 3: 9, 4: 56, 5: 165, 6: 167, 7: 131, 8: 49, 9: 18.

The shape of a cell around a random point

Scatter points at random and give each the region nearer to it than to any other. The cells come in every shape from triangles to twelve-sided polygons, and almost nothing about them is fixed by a formula — except one thing: on a closed surface they have exactly six sides on average, every time, because three cells meet at every corner. Two hundred thousand cells measure the rest: 29.5 per cent hexagons, Lewis's law, and small cells surrounded by large ones.

geometry · Voronoi
Four ways to say which pixels touch. curve 8, rest 4: curve 1 pieces, rest 2 pieces; curve 8, rest 8: curve 1 pieces, rest 1 pieces; curve 4, rest 4: curve 12 pieces, rest 2 pieces; curve 4, rest 8: curve 12 pieces, rest 1 pieces.

A curve of pixels needs two kinds of touching

On a screen a closed curve is a ring of pixels, and whether it has an inside depends on which pixels count as touching. Let diagonal pixels touch, and the inside leaks out through the corners; forbid it, and a curve can fence in a region while being twelve separate dots. Of the 1,048,575 sets of pixels in a small window, every simple closed curve obeys the Jordan curve theorem exactly when the curve and the rest of the plane are given different rules.

topology · Jordan curve
A square cut into rectangles of ratio φ squared. 1/r@(0.0000,0.0000) 0.1273×0.3333; r@(0.1273,0.0000) 0.8727×0.3333; 1/r@(0.0000,0.3333) 0.1273×0.3333; r@(0.1273,0.3333) 0.8727×0.3333; 1/r@(0.0000,0.6667) 0.1273×0.3333; r@(0.1273,0.6667) 0.8727×0.3333

The rectangles a square can be cut into

Cut a square into rectangles that all have the same shape — the same ratio of long side to short, in any sizes, lying either way. Two to one is easy. The golden ratio is impossible, however many pieces are used and however small. The ratio φ squared works with six. What decides it is not the ratio but its partner: the number obtained by changing the sign of the square root, which must be positive. Changing that sign is a map that keeps every sum and product and scrambles every size, and areas that must add up to one cannot all turn negative.

computation · Scissors congruence

Named alongside it

The objects these essays reach for when they reach for this one.

ConvexityEuler characteristicCircleDualityExhaustive searchFibonacciGolden ratioVoronoi diagramAreaCompactnessContinued fractionsCounting argument

All concepts