Recently added

What's new

Essays arrive in groups rather than one at a time. The most recent group is below in full, and every earlier one after it, newest first.

Essays arrive in groups rather than one at a time, and a group usually opens up a subject not covered before. Between one group and the next nothing changes, so a reader who has seen the most recent group has seen everything.

28 September 2026

22 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

The same two lengths at 3 angles, and the area largest at the right angle. Parallelograms spanned by columns of lengths 1.6 and 1.25 at angles 38, 90, 142 degrees. Their areas are 1.23, 2.00, 1.23; the bound 2.00 is the product of the lengths and is reached only when the columns are perpendicular. Algebra

The biggest box built from signs

Fill a square table with plus and minus ones and ask how large its determinant can be. The columns all have the same length, so the answer is a box with fixed edges — largest when every corner is square, which is possible only when the size is a multiple of four.

7 figures
A map that folds the plane over itself, with every point still counted once. The map (u, v³ + uv): its domain shaded by the sign of the Jacobian determinant and its image with the grid carried across. At 5 marked target points the preimages number 3, 3, 1, 1, 1 and their signed counts are all 1; the determinant integrates to 4.447, equal to the integral of the signed count. Algebra

The count a fold cannot change

A curved map can fold the plane over itself, so that one point has three preimages and its neighbour has one. Count each preimage with the sign of the determinant there and the jump disappears — the signed count is the same everywhere, and it is a whole number.

6 figures
The best degree-3 polynomial to eˣ: its error touches its largest size 5 times. The error curve of the best uniform polynomial approximation of degree 3 to eˣ on the interval from −1 to 1. It reaches its maximum size 5.528 × 10⁻³ at 5 points, alternately above and below, at x = -1.000, -0.682, 0.050, 0.732, 1.000. Analysis

The error that keeps coming back to its worst

Judge a polynomial by its largest error on an interval and there is exactly one best one of each degree. It is recognised without comparing it to anything else — its error rises to the same largest size, alternately above and below, one more time than there are coefficients.

6 figures
A disc of radius 0.2 and an ellipse of size 1.22 around the same interval. For 1/(1 + 25x²): the interval from −1 to 1 on the real axis, poles at 0 + 0.2i and 0 − 0.2i, the Taylor disc at 0 of radius 0.20, and the Bernstein ellipse with foci ±1 through the poles, with ρ = 1.2198. Analysis

An ellipse, not a disc

A Taylor series converges on a disc, and the disc's radius is the distance to the nearest singularity. Ask instead how well polynomials can follow a function on an interval, and the answer is an ellipse with the interval's ends as its foci — the largest one the function is smooth inside.

6 figures
3 moves along the edges to the corner that maximises 2x₁ + 3x₂. The simplex method on a two-variable program with 5 constraints, started at the origin. It visits (0, 0), (0, 8), (1, 8), (5/2, 15/2), with objective values 0, 24, 26, 55/2, and stops where the prices on both binding constraints are non-negative. Applied

Prices at every corner

The duality theorem says a linear program's best value equals its dual's, and says nothing about how to find either. The simplex method finds both at once — it walks from corner to corner, and at each one asks the constraints that meet there for prices. A negative price names an edge that climbs; when none is negative, the prices are the proof.

6 figures
Eight corners of a squashed cube, visited in order by the simplex method. Klee and Minty's program in 3 variables drawn as its own deformed cube and as a plain one. The simplex method with the largest-price rule visits all 8 corners, with objective values 0, 4, 6, 10, 15, 19, 21, 25; the optimum is one edge from the start. Applied

The cube that takes every corner

The simplex method is fast on every program anybody meets in practice. In 1972 Victor Klee and George Minty squashed a cube so that the method, choosing the steepest edge each time, visits all of its corners — 2ⁿ − 1 moves in n variables, with the optimum one edge from the start.

6 figures
A straightedge construction on a circle, and the same construction moved by a map that keeps the circle. Two copies of one straightedge construction on a circle — six points, five chords and their crossings — the second the image of the first under a projective map fixing the circle. Chords and crossings correspond exactly, but the centre (orange) is carried to (0.551, 0.000). Computation

The centre a straightedge cannot find

Give a straightedge one circle and its centre, and it can do everything a compass can. Take the centre away and it cannot even find it again — because to a straightedge a circle has no centre. The maps that keep a circle and its straight lines are the motions of the hyperbolic plane, and in that plane the centre is a point like any other.

