Theme

The same thing twice — page 13

Two constructions that look unrelated and turn out to be the same object wearing different clothes.
The core of a market with two houses and two buyers. The core of an assignment game drawn in the plane of buyer A's payoff against buyer B's, a polygon with vertices (0, 1), (0, 0), (1, 0), (4, 3), (2, 3); the buyers' best corner is (4, 3). Applied

The prices nobody can break away from

When houses are sold to buyers who value them differently, there is a whole range of prices at which nobody wants to walk away, and it has a remarkable shape — one corner best for every buyer at once, one best for every seller at once, and the buyers' corner pays each buyer exactly what the market would lose without them.

A 33 × 32 rectangle cut into 9 unequal squares. A squared rectangle of 9 squares with sides 18, 15, 14, 10, 9, 8, 7, 4, 1, each labelled with its size. Computation

A rectangle made only of squares

A rectangle can be cut into finitely many squares — of any sizes, as many as wanted — exactly when its two sides are in whole-number proportion. Max Dehn proved it in 1903, and the proof that stuck, found by four Cambridge undergraduates in 1940, reads the squares as currents in an electrical circuit.

A triangulation of the square with 7 three-coloured triangles. A triangulation of the unit square into 34 triangles, vertices coloured by Monsky's rule, with the 7 triangles carrying all three colours shaded. Computation

No odd number of equal triangles

A square can be cut into two triangles of equal area, or four, or any even number. It cannot be cut into three, or five, or any odd number — whatever shapes the triangles take. Paul Monsky's proof of 1970 has no geometry in its engine at all: it colours the points of the plane by how divisible their coordinates are by two.

The Collatz map on the 2-adic integers, before and after changing to parity coordinates. Two scatter plots of 2048 points: the Collatz map on 2-adic integers in binary-digit coordinates, a scattered cloud, and the same map in parity-vector coordinates, where every point lies on the two lines of the doubling map. Dynamics

Where the Collatz map is a coin

Extend the Collatz map from the whole numbers to the 2-adic integers — binary strings that run on for ever to the left — and it stops being mysterious. It becomes, after a change of coordinates, the simplest chaotic system there is: shifting a string of coin tosses one place. Everything about it is then known, and none of it says anything about the whole numbers, which is the most instructive failure in the whole story.

The Voronoi diagram of points on a shape's boundary, and the axis it traces. 50 boundary samples of a shape with their Voronoi cells clipped to the shape; the cells' interior corners line up along the medial axis. Geometry

The skeleton inside a shape

Take the Voronoi diagram not of a handful of points but of a shape's whole outline: the points inside the shape that have two nearest points on its edge. What comes out is a skeleton — a thin branching tree that describes the shape and, with one number attached to each point, rebuilds it exactly. It is also where fires lit all round the edge would meet, and it is violently unstable: a tooth too small to notice grows a branch several times its own size.

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. Geometry

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.

A program whose output is its own text. The 32-character program (f=>f(f))(f=>"(f=>f(f))("+f+")") beside its output, which is identical. Logic

The program that prints itself

The diagonal argument has always been used to destroy — to show that a list misses something, that a sentence cannot be proved. Run the same move the other way and it builds. Kleene's recursion theorem says every program can be given its own text to work with, and the proof is a program that prints itself, thirty-two characters long, which can be run and checked.

Error against the number of points for three randomised methods. Log-log plot of root-mean-square integration error against N from 16 to 4096 for plain Monte Carlo (slope -0.52), digitally shifted Sobol' points (-1.00) and Owen-scrambled Sobol' points (-1.43). Probability

An error bar for points that are not random

Evenly spread points integrate far better than random ones and give no error bar; random points give an error bar and integrate badly. Randomise the even points themselves — shift a lattice by a random vector, or scramble the digits of a Sobol' sequence — and both are kept: an unbiased estimate, a confidence interval from a handful of repeats, and an error that falls faster than any deterministic set's.

Counting overlapping targets from sensor counts alone, by integrating against χ. A 36 by 32 grid of sensor counts from 7 overlapping discs; the sum of the Euler characteristics of the level sets is 7. Topology

Counting targets by their holes

The Euler characteristic adds up like an area: glue two shapes together and it is the sum of theirs minus that of their overlap. So it can be used to measure, and measuring with it does something no area can. A field of sensors that each report only how many targets they detect — not which, not where — can have its readings added up, weighted by the Euler characteristics of the regions where the count is high, and the answer is exactly the number of targets.

All themes