Lunnon's counts — where it appears
Named by 5 essays across 2 fields — each of them below, with the objects they name alongside it.
Where the exponent comes from
The number of ways a strip of stamps folds grows exponentially, and the base of the exponential is a number nobody has proved exists. The ratio of one term to the last climbs past three and is still climbing where the computation stops — which is the only structural handle anybody has on the sequence.
The map that is not a rectangle
Take one square out of a three-by-three map and the number of ways it folds does not go down by an eighth. It goes up — to 848 if the square came from a corner, and to 8,016 if it came from the middle. Two maps of eight squares in the same box, differing by nearly a factor of ten, and no function of the box tells them apart.
The count counts labels
One, two, six, sixteen, fifty, a hundred and forty-four: the oldest sequence in the subject counts foldings of a strip of numbered stamps. A folded strip of blank paper has no first stamp and no top side, and neither of those operations ever leaves a folding alone — so the count of objects is 1, 2, 5, 14, 38, 120, and it is not the count over four.
The map counted from the layers
The classical map-folding counts are computed from a rule that never places a panel: work out which edge of the folded square each fold wraps around, and refuse the orderings that interleave two folds at one edge. Place the panels instead and order them by the general non-crossing rules, and the same numbers come out — 2, 6, 16, 50, 144, 8, 60, 320, 1368 — on nine sizes, by machinery that shares no line of code with the first.
The grid a division makes
Dividing a square into thirds in both directions is a construction: four creases, each exact, each landing on a rational the ladder can name. The object it leaves behind is a three-by-three map of stamps, and how many ways that folds is the oldest open problem in the subject — 1,368 at three, 300,608 at four, and unknown at five.
Named alongside it
The objects these essays reach for when they reach for this one.
Map foldingStamp foldingCombinatorial explosionThe counting problemLayer orderingOpen problemCrease assignmentCrease patternEnumerationExact divisionFolded stateThe growth rate