Geometry — page 4

Five where four were promised

In one unknown, a polynomial with three terms has at most two positive roots, whatever its degree. The natural guess for two equations in two unknowns, each with three terms, was two times two: four. It is wrong. Bertrand Haas found two such equations in 2002 whose curves cross five times in the positive quadrant, all five crowded within a tenth of one corner, and five turned out to be the most there can ever be.

How many pairs can be one apart

Place n points in the plane and count the pairs exactly one unit apart. A square grid with its spacing as the unit gives two pairs per point; the same grid with the unit chosen as a length it realises in many directions — the square root of 5, of 25, of 65, of 325 — gives three, five, eight. Counting points on circles caps the total at a constant times n to the four-thirds. Between that cap and the grids the truth has not moved since 1984, and at every size anyone can draw, the two look alike.

Three sides and four are proved

Among all shapes of a given area, the disc has the smallest lowest eigenvalue. Among triangles it is the equilateral one, among quadrilaterals the square — both proved by sliding chords to an axis. For five sides the regular pentagon wins every computation, every nudge raises its value by the square of the nudge, and there is still no proof.

The trisectors on a sphere almost agree

Draw Morley's construction on a sphere and the triangle the trisectors cut out is not equilateral — but its sides agree to within a tenth of a percent even when the angles add to 222°. Every step of the rotation proof survives on the sphere except one, and that one is the angle sum.

A skeleton that ignores small teeth

The medial axis of a shape grows a branch to every bump on its outline, however small, so a scanned shape has a skeleton made mostly of noise. Keep only the points of the axis whose nearest boundary points are spread across a circle of radius at least λ, and the branches to bumps smaller than about 2λ disappear while the real skeleton stays. That λ-medial axis moves only a little when the outline wobbles by much less than λ — and the price is λ itself, a size below which a feature is declared not to exist, which can even cut a shape's skeleton in two.

Three circles that touch and are not the largest

In 1803 Gian Francesco Malfatti asked how to cut three round columns from a triangular block of marble with as little waste as possible, and answered with three circles each touching the other two and two sides. The circles exist in every triangle and are found by solving three equations. They are never the answer to his question: the plain greedy rule — the inscribed circle first, then the largest circle that still fits, twice — always does better, by 1.4 per cent on the equilateral triangle and by almost double on a thin one.

Wings that cut a chord equally

Take a chord of a circle and its midpoint. Draw any two more chords through the midpoint, join their ends crosswise, and the two crossing lines — the butterfly's wings — cut the first chord at equal distances from the middle. The proof is the inscribed angle and the power of a point working together; move the point off the middle and what survives is a law about reciprocals; replace the circle by any conic and the theorem does not notice.

A total hung in a temple

Put a polygon's corners on a circle, cut it into triangles, and add up the radii of the circles inscribed in the triangles. Cut it a different way and the total is the same — for all fourteen ways of cutting a hexagon, to every digit. The fact was painted on a wooden tablet in a Japanese temple around 1800, and the reason for it is a theorem about one triangle and the distances from its circumcentre to its sides.

The five crescents that can be squared

The circle cannot be squared, but some regions bounded by circular arcs can: Hippocrates of Chios found a crescent with exactly the area of a triangle around 440 BC. The trick is to make two multiples of π cancel, and it works for a crescent whose two arcs turn through angles in the ratio m to n exactly when an angle defined by a polynomial can be drawn with ruler and compass. That happens for five ratios and no others.

The point nearest in total to three corners

Three towns want one depot with the least total road to all of them. The answer is not the centroid or any of the classical centres: it is the point from which every side of the triangle is seen at 120°, found by building equilateral triangles on the sides. Three straight lines through it have the same length, and that length is the least total. When an angle of the triangle reaches 120°, the answer jumps to that corner — and the same 120° rule shapes soap films and the shortest networks joining many points.

What a junction can save

Join a set of towns by roads that may meet only at towns, and the shortest such network is easy to find. Allow junctions anywhere and the network gets shorter — but never, it is conjectured, by more than 13.4%, the saving the Fermat point makes on an equilateral triangle. Computed exactly on 1,304 random sets of up to seven towns, the average saving is about 3%. An adversarial search drives it down to the bound and no further, and a hexagon with its centre attains it exactly. The proof of the bound that was accepted for twenty years has a gap.

One determinant for every kaleidoscope

Three mirrors close up into a kaleidoscope when the angles of their triangle add to more than half a turn. In more dimensions there is no triangle to add up, but there is a matrix — the inner products of the mirrors' directions — and the mirrors close up exactly when it is positive definite. Trying every arrangement of up to nine mirrors against that one test finds Coxeter's list: three families in every dimension, a fork that runs out at eight mirrors because its determinant reaches zero at nine, and five exceptions. The same search finds the hyperbolic kaleidoscopes, and finds that they stop at five mirrors.

The sums a triangulation cannot change

The Japanese theorem says the inradii of any triangulation of a cyclic polygon add to the same total. Write the inradius as a sum of cosines of the angles, and the theorem becomes one case of a rule that fits in a line: a sum of f over every angle of every triangle ignores the triangulation exactly when f(x) + f(π − x) is constant. cos 3x qualifies, cos 2x does not, and the proof is the inscribed-angle theorem applied to a single flipped diagonal.

The caustics only an ellipse keeps

A billiard ball in an elliptical table touches the same confocal ellipse or hyperbola with every segment of its path, for ever. Bend the table by a percent and a half and most of those curves survive, but the one turning a quarter-turn per bounce breaks into a chain of four islands whose width grows like the square root of the bend. Birkhoff asked in the 1920s whether the ellipse is the only table that keeps them all; it is still not known.