The collection

Every essay — page 2

Page 2 of 28, continuing through the fields in the same order.

Geometry Analysis Algebra Discrete Topology Probability Number Dynamics Logic Computation Applied What's new Series Concepts Search

Geometry

Shapes, and the arguments that can be made by rearranging them.

Every turn that leaves a cube where it was. A cube in wireframe beside a table of its rotation axes: 3 of order 4, 4 of order 3, 6 of order 2, totalling 24 turns including the one that does nothing.

The five solids as three groups

There are five regular solids and only three groups of rotations between them, because a solid and its dual share their symmetries exactly. The largest of the three is the smallest group with no way of coming apart, which is why the general equation of the fifth degree has no formula.

7 figures
Eight circles touching three. Three given circles and the eight circles tangent to all of them, each labelled by which of the three it contains and which it lies outside.

Eight circles touching three

Draw three circles. How many circles touch all three? The answer is eight, the count is a fact about signs rather than about geometry, and the classical way to find them is to move the problem somewhere it becomes easy.

6 figures
An Apollonian gasket, 125 circles in. The Apollonian gasket generated from four mutually tangent circles of curvature −1, 2, 2 and 3, drawn to 4 generations; every curvature in it is a whole number.

Curvatures that stay whole

Four circles touching one another satisfy an equation in their curvatures. Read it as a quadratic and the second solution is the first subtracted from something — so a packing that starts with whole numbers stays whole forever.

6 figures
Two inversions, and the number four points agree on. Four points, their images after one inversion and after a second in a different circle, with the cross-ratio computed at each stage; it is conjugated once and restored twice.

The number four points agree on

One inversion is a reflection and reverses orientation. Two of them compose to a motion, and what that motion leaves alone is a single number computed from any four points.

6 figures
Nineteen circles, one per vertex. A circle packing of a triangulation with seven interior vertices and twelve on the boundary: two circles touch exactly when their vertices are joined, and the radii were solved for rather than chosen.

Every flat graph is a pile of circles

A graph that can be drawn without crossings can be drawn in one particular way: as circles, one per vertex, touching exactly when their vertices are joined. The picture is not a choice — it is determined, up to the group two inversions generate.

6 figures
The triangulation as the underside of a hull. Eight points on a floor, lifted onto a paraboloid above them. The faces of the lifted set's lower convex hull are shaded, and their shadows on the floor are the Delaunay triangulation of the original points.

One dimension up, and the circles disappear

The Delaunay triangulation is defined by a condition about circles, which is awkward to compute and awkward to reason about. Lift every point onto a paraboloid and the circles turn into planes, the condition turns into convexity, and a two-dimensional problem is solved by looking at a three-dimensional shape from underneath.

6 figures
A scatter walking towards its own centres. 4 panels of the same 24 sites: the initial clumpy scatter and the Voronoi diagram after 1, 3, 12 rounds of Lloyd's iteration, with the cost falling to 52% of the scatter's as the cells even out.

Every site in the middle of its own cell

Move each point to the centre of mass of its own Voronoi cell, then redraw the diagram, then do it again. The rule is two lines long, it never mentions hexagons, and what it settles into is a honeycomb.

6 figures
The diagram when the sites are not the same size. 7 weighted sites drawn as circles of different radius, with the power diagram over them. The boundaries are straight, as in the unweighted diagram, but each one is pushed towards the smaller of the two circles it separates.

When the sites are not the same size

Give every site a weight and the boundaries slide. The cells stay convex and the edges stay straight, which is surprising, and one thing happens that the unweighted diagram never allows — a site can end up owning nothing at all.

6 figures
The shortest tree was already in the triangulation. The Delaunay triangulation of 20 sites in faint lines with the minimum spanning tree drawn over it in heavy ones. Every tree edge is a triangulation edge, and the circles on the longest few tree edges as diameters contain no other site.

The tree inside the triangulation

The shortest network joining a set of points is built from edges chosen by length, and the triangulation is built from edges chosen by an emptiness condition about circles. The two constructions share no step, and every edge of the first is an edge of the second.

6 figures
The two numbers that make up a width. A Reuleaux polygon with 3 sides, its centre marked as the origin, and the two supporting lines with normals 33° and 213°. The perpendicular distances from the origin to the two lines are marked; they add to the width.

The shape described from outside

A convex shape can be given by its boundary or by the family of lines that touch it, and the second description turns the constant-width condition into one line of arithmetic — after which the perimeter falls out, and curves with no corners at all can simply be written down.

6 figures
Area at equal width: the triangle least, the circle most. A bar for each curve of constant width the family draws, all at the same width, with the bar's length its enclosed area and the extremes marked.

The least area a width can hold

Barbier's theorem says every curve of constant width has the same perimeter, which removes perimeter as a way of telling the family apart. Area is not like that — the circle holds the most and the Reuleaux triangle the least — and the reason the minimiser has corners is a constraint rather than a preference.

6 figures
The Reuleaux tetrahedron's width runs from 2.83 to 2.9. The largest and smallest width of the intersection of four balls, plotted against the polar angle of the measuring direction, with the constant width it would need to have drawn flat.

The same question in space

Intersect four balls at the corners of a tetrahedron and the result is not of constant width — it misses by two and a half per cent, computed exactly. Repairing it gives a body that is, and whether that body is the smallest of its kind has been open for a century.

