Counting the same thing twice — page 11
Every function is a tree with two marks
There are n to the n functions from n points to themselves, and n to the n − 2 trees on those points. André Joyal noticed in 1981 that the missing factor of n² is a choice of two points — a head and a tail — and that a function, read the right way, simply is a tree with a head and a tail. The reading turns Cayley's formula into one line and hands over a fact about random trees from the birthday problem.
Almost every tree can be turned over
Cayley's n^(n−2) counts trees with labels on their points. Take the labels off and the count has no formula, because a symmetric shape absorbs labellings: the star on seven points can be labelled only seven ways, the one asymmetric shape 5,040. The bookkeeping that reconciles the two counts says something unexpected — almost every tree, labelled or not, can be turned over onto itself, where almost every graph cannot.
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.
Four lists find a collision sooner
Two lists of random 24-bit strings need about four thousand entries each before some string appears in both — the birthday bound. Ask instead for one string from each of four lists whose exclusive-or is zero, and lists of a few hundred suffice, because merging the lists in pairs manufactures the near-misses a direct search would have to find by luck. David Wagner's algorithm turns the square root into a cube root, and more lists into smaller roots.
Counting a population by its repeats
The birthday problem runs forwards from a known year to the chance of a match. Run it backwards and the matches measure the year: count how many pairs among the draws came out the same, and the number of kinds is about the number of pairs divided by that. It costs the square root of the population rather than a census of it — and when the kinds are unevenly common, what the repeats measure is not how many kinds there are but how many they behave like.
What homology forgets about a loop
Let the letters of a loop commute and the loop group of a space becomes its first homology group: a loop now records only how often it went round each hole. What is thrown away is exactly the loops that bound a surface. On the figure eight that is nearly everything — of the loops of sixty letters that homology calls nought, about one in 6,700 is a loop that actually shrinks.
The room a projective space needs, read off Pascal's triangle
The projective plane cannot sit in three-dimensional space without crossing itself, and the reason can be written as arithmetic: a polynomial that records how a shape twists, which a room must cancel. For the n-dimensional projective space that polynomial is a row of Pascal's triangle read mod 2, its inverse is another row, and the inverse's last term says how many extra dimensions the room must have — exactly enough, at every power of two.
Half the neighbours forces a tour
Deciding whether a graph has a closed tour through every point is one of the hardest problems computers are asked to solve. Gabriel Dirac found a condition that settles it in one glance: if every point is joined to at least half the others, a tour exists. The proof is a counting argument on a single path, it runs as an algorithm, and two small graphs show that the half cannot be lowered — while random graphs show how much stronger than necessary it is.
The boards a knight can tour
A knight can visit every square of a chessboard once and land a move from where it began. On a 5 × 5 board it cannot, on a 4 × 100 board it cannot, and on a 3 × 8 board it cannot, though on 3 × 10 it can in sixteen ways. Allen Schwenk found in 1991 the complete list of rectangles without a closed tour, and the reasons on it are of two kinds — a colouring that counts squares, and a second colouring that a tour would have to make agree with the first.
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 centre a compass finds in six circles
A circle is drawn and its centre was never marked. A straightedge alone can never find it again. A compass alone can, from two points on the circle, in six circles — and a search through every construction of five circles or fewer shows that six is the least. The reason six works is an inversion that turns the circle into a straight line; the price of discarding the straightedge is exactly one move.
The arcs that make the centre cheap
Finding a circle's centre with the compass alone, from two points on it, costs six circles when the points are placed with no special relation — and as few as two when the arc between them is 60°. Searching every arc in steps of five degrees maps the price exactly, and it is not a smooth function of the arc: it is a list of coincidences, each one a small number of compass steps that happens to land on a chord equal to the radius.
A knot must turn twice, and a little more
Follow a closed curve and add up how far its direction turns. Any closed curve turns through at least one full circle; a knotted one turns through more than two. The proof is a count of hilltops — the total turning equals 2π times the number of highest points the curve has, averaged over every direction to look from — and a curve with a single hilltop in any direction cannot be knotted.
Two random shuffles reach every shuffle
Pick two ways of rearranging n letters at random and allow them to be repeated in any order. Almost always the two together reach every rearrangement there is, or every even one — and when they fail, the usual reason is a coincidence about a single letter that both happen to leave alone. Eugen Netto guessed it in 1882 and John Dixon proved it in 1969.
Nineteen copies and no more
Two of the icosahedron's rotations, chosen at random, generate all sixty of them nineteen times in thirty. Philip Hall found the number in 1936 by inclusion and exclusion over every subgroup at once, weighted by the Möbius function of the subgroups' order — and the same count says that nineteen copies of the group, side by side, can still be generated by two elements, while twenty cannot.
The tangent counts zigzags
Arrange the numbers 1 to n so that they go up, down, up, down. There are 1, 1, 2, 5, 16, 61, 272 such arrangements, and those are, multiplied by factorials, the Taylor coefficients of tan x and sec x — the odd lengths from the tangent, the even from the secant. Désiré André proved it in 1879 by splitting a zigzag at its largest number, and the split turns out to be the derivative of the tangent written out term by term.
Signs that make a determinant count
Hall's theorem says whether a board can be covered by dominoes. How many ways it can be covered is a different question, and for a general graph a hopeless one — the count is a permanent, and nobody expects an efficient way to compute permanents. On a flat board it is a determinant. Put a minus sign on the vertical pairs in every second column and the thirty-six coverings of a four-by-four board stop cancelling and add up; the chessboard has 12,988,816. A hole in the board breaks the rule in a way a cut repairs, and on K₃,₃, which cannot be drawn flat, no choice among its 512 signings works at all.
Every random game has an odd number of equilibria
Find every equilibrium of eleven thousand random games — pure and mixed, by trying every pair of strategy sets the players might mix over — and the totals are 1, 3, 5, 7, … and never an even number. The count is a sum of signs: equilibria of index +1 outnumber those of −1 by exactly one in every game. The average grows about 28% with each strategy added, and searching for the game with the most turns up the coordination game's 2ⁿ − 1, a pattern that holds only up to five strategies.
The roots every matching polynomial keeps real
Count a graph's matchings by size and make the counts the coefficients of a polynomial. On every one of 35,664 graphs tested, that polynomial has only real roots — a theorem of Heilmann and Lieb from 1972. Count independent sets instead and the roots wander off the axis on a growing share of graphs, but never on a graph without a claw, and matchings are the independent sets of a graph that never has one.
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.
Two rays for every fraction
Seen from far away, every point of the Mandelbrot set's outside has an angle, and the curves of constant angle come in to land on the set. At the root of the p/q bulb exactly two of them land, and their angles are written by the staircase under a line of slope p/q. The limbs those pairs fence off share out the whole circle of angles between them, by the identity Σ φ(q)/(2^q − 1) = 1.
What a missing string of digits leaves behind
Strike from the harmonic series every term whose denominator contains 42 and the rest adds up to 228.45. Strike out 99 instead and it adds up to 253.28. The difference is not about which numbers are lost but about waiting: 99 overlaps itself, so it takes 110 random digits on average to turn up where 42 takes 100, and the sum is almost exactly ln 10 times that wait.
Half the chance for every silent set
In the lights game where a press toggles only the neighbours, a random network can be lit about 56 times in a hundred when it has an even number of vertices and 44 when odd. The numbers are 0.560562 and 0.439438, they add to one, and they come from a chain: each new vertex raises or lowers the dimension of the silent sets by one, and each dimension halves the chance.
Pairs of trees that count planar maps
Give every flip of a triangulation a direction and the triangulations become an order, the Tamari lattice. Counting the pairs that are in order — 1, 3, 13, 68, 399, 2,530, 16,965, 118,668, 857,956 — gives 2(4n + 1)!/((n + 1)!(3n + 2)!), which is exactly Tutte's 1962 count of planar triangulations. Chapoton noticed the match in 2006; a pair of trees and a map on a sphere turn out to be the same thing.