Concept

Dihedral group

All the rotations and reflections that leave a regular polygon occupying the same place. It has twice as many elements as the polygon has sides, half of them turns and half of them flips.

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

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
A subgroup of 2, and the 4 blocks it cuts the group into. The 8 symmetries of a 4-gon, split into 4 blocks by composing every element onto the subgroup {e, r²}. The blocks all have 2 elements and no element is in two of them.

The blocks a subgroup cuts out

Take any part of a group that is closed under composition, and it slices the whole group into blocks of its own size that do not overlap. Everything Lagrange's theorem says is arithmetic about that picture — and whether the blocks can be multiplied is a separate question with a surprising answer.

algebra · Symmetry groups
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
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
Orbit times stabiliser is 8, on every row. A table of 5 things the 8 symmetries of a 4-gon can move. Each row draws every position the thing can be carried to and lists the motions that leave it where it is; the two counts multiply to 8 on every row.

Twenty-four ways to set a cube down

Count the rotations of a cube from its corners and the answer is eight times three. Count from its edges and it is twelve times two; from its faces, six times four. Three different pictures give one number because each count is the same theorem — the places a thing can go, times the motions that leave it where it is — and the same theorem splits Cayley's sixteen trees into twelve and four and proves that a group of eight has a centre.

algebra · Symmetry groups
36 3-tuples with product e, and the 3 that no turn moves. Every ordered choice of 3 elements of the 6 symmetries of a 3-gon whose product is the identity, in cards grouped by cyclic turning. 3 cards hold a single tuple repeating one element; the other 11 hold 3 each.

Necklaces made of symmetries

Lagrange's theorem says a subgroup's size divides the group's, and the converse is false. One piece of the converse is true: every prime that divides the size is the order of some element. The proof threads the group's own elements onto a necklace whose product is nothing, turns it, and counts — the argument that proved Fermat's little theorem with beads, with the beads replaced by motions.

algebra · Symmetry groups
Which pairs of the square's symmetries commute: 40 of 64. A 8-by-8 grid over the elements of the 8 symmetries of a 4-gon, rows and columns grouped into 5 conjugacy classes, with a filled square wherever the two elements commute: 40 filled squares, and each row's count of filled squares written at its end.

Five-eighths of the pairs, and no more

Pick two symmetries of a square at random and do them in both orders: forty times in sixty-four the result is the same. No group that fails to commute does better. The reason is a count of pairs that turns into a count of conjugacy classes, and a two-line argument about the centre that caps the answer at five-eighths — reached by the square and the quaternions, approached from above by nothing, and approached from below by groups that commute a little more than half the time.

algebra · Symmetry groups
No pair of weights modulo ten catches everything. Two 10 × 10 grids over pairs of alternating weights modulo ten, shaded by the share of single errors and of swaps each catches. No pair is full in both; weights 3 and 1, ringed, catch every single error and 88.9% of swaps.

Ten digits need a symmetry that does not commute

A check digit should catch one wrong digit and two neighbours swapped. Over eleven symbols a weighted sum does both; over the ten decimal digits no weighted sum can, no scheme of any shape built on adding modulo ten can, and the reason is the same as the reason Euler's thirty-six officers cannot be paraded. What works is the ten symmetries of a pentagon, which do not commute.

computation · Error-correcting codes
Every swap-proof scrambling, graded on twins and jump swaps. 34040 permutations; twin errors caught range 50–86 of 90, jump transpositions 600–848 of 900; Verhoeff's at (848, 86).

The best of thirty-four thousand scramblings

Verhoeff's check digit multiplies digits in the symmetry group of a pentagon after scrambling each one a different number of times, and 34,040 scramblings make it catch every swap of neighbours. Graded on the rarer errors, none of them catches everything, the best catch 86 of 90 doubled-digit slips and 848 of 900 swaps across a digit — and the scrambling Verhoeff published in 1969 is one of the forty that are best at both.

computation · Error-correcting codes
Even quartics never have the full group, and one step away almost all do. Even quartics x^4 + bx^2 + d to 20: reducible 199, S4 0, A4 0, D4 1338, C4 20, V4 124. With +x: reducible 157, S4 1524, A4 0, D4 0, C4 0, V4 0.

The quartics whose roots stay paired

A quartic can have five different Galois groups, and in a box of nearly fourteen million quartics they do not come in order of size. The eight-element group D₄ outnumbers the twelve-element A₄ thirty-five to one. Every even quartic has a smaller group than S₄, and moving one step off that plane restores the full group almost everywhere.

algebra · Galois correspondence

Named alongside it

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

Group actionCounting argumentCyclic groupLagrange theoremPermutationCosetExhaustive searchOrbitStabiliserSymmetryAlternating groupCheck digit

All concepts