Torus — where it appears
Named by 17 essays across 6 fields — each of them below, with the objects they name alongside it.
A loop that cannot be pulled tight
A hole is a strange thing to point at, because it is precisely where the surface is not. What can be pointed at is a loop of string lying on the surface — and the hole announces itself by refusing to let that loop be pulled in to a point.
The solid where the answer is not two
A slab with a hole through it has flat faces, straight edges and sixteen corners, and its alternating sum is zero. It is not a trick and not a degenerate case — it is the object that shows the theorem had a hypothesis nobody had written down.
Seven regions on a doughnut
A map on a torus can need seven colours, and the proof is a picture — seven regions, each sharing a border with all six others. The plane needed a computer and eighty-six years; the harder surface was settled in 1890 by drawing something.
A table folded into a surface
Unfolding a square billiard gives a straight line on a torus. Unfolding any table whose angles are whole fractions of half a turn gives a straight line on some surface — and which surface it is decides how hard the dynamics will be.
A page that knows where it is
A four-by-four array of bits, cyclic in both directions, in which every two-by-two block appears exactly once. Print it repeatedly across a sheet and any four marks on that sheet are an address.
The circles that fill a three-sphere
A three-sphere is filled by circles — one through every point, no two meeting, every two linked exactly once. Stereographic projection is the only way anybody sees it, and the projected picture is a nest of circles on tori whose linking can be counted off the drawing.
When two circular motions come home
Drive a point across with one sine wave and up and down with another. If the two frequencies are in a whole-number ratio the point retraces a closed figure whose crossings can be counted in advance — 2pq − p − q of them — and if they are not, it never comes back and fills the square, spending twenty times longer in the corners than in the middle.
Twelve pentagons, whatever the hexagons
A football has twelve pentagons and twenty hexagons. A molecule of sixty carbon atoms has the same pattern, a molecule of seventy has twelve pentagons and twenty-five hexagons, and a geodesic dome of any size has twelve places where the pattern of six breaks. None of this is a coincidence of design: Euler's formula, rearranged, says that faces meeting three at a corner must fall short of hexagons by exactly twelve in total, and the hexagons are free.
The loops on a torus that never cross themselves
Every loop on a torus is classified by two whole numbers: how often it goes round one way and how often the other. Some classes can be drawn without the loop ever crossing itself and some cannot, and the rule is the oldest in arithmetic — the two numbers must have no common factor. The same two numbers say how often any two loops must meet.
A twist that carries one loop to another
Cut a torus along a loop, turn one side of the cut once round, and glue it back. Nothing is torn, so every loop that did not cross itself still does not — but a loop of class (0, 1) is now a loop of class (1, 1). Two such twists reach every loop that never crosses itself, by Euclid's algorithm, and the symmetries they generate are exactly the whole-number matrices of determinant one.
The word a line spells in a cube
A ball bouncing in a cube hits three kinds of wall, and the order spells a word in three letters. On a square table the word had n + 1 different blocks of length n; in the cube it has $n^2 + n + 1$ — three, seven, thirteen, twenty-one — for a direction in general position. What general position has to exclude turns out to be more than any rational relation among the three speeds.
Pieces minus holes on a random surface
Cut a random landscape at some height and the region above it breaks into pieces with holes in them. How many pieces, and how many holes, has no formula. Their difference does: the average Euler characteristic of the region above height u is a constant times u multiplied by the bell curve at u, exactly, for every smooth Gaussian surface — because the Euler characteristic is a sum of peaks, pits and saddles, and the average number of those can be computed point by point.
Torus knots that fill the three-sphere
Hopf filled the three-sphere with circles, every two linked once. Let the circles turn at two different speeds instead — p turns one way while they make q the other — and the three-sphere is filled with (p, q) torus knots, trefoils when p and q are 2 and 3, every two of them linked exactly pq times. Two exceptional fibres remain plain circles; every knot links them q and p times, and they link each other once. Computed from the drawn curves for ten fibrations, every pair comes out at pq to six decimal places.
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.
The ash a random soup leaves
Fill a grid at random, apply Conway's rule — three neighbours give birth, two or three keep a cell alive — and the population collapses from half the cells to about three in a hundred, leaving scattered blocks and blinkers. Five cells in the shape of an R take 1,103 generations to do the same and peak at 319 on the way. The Game of Life is a universal computer, so nothing short of running it can say when a pattern will settle, and the figures run it.
A number that counts what it cannot see
Whether a map has a fixed point seems to need the map. Lefschetz's number needs only what the map does to holes, and it stays the same however the map is bent. On a torus it is one determinant: |det(I − A)| fixed points, checked exactly on all 2,401 small matrices, 1, 5, 16, 45, 121 periodic points for Arnold's cat, and a formula that also counts solutions of equations over finite fields.
Peaks, pits and passes
Take any lumpy closed surface and any direction of height. Peaks plus pits minus passes is 2 on a sphere and 0 on a torus, whatever the lumps, in every direction. Average one vertex's score over all directions and it becomes the corner's angle defect, computed from nothing but comparisons. So Gauss–Bonnet follows from a count of which neighbours lie higher.
Named alongside it
The objects these essays reach for when they reach for this one.
Euler characteristicGenusInvariantPolyhedronSimulationBilliardsCounting argumentCurvatureEquidistributionEuler formulaFibrationFundamental group