Matpic
mathematics, in pictures
Concept

Polytope

The generalisation of a polygon and a polyhedron to any number of dimensions, bounded by flat pieces of one dimension lower. Regular ones are infinite in number in two dimensions, five in three and six in four, after which exactly three exist in every dimension.

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

The splits no group can beat, for three partners. The triangle of ways to split a fixed total between three players, with each coalition's demand drawn as a straight cut across it, and the region surviving every cut shaded.

A split nobody can walk away from

Every way of dividing what a group earns is a point of a triangle, and every coalition's threat to leave cuts a straight line across it. What survives all the cuts is the set of stable divisions — and for one three-player game there is nothing left.

applied · The core The regular solids of four dimensions. 5-cell, tesseract, 16-cell, 24-cell, each turned in four dimensions and projected to the page; the edges are the pairs of vertices at the shortest distance apart.

Six in four dimensions, and three forever after

The count of regular solids goes five in three dimensions, six in four, and then three in every dimension above — for good. Four dimensions is the last place anything unusual happens, and it happens twice.

geometry · Regular polyhedra The 14 triangulations, joined by single flips. The flip graph of a 6-gon: 14 triangulations drawn as small polygons and joined by 21 edges, one for each pair differing in a single diagonal.

The solid whose corners are triangulations

Take the triangulations of a hexagon as points and join two of them when a single diagonal can be swapped for another. The result is not merely a graph — it is the edge skeleton of a genuine convex polyhedron, with fourteen corners, three square faces and six pentagonal ones.

discrete · Catalan numbers Four solids with the same counts and every volume. The Reeve tetrahedra at heights 1, 2, 3, 5, drawn in wireframe with a table of their lattice-point counts and volumes. All have four boundary points and none inside; their volumes run from 0.17 to 0.83.

The theorem that has no version in space

A lattice polygon's area is decided completely by two counts of dots. The obvious guess is that a lattice solid's volume is decided by the same two counts in three dimensions, and there is a family of tetrahedra with identical counts and every volume that says otherwise.

discrete · Pick theorem The 6 corners, and nothing in between. The 6 permutation matrices of size 3, drawn as grids. A search over every table of shares on a fine grid finds these and only these as corners of the set.

The corners are whole assignments

A table of shares can be written as a lottery over whole assignments, which the anchor's first rung demonstrates on one example. The general statement is that the corners of the set of such tables are exactly the whole assignments, and that single fact is why the whole subject is easy.

applied · Assignment One table of shares, two different lotteries. A doubly stochastic table decomposed into whole assignments twice, by two different orders, giving two mixtures that reconstruct the same shares.

One table, two lotteries

A table of shares says what fraction of each task each person does. It does not say how — the same table is a mixture of whole assignments in many different ways, and the differences are exactly what the people being assigned would care about.

applied · Assignment The corner that is a half on every edge. A 3-vertex graph beside a table of the 5 corners of its matching relaxation. 4 are whole and one assigns a half to every edge.

Where the corners stop being whole

Everything on this ladder rests on one property — the relaxation of the assignment problem has whole-numbered corners. Add a single edge that closes an odd cycle and the property fails, a corner appears with a half in every coordinate, and the problem changes character completely.

applied · Assignment

Named alongside it

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

AssignmentConvexityDimensionFairnessIntegralityLinear programmingMatchingPermutationSimplexAllocationAssociativityBipartite

All concepts