Concept

Symmetry

A transformation that leaves an object looking exactly as it did before. The symmetries of an object form a group, which is what makes symmetry a thing to compute with rather than merely to notice.

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

Completing the square, as a square. An x by x square with the strip split in half and laid along two sides, leaving a square hole of side 1.5. Filling the hole costs 2.25 and buys a perfect square.

Completing the square, by completing a square

The step everybody is taught as an algebraic trick is a literal instruction about a literal square. There is a corner missing, its size is forced, and paying for it is the whole method.

algebra · Completing the square
One cake, one halving cut at 4/9, and two measures of it. A cake as a bar with two step valuations above and below it, the cutter's halving cut marked, and a table of both people's exact value of each piece.

One cuts and the other chooses

The oldest rule in fair division promises each of two people at least half the cake by their own measure, and it keeps that promise exactly. It does not promise what the word "fair" is usually asked to carry, and the gap opens the moment the two measures disagree across the cut.

applied · Fair division
Every relabelling of a 4-gon's corners, and the 8 that are motions. All 24 permutations of the corners drawn one by one, with the 8 that preserve every distance marked; the rest deform the polygon and are not symmetries.

Eight ways to leave a square alone

A square can be picked up and put back so that nothing looks different. There are exactly eight ways to do it, and the number is not taken on trust here — it is what a search through all twenty-four relabellings of the corners comes back with.

algebra · Symmetry groups
16 colourings in 6 classes. Every way of colouring the corners, with the ones a motion carries to each other placed on the same row; the number of rows is the number of genuinely different colourings.

Colourings nobody can tell apart

Sixteen ways to colour four corners in two colours, and only six of them are genuinely different. The count can be got by pooling the sixteen — or by never forming a single class and instead averaging how many colourings each motion leaves untouched.

algebra · Symmetry groups
One perimeter of 300, spent five ways. Regular polygons all of the same perimeter, drawn to scale beside the circle of that perimeter, with the area each encloses and the ratio 4πA/L².

The most area a fence can hold

One length of boundary, and the question of what shape to bend it into. The answer is a circle, everybody knows it, and the argument that convinced the nineteenth century turned out to prove something slightly different.

geometry · Isoperimetric
Nine points of a triangle, on one circle. A triangle with the midpoints of its sides, the feet of its three altitudes and the midpoints from each corner to the orthocentre marked; all nine lie on a single circle of half the circumradius.

Nine points on one circle

Three midpoints, three feet of altitudes and three more midpoints. Nine points defined in three unrelated ways, on an arbitrary triangle, and all nine sit on one circle — checked here on two hundred and forty triangles as well as on the drawn one.

geometry · Triangle centres
The dihedral group of a 4-sided shape, drawn as a map. A Cayley graph: one dot per motion of the shape, with one arrow per generator, so that multiplying by a generator is following an arrow of that colour.

The group drawn as a map

A multiplication table says everything about a group and shows nothing; lay the same information out as one dot per element and one arrow per generator, and multiplying becomes walking, distance becomes a word length, and the group acquires a shape.

algebra · Cayley graph
The permutation (1 3 4 2) drawn as 4 strings, crossing 3 times. A permutation drawn as strings running from a row of numbered pegs to another, with every place two strings cross marked, and the crossing count checked against the number of pairs that are out of order.

The crossings that will not come out even

Draw a rearrangement as strings from one row of pegs to another and count where they cross. The count depends on how the strings are drawn; whether it is odd or even does not, and that single bit is what makes determinants exist and a sliding puzzle unsolvable.

algebra · Permutation parity
The quaternion multiplication table, from i² = j² = k² = ijk = −1. A four-by-four multiplication table of the quaternion units, with the row giving the left factor, every entry computed from Hamilton's rule, and the pair that differs between the two orders marked.

A multiplication that remembers the order

Four characters — i² = j² = k² = ijk = −1 — define a multiplication in which ab and ba are different numbers. Everything follows from them, including the fact that a rotation of a solid body has two names, and that two full turns are needed to get one of them home.