6 figures
Every ray aimed at one focus is turned towards the other. A hyperbola with its two foci and 13 rays aimed at the far one. Each strikes the near branch from outside and is turned towards the near focus — which is the property a Cassegrain telescope's secondary mirror uses.

Aimed at one focus, turned towards the other

An ellipse sends every ray leaving one focus through the other. A hyperbola does something that sounds like the same sentence and is not — it takes a ray aimed at the far focus and turns it towards the near one, which is what the second mirror of a telescope is for.

6 figures
Two families of conics, crossing at right angles. 4 ellipses and 3 hyperbolas with the same pair of foci. Every ellipse meets every hyperbola at a right angle, checked at all 12 crossings.

Two families that cross at right angles

Fix two points and draw every ellipse with those foci, then every hyperbola with the same two. Each curve of the first family meets each of the second at a right angle, so between them they are a coordinate system — and the reason is one sentence about angle bisectors.

5 figures
One sign decides which curve it is. 3 conics drawn from the general quadratic, each labelled with its discriminant B² − 4AC and the curve that sign names, checked against how many times the curve meets a large circle.

One sign decides which curve

The general quadratic in two variables has six coefficients and draws a conic. Which of the four it draws is settled by a single combination of three of them, and the other three cannot change the answer however they are chosen.

5 figures
Six points on an ellipse, and the line their opposite sides meet on. A hexagon with its six corners on an ellipse. Its three pairs of opposite sides are extended until they meet, and the three meeting points lie on one straight line. Moving one corner off the ellipse breaks the alignment.

Six points on a conic, and the line they share

Put six points on an ellipse, join them into a hexagon, and extend each pair of opposite sides until they meet. The three meeting points always lie on one straight line. The statement uses no length, no angle and no focus — which is why it holds for every conic at once, and why a straightedge alone can draw the curve through any five points.

5 figures
Two confocal ellipses, two confocal hyperbolas, and equal diagonals of 1.399. Two ellipses and two hyperbolas with the same foci cut out a four-sided region with curved sides. Its two diagonals, drawn as straight segments, both measure 1.3987.

Equal diagonals in a curved quadrilateral

Two ellipses and two hyperbolas sharing the same foci cut out a four-sided region with curved sides and no symmetry to speak of. Its two diagonals are nevertheless exactly equal. The reason is a stretch that carries one ellipse onto the other and moves every pair of points so that crossed distances match — a property only confocal curves have.

5 figures
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.

5 figures
Four shapes of perimeter 300 between their inner and outer circles. A square, an ellipse, a Reuleaux triangle and a stadium, each drawn with the largest circle inside it and the smallest circle around it, the ring between the two shaded, with the ring's width and the widest ring allowed.

Nearly the most means nearly round

A shape that holds almost as much as a circle of the same perimeter must almost be a circle. Bonnesen made that exact: the ring between a convex shape's largest inscribed circle and smallest enclosing circle is never wider than √(L² − 4πA)/π. Three quite different shapes holding 99% of the circle's area all have rings under 9.55 wide, and not one of 200 random convex shapes breaks the bound.

6 figures
The nine-point circle, touching four others. A triangle with its nine-point circle, its inscribed circle and its three escribed circles, each of the four tangent to the first — with the distances between centres compared against the radii.

One circle touching four

The nine-point circle touches the inscribed circle and each of the three escribed ones. Nothing in its construction mentions them, the two families of centres are built from different kinds of number, and the tangency is four exact equalities between distances and radii.

5 figures
The classical centres as three weights each. A table of triangle centres with the weights on the three corners that produce each, and the determinants that decide which triples of them are collinear.

A centre is three weights

Write each classical centre as a weighted average of the corners and a coincidence becomes a determinant. The Euler line is then one number rather than a construction, the whole catalogue becomes mechanical, and the reason one centre is missing from it is visible in the weights.

5 figures
A circle trapped between two 12-sided polygons. A circle with a regular polygon of 12 sides inscribed in it and another circumscribed about it, beside a table of the bounds on pi obtained by doubling the side count.

Pinned between two sequences

The ring dissection makes the answer obvious and proves nothing. Archimedes' method proves it and makes nothing obvious — it never exhibits the area at all, it rules out every other value — and the recursion that drives it computes π by hand with one square root a step.

5 figures
A hemisphere and a cylinder with a cone taken out, sliced at one height. Two solids drawn in profile — a hemisphere, and a cylinder with a cone removed — each cut at the same height, with the disc and the annulus the cut produces marked and their equal areas given.

The slice that has to match

The same slicing one dimension up gives the sphere's volume in a line, once one comparison is noticed: at every height a hemisphere's disc has exactly the area of a cylinder's slice with a cone's taken out of it. The principle that licenses that comparison also returns a false answer the moment the slices are not parallel.

6 figures
The sum of the first 6 squares, as a staircase over a curve. Bars of height k^2 for k from 1 to 6, totalling 91, drawn over the curve y = x^2, whose area up to 6 is 72.00. The slivers between staircase and curve hold 19.00, close to half the last bar.

Sums of powers, read off a staircase

Add the first n squares, or cubes, or seventh powers, and the answer is always a polynomial in n. Its first term is the area under a curve, its second is half of the last step, and every term after that is a correction for the corners of a staircase — which is where the Bernoulli numbers come from, and why they eventually grow without bound.

6 figures