6 figures
The spiral of Theodorus, √2 to √17, built from square corners and a unit length. 16 right triangles with legs √k and 1 arranged in a spiral around a common corner; their long sides have lengths √2 to √17, and together they turn through 351.2 degrees. Computation

The lengths dividers cannot reach

A pair of dividers carries a length from one place to another and draws nothing. With a straightedge it finds midpoints, parallels and right angles, and it draws the regular 17-gon. It cannot draw a segment of length √(1 + √2) — and the reason is not on the page at all, but in the other root of the equation that number solves.

6 figures
12 points, a cup of 5 and a cap of 5. 12 points in general position with the longest convex-upward chain (5 points) and the longest convex-downward chain (5 points) marked. Discrete

Every crowd holds a bowl or a dome

Among enough points in the plane, some k of them always bend upward like a bowl or some l bend downward like a dome. The number that forces it is a binomial coefficient, it is exactly right, and it proves that every large enough crowd contains a convex polygon — with a bound nobody could lower to the true answer for eighty years.

6 figures
400 random points and their longest rising chain, 34 long. 400 uniform random points in a unit square with the longest chain increasing in both coordinates marked: 34 points, against 2√n = 40.0. Discrete

The longest climb of a shuffle

Erdős and Szekeres guarantee that any n distinct numbers hold a climb or a fall of √n, and there are orders that allow nothing more. Shuffle a deck at random instead and the longest climb is almost exactly 2√n — with fluctuations of size n to the power one-sixth, distributed exactly as the largest eigenvalue of a large random matrix.

6 figures
Where one Hénon orbit spends a million steps. A density map of 1000000 steps of one Hénon orbit counted into 420 × 140 cells: 2542 cells visited, half the time spent in 608 of them. Dynamics

Where the time goes on an attractor

A chaotic orbit's position is unpredictable within a few dozen steps. How it divides its time is not — start anywhere, follow long enough, and the fraction of time spent in each region comes out the same. That distribution lives on a set of no area, and among the infinitely many ways an orbit could spend its time, typical starts pick exactly one.

6 figures
A quadrilateral the Hénon map carries strictly inside itself. Hénon's trapping quadrilateral with corners (-1.33, 0.42), (1.32, 0.133), (1.245, -0.14), (-1.06, -0.5), the image of its boundary under the Hénon map lying strictly inside it, and an orbit on the attractor. Dynamics

A region the orbit cannot leave

That the Hénon map and the Lorenz flow have attractors takes two lines of arithmetic each — a region mapped strictly inside itself, a quantity that falls outside an ellipsoid. That the attractors are strange took a computer and twenty years for Lorenz, and for Hénon's classical parameters it has never been done. The difference between the two questions is the difference between a region and what lives in it.

6 figures
Three lines through a point, reflected in the bisectors, meet again. A triangle with a point P and its cevians, their reflections in the angle bisectors, and the point P* where the reflections meet — P's isogonal conjugate, at (373.8, 290.0). Geometry

Every point has a partner across the bisectors

Draw the three lines from the corners of a triangle through any point, reflect each in the bisector of its own angle, and the three reflections meet again. The pairing this makes swaps the centroid with the symmedian point and the orthocentre with the circumcentre, bends every straight line into a conic through the corners, and sends the circumcircle to infinity.

6 figures
Five triangles between the same two circles, every one closing. An outer circle of radius 1 and an inner of radius 0.38 at Euler's distance 0.4899; five triangles inscribed in the first and circumscribed about the second, started from different points. Geometry

A triangle that fits once fits everywhere

Put one circle inside another and try to fit a triangle between them, its corners on the outer circle and its sides touching the inner. Usually no triangle fits. But if one does, then one fits starting from every point of the outer circle — and whether it does is decided by a single equation in the two radii and the distance between the centres.

6 figures
The rationals and the dyadic fractions, matched 12 times without a crossing. Two number lines from 0 to 1, rationals above and dyadic fractions below, with 12 back-and-forth matchings: 1/2↔1/2, 1/3↔1/4, 2/3↔3/4, 1/4↔1/8, 3/4↔7/8, 2/5↔3/8, 1/5↔1/16, 3/5↔5/8, 4/5↔15/16, 2/7↔3/16, 1/6↔1/32, 3/8↔5/16. Logic

Two lists that are one order

The rationals and the fractions with a power of two below are different sets of numbers, and as orders they are exactly the same — any two countable orders that are dense and have no ends can be matched, point for point, keeping every comparison. The proof is a zigzag, and it settles every question the language of order can ask.

6 figures
The first 16 vertices of Rado's graph, joined by binary digits. Adjacency table and circular drawing of the Rado graph on vertices 0 to 15, where i < j are adjacent when bit i of j is 1; 32 edges. Logic

The graph that coin tosses always make

Take infinitely many vertices and toss a coin for every pair to decide whether they are joined. The result is random in every detail — and, with probability one, it is always the same graph. The same graph can be written down without any coins, by joining two numbers when one binary digit of the larger is a one.

6 figures
The 46 Farey fractions of order 12, and how far each strays from even spacing. Farey fractions of order 12 against 46 evenly spaced points, with the deviation of each drawn as a bar; largest deviation 0.0616. Number

How evenly the fractions spread

List every fraction between nought and one with denominator at most n, in order. They spread across the interval almost evenly, and how fast the unevenness shrinks as n grows is — exactly, provably — the Riemann hypothesis. The link runs through a second fact: set the fractions round a circle and add them as arrows, and what is left is a whole number.

6 figures
The 4 reduced forms of discriminant −84, each in its place. The reduced binary quadratic forms of discriminant −84 (x² + 21y²; 2x² + 2xy + 11y²; 3x² + 7y²; 5x² + 4xy + 5y²) plotted at their roots in the upper half-plane, all inside the modular fundamental region. Number

Counting the classes that break factorisation

The class number measures how badly unique factorisation fails in a field, and defined through ideals it looks impossible to compute. Gauss computed it by hand, for every field he wanted, by counting quadratic forms — and every form can be squeezed, by changes of variable that keep its values, into exactly one small standard shape.

6 figures
The narrowest door in two 6-cliques joined by one edge, and the gap it pins down. two 6-cliques joined by one edge, with the vertex set of smallest conductance coloured and the 1 edges leaving it thickened. Beside it a logarithmic ruler marks half the conductance squared, the spectral gap and twice the conductance, in that order from the bottom. Probability

The narrowest door sets the pace

How fast a chain forgets is an eigenvalue, and nobody can compute the eigenvalues of a chain worth studying. Cheeger's inequality trades the eigenvalue for a picture — the narrowest door in the state space — and pins the one between the square of the other and twice it. Both ends of that range are reached, on graphs small enough to search completely.

7 figures
How far a deck of 52 is from random after each riffle shuffle. A bar chart over one to 12 riffle shuffles of the exact total variation distance from a uniformly random deck. The bars stay near one for the first few shuffles and drop sharply around 8. Probability

The forgetting that happens all at once

A single small chain forgets its start gradually, a little more with every step. A family of large ones can do something different — stay almost perfectly informed about where it began, and then lose all of it inside a window far shorter than the wait. That cliff is the cutoff phenomenon, and it is why "seven shuffles" is an answer rather than a convention.

8 figures
Every way to cut a genus-2 surface into pairs of pants. 2 thickened graphs, one for each type of pants decomposition of the closed surface of genus 2, each with 2 coloured junctions and 3 cutting circles. Topology

Every surface is sewn from pants

A sphere with three holes — a pair of pants — is the smallest piece a surface with two or more handles can be cut into. Every such surface falls apart into them, and the Euler characteristic alone says how many pieces and how many cuts, however the cutting is done. What it does not say is the pattern, and the patterns are counted by drawing each one as a graph: two for two handles, five for three, seventeen for four.

6 figures
The seven-vertex torus, unrolled onto a lattice. A triangular lattice with every point labelled a + 3b mod 7 and fourteen triangles shaded as one copy of the torus. Topology

The fewest corners a surface needs

Build a closed surface from triangles, any two meeting along a whole edge, at a single corner or not at all, and ask for the fewest corners. Two lines of counting give a floor for every surface, in terms of its Euler characteristic alone. The torus meets it with seven, the projective plane with six — and the Klein bottle, which the counting says could be built from seven, cannot, as a search of every possible arrangement shows.

6 figures

Before that

Everything published earlier, newest first. Titles only — the cards are on the full listing.

22 September 2026

22 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

16 September 2026

44 essays on discrete, applied, analysis, number, probability, topology, geometry, algebra, computation, dynamics and logic

13 September 2026

22 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

9 September 2026

33 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

8 September 2026

21 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

5 September 2026

50 essays on geometry, discrete, topology, dynamics, computation, applied, probability, analysis, logic, number and algebra

23 August 2026

15 essays on geometry, discrete, topology, dynamics, probability, logic, computation, applied and algebra

22 August 2026

15 essays on number, geometry, probability, discrete, analysis and topology

Every essay, by subject · by subject · by thread · search