algebra · Quaternions
Every order of arrival for three partners, and what each player adds. A table with one row per order in which the players could arrive, giving what each adds to the group already present, and the average of each column as that player's share.

The order everybody arrives in

Three people jointly earn nine, and the question is what each is owed. Ask instead what each adds on walking into a room the others are already in, average that over every order they could have arrived in, and four modest conditions leave no other answer.

applied · Shapley value
Drop one condition, and something else satisfies the rest. A column for each of the four conditions, holding a sharing rule that breaks that one and keeps the other three, with the split each rule gives on a stated four-player game.

None of the four conditions is spare

Four conditions pick out one sharing rule. The half that is usually shown is that they are enough; the other half is that each is needed — drop any one and a different rule satisfies the rest, so the list cannot be shortened.

applied · Shapley value
A walk on a weighted graph, and a cycle whose traffic goes one way. A weighted graph with the long-run share of each state read off its total weight, beside a three-state cycle whose shares are equal and whose traffic circulates.

The chain that runs the same backwards

Put weights on the edges of a graph, step to a neighbour in proportion to them, and the long-run share of a state is its own weight over the total — read straight off the picture, with nothing to solve. The condition that makes that work is strictly stronger than being stationary.

probability · Markov chains
The one line from which the nearfield plane looks Desarguesian. A grid of the 91 lines of the nearfield plane of order nine shaded by how many of 40 Desargues configurations with that line as axis failed; only the line at infinity has none, and every other line at least 20.

A plane no field built

Every finite field builds a projective plane, and for a long time every known plane was built that way. The plane over Dickson's nearfield of order nine has ninety-one points, ninety-one lines and every incidence right — and Desargues' theorem fails in it on most configurations tried, except for one line, from which it never fails at all.

computation · Finite geometry
Area out to infinity, for three powers. Left: the curves 1/√x, 1/x, 1/x² from x = 0 to 10, with the region beyond x = 1 shaded under the lowest. Right: the area from 1 to T for each, on logarithmic scales, for T up to 10^6. 1/√x keeps growing, 1/x keeps growing, 1/x² levels off at 1.

An endless region with a finite area

A region that runs off to infinity can still have a finite area, and for the curves 1/xᵖ the exponent that makes the far end finite is exactly the one that makes the end at zero infinite. 1/x fails at both, no power succeeds at both, and a horn can hold less than π while needing infinite paint.

analysis · The integral
Fair bits from a biased coin. 44 flips of a coin biased 0.7 towards 1, read in 22 pairs. Mixed pairs are kept and give their first bit; matched pairs are discarded. Over a long run the output is 50.2% ones, at 0.210 output bits per flip.

Fair bits from an unfair coin

Read a biased coin's flips in pairs, keep 01 as 0 and 10 as 1, and throw away the rest: the output is exactly fair, whatever the bias, and nobody needs to know the bias. The trick wastes most of the coin, the waste can be recycled almost up to the ceiling Shannon's entropy sets — and it fails quietly the moment the flips remember each other.

computation · Pseudorandomness
Rule 184 at density 0.30. A space-time diagram of rule 184 on a ring of 120 cells, 80 steps down the page, starting from a random row with 36 cars. The diagonal stripes are free-moving cars; the jams dissolve.

A road where nobody overtakes

Rule 184 moves every 1 one cell to the right whenever the cell ahead is empty. It is one of only five elementary rules that never change the number of 1s, and that single property turns it into a model of traffic with an exact transition: below half density every jam dissolves, above it jams can never all clear and drift backwards against the flow.

dynamics · Cellular automata
Böröczky's 12 points and their 6 ordinary lines. A disc standing for the projective plane: the 6 corners of a regular polygon inside, and 6 points at infinity marked in pairs on the rim. All 22 connecting lines are drawn, the 6 ordinary ones solid.

The fewest ordinary lines a polygon allows

Take the corners of a regular polygon and add the points at infinity where its parallel chords meet. Every chord then carries three points, the line at infinity carries all the new ones, and the only lines left with exactly two points are the tangents at the corners — half as many as there are points. Dirac guessed in 1951 that nothing does better, and Green and Tao proved it in 2013.

geometry · Ordinary lines
Credit for one prediction, three ways of leaving an input out. Groups of bars, one group for each way of filling in the inputs that are not known, each bar one input's share of the difference between the prediction and the starting value.

What a missing input is worth

A model prices a house at 180 from its size, its garden and its bedrooms, and the question is how much of the price each input is responsible for. Make the inputs the players and the average over orders answers it — once somebody decides what the model says when an input is not known. Three reasonable decisions give bedrooms nothing, nothing, and sixteen, for a model that never reads them.

applied · Shapley value
Shares on two triangles and a go-between. A network of players with each node labelled by its share of what the whole network earns, and its number of links beneath it.

Cutting a link costs both of its ends the same

Three players, any two of whom can earn 1 together — but only if they are linked. Link all three and each is due a third. Remove one link and the player holding both of the others is due two thirds. Averaging over orders on the game the network allows is the one rule under which breaking any link costs the two players it joined exactly the same, and it pays go-betweens more than their links.

applied · Shapley value
One symmetrisation: every chord slid to the middle. A lopsided shape with a dent beside its Steiner symmetrisation about a horizontal line, with a few vertical chords marked in both: the chords keep their lengths and are centred on the line.

Every chord slid to the middle

Take a shape, pick a line, and slide every chord that crosses the line at right angles until the line cuts it in half. The area cannot change, the boundary can only get shorter, and the result is symmetric. Do it again about another line, and another, and the shape is squeezed towards a disc — unless the lines are badly chosen, in which case it stops short.

geometry · Isoperimetric
Switching envelopes when the largest amount is 64. A bar chart of the probability-weighted gain from switching at each amount that might be seen, 1 to 64: small positive bars and one large negative bar, adding to zero.

The envelope that always looks better

Two envelopes, one holding twice as much as the other. Open one, see an amount, and reason that the other holds double or half with equal chance — so switching gains a quarter on average. By symmetry the same argument says switch back. The step that fails is not the arithmetic; it is the claim that double and half are equally likely whatever amount is seen, which no honest prior allows — and there is one prior under which the other envelope really does look better at every amount.

probability · Bayes
The 9 mirrors of the octahedral group, cutting the sphere into 48 triangles. A sphere crossed by the 9 great circles of the octahedral group's mirror planes, dividing it into 48 triangles with one shaded.

Three mirrors make every solid

Every symmetry of a regular solid, reflections included, is produced by just three mirrors meeting at its centre, reflected in one another over and over — a kaleidoscope. Put a single point between the three mirrors and its reflections are the corners of a solid: the regular solid itself if the point sits in a corner, and every one of its truncated and expanded relatives if it sits anywhere else.

geometry · Regular polyhedra
Every power of x that draws a hyperoval, in the planes of order 4 to 4096. q = 4: 1 exponents in 1 classes (conic); q = 8: 3 exponents in 1 classes (conic); q = 16: 3 exponents in 1 classes (conic); q = 32: 11 exponents in 3 classes (conic, translation/Glynn I/Glynn II, Segre); q = 64: 3 exponents in 1 classes (conic); q = 128: 23 exponents in 5 classes (conic, translation, Segre/Glynn II, translation, Glynn I); q = 256: 9 exponents in 2 classes (conic, translation); q = 512: 27 exponents in 5 classes (conic, translation, Segre, translation, Glynn I/Glynn II); q = 1024: 9 exponents in 2 classes (conic, translation); q = 2048: 45 exponents in 8 classes (conic, translation, Segre, translation, translation, Glynn II, translation, Glynn I); q = 4096: 9 exponents in 2 classes (conic, translation).

Every power of x that draws a hyperoval

In a plane of order 2^h, the graph of x^k plus two points at infinity is sometimes a hyperoval — as many points as a plane allows with no three in line. Searching every exponent in every plane from order 4 to 4096 finds hundreds that work, and once six symmetries of the problem are applied they fall into exactly the families already known: the conic, the translation curves, Segre's x⁶ and Glynn's two. Whether that list is complete in every order is open.

computation · Finite geometry
A knot drawn with three sines: 5₂ as a Lissajous knot. Frequencies 2, 3, 7 with phases 0.1, 0.7, 0.3; 7 crossings from above; Alexander polynomial 2t − 3 + 2t⁻¹; determinant 7.

Three sines tie a knot

Let a point move with a different sine wave in each of the three directions of space, the three frequencies whole numbers with no common factor, and it traces a closed curve that is usually knotted. With frequencies 2, 3 and 7 the curve is the knot 5₂. The trefoil, the simplest knot of all, can never be made this way: the half-turn that shifting time by half a period performs forces a condition on the knot's polynomial that the trefoil fails.

analysis · Circular functions
The 11 trees on 7 points, and how many labellings each has. All trees on 7 points with their numbers of symmetries and of distinct labellings; the labellings add to 16807.

Almost every tree can be turned over

Cayley's n^(n−2) counts trees with labels on their points. Take the labels off and the count has no formula, because a symmetric shape absorbs labellings: the star on seven points can be labelled only seven ways, the one asymmetric shape 5,040. The bookkeeping that reconciles the two counts says something unexpected — almost every tree, labelled or not, can be turned over onto itself, where almost every graph cannot.

discrete · Labelled trees
The butterfly: wings that cut a chord equally. A circle with chord PQ, its midpoint M, two chords through M, and the wings AD and BC meeting PQ at X and Y, each 0.476 from M.

Wings that cut a chord equally

Take a chord of a circle and its midpoint. Draw any two more chords through the midpoint, join their ends crosswise, and the two crossing lines — the butterfly's wings — cut the first chord at equal distances from the middle. The proof is the inscribed angle and the power of a point working together; move the point off the middle and what survives is a law about reciprocals; replace the circle by any conic and the theorem does not notice.

geometry · Inscribed angle
Records in a thousand draws, and the lengthening waits between them. A sequence of 1000 uniform draws on a logarithmic position axis, with records at positions 1, 6, 11, 27, 36, 145, 539, 927.

A wait that ends and has no average

Draw a number, then keep drawing until one beats it. Half the time the very next draw does. The wait is certain to end, it is usually short, and its average is infinite — and the chance of still waiting after n draws is exactly 1/(n + 1), whatever the numbers are drawn from, because symmetry is the only thing the calculation uses.

probability · Expectation
Where charges settle on a sphere. N=4: E=3.674234614, distinct minima from 8 starts: 1; N=6: E=9.985281374, distinct minima from 8 starts: 1; N=8: E=19.675287861, distinct minima from 8 starts: 1; N=12: E=49.165253058, distinct minima from 8 starts: 1; N=20: E=150.881568334, distinct minima from 8 starts: 1; five charges: bipyramid 6.474691, best square pyramid 6.483661.

Where charges settle on a sphere

Put equal electric charges on a sphere and let them push each other apart until nothing moves. Four settle at the corners of a tetrahedron, six of an octahedron, twelve of an icosahedron — but eight do not make a cube, and twenty do not make a dodecahedron. The cube loses to two squares turned half a corner apart, because charges on a sphere prefer triangles; and however many charges there are, exactly twelve more of them have five neighbours than have seven.

geometry · Regular polyhedra
A partition in two directions is a pile of cubes. Plane partition 5 4 3 1 / 4 3 2 / 3 2 1 / 1 of 29, drawn as stacked cubes; PL(29) = 3759612.

A partition piled into a corner

A partition is a row of numbers that never increases. Let it never increase down the columns too, and it becomes a pile of cubes pushed into the corner of a room. MacMahon counted the piles with one change to Euler's product — each part size k in k colours — and in a box with a product over its cells. The second direction moves the growth from e^(√n) to e^(n^(2/3)), puts ζ(3) where π was, and makes a count that grows with a box's area. One direction further, his guess fails at six.

number · Partitions
Random points and the hull around them. triangle: 13 hull corners of 400 points; square: 17 hull corners of 400 points; disc: 22 hull corners of 400 points.

The corners of a random hull

Drop ten thousand points at random into a triangle and stretch a band round them: about twenty points touch it. Drop them into a disc and about seventy-three do. The count grows like a logarithm in one shape and like a cube root in the other, and the reason is where the boundary bends.

analysis · Convexity
The largest hexagon of diameter one. Regular hexagon of diameter 1: area 0.649519053; best hexagon: area 0.674981443, 6 pairs at distance 1; vertices (0.3438, -0.3253) (0.5000, 0.2115) (-0.0000, 0.6138) (-0.5000, 0.2115) (-0.3438, -0.3253) (-0.0000, -0.3862).

The largest polygon of diameter one

Among pentagons whose points are never more than one unit apart, the regular pentagon has the most area, and the same is true for every odd number of sides. For six sides it is false: a lopsided hexagon found in 1975 beats the regular one by four per cent. Symmetry wins half the cases and loses the other half, and the reason is parity.

geometry · Isoperimetric
Seven points that meet every line. q=4: minimum nontrivial blocking set 7 points {16,1,3,6,4,18,17}; meet histogram {"1":14,"3":7}; size 6 ruled out after 3125 nodes.

The fewest points that meet every line

In a finite plane any line meets every other line, so a single line is a set of points that every line passes through. Ask for such a set that contains no whole line and the answer is surprisingly expensive: in the plane of order 7, which has 57 points, it takes 12, and an exhaustive search over seventy-one million branches shows that 11 will not do. Two theorems predict the number — a square-root bound met by a copy of a smaller plane, and a bound of three halves for prime orders met by three half-lines.

computation · Finite geometry
Six entries that fix a Latin square. n=5 cyclic: min defining set 6; triangle set {0,1,5,19,23,24}; forcing steps 0,0,3,2,1,0,5,4,3,2,3,4,5,4,3,2,3,4,5,0,1,2,3,0,0.

The fewest entries that fix a Latin square

Reveal six of the twenty-five entries of the cyclic Latin square of order five — three in the top left corner, three in the bottom right — and only one Latin square agrees with them; reveal any five and at least two do. John Nelder conjectured that a square of order n can never be pinned down by fewer than ⌊n²/4⌋ entries. A search over every set of cells confirms it for every square to order five, and finds that the more symmetric a square is, the fewer entries it takes.

computation · Latin squares
Three ways to draw a random chord. Samples of 220 chords from each of three procedures: random ends, random radius and random midpoint; chords longer than the triangle's side are coloured; chances 1/3, 1/2 and 1/4.

What a random chord is

Draw a chord of a circle at random. How often is it longer than the side of the inscribed equilateral triangle? Pick two random points on the rim and the answer is 1/3. Pick a radius and a random point on it, and the answer is 1/2. Pick a random midpoint in the disc, and the answer is 1/4. All three calculations are correct, and Bertrand published them in 1889 to warn that the phrase had no meaning. Eighty-four years later Jaynes argued that one answer is right after all.

probability · Monte Carlo
Five ellipses, every combination once. A rotationally symmetric Venn diagram of five congruent ellipses (centre distance 0.7, semi-axes 1.4 and 0.5, tilted 7.5°): 32 regions on a raster, 30 crossing points.

Venn diagrams that turn into themselves

A Venn diagram shows every combination of in and out exactly once. Ask for one that looks the same after a turn of 1/n, each curve rotating onto the next, and a counting argument forbids it unless n is prime. Five congruent ellipses manage it, certified by Euler's formula; four rotated copies cannot, and it took until 2004 to show that every prime can.

logic · Class diagrams

Named alongside it

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

Exhaustive searchInvariantCircleCooperative gameCounting argumentGroupGroup actionIncidenceMarginal contributionPermutationProjective planeRegular polygon

All concepts