Map folding — the series
-
The oldest open problem
In how many ways can a map be folded? The question needs no notation to state, the answer is a small integer for small maps, and after sixty years there is still no formula — only a list of numbers, each one found by searching every possibility.
-
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.
-
Two directions that will not separate
A map has rows and columns, and a strip of stamps is a map with one row. The obvious hope is that the two-dimensional count is built from the one-dimensional one — fold the rows, then fold the columns. It is not: a two-by-three map folds 60 ways against a product of 12, and the discrepancy grows from a factor of two to a factor of thirty-eight over the counts anybody has.
-
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 test that never fires on a map
The cheapest refusal of a folded state reads a crease list once and reports that no arrangement of the layers exists. Enumerate every labelling of every map from two panels to nine and it fires on four of the four hundred and fifty-four — all four on the largest map, none at all below it. On the oldest open problem in the subject, the cheap test has essentially nothing to say.
-
A map with no edges
Counting the ways a rectangular map folds is the oldest open problem in the subject, and every version of it assumes the map has an edge. Join the map's opposite edges and the question changes shape: half the sizes have no folded state at all, and the ones that do have no bottom layer to count from.
-
The tube a map makes
Join one pair of a map's edges and the result is a tube — a real object, foldable in the hand, and neither the strip's problem nor the torus's. It has one loop that cannot be shrunk instead of two, it keeps its bottom layer because it keeps half its rim, and half its sizes are refused by a parity the flat map does not have.
-
A map refuses in small pieces
The one-pass refusal — a circle in the arcs a map's letters force — fires on four of a three-by-three map's 256 letterings and on none below it, and the question was how it grows. It grows by windows. Every lettering it refuses on a four-by-three or five-by-three map contains one of those four refused three-by-three patterns somewhere inside it, so the share refused is almost exactly one minus 63⁄64 to the power of the map's three-by-three windows. Four by four is the first map with a refusal no window explains, 64 of its 2,112. The rise is smooth, not sharp: a quarter at six by six, near half at eight, seven tenths at ten.
-
The long circles go round the middle
A four-by-four map has 64 letterings the one-pass refusal catches with no three-by-three pinwheel anywhere in them, and they are not larger pinwheels. They are four shapes, sixteen versions of each, none unchanged by any turn or mirror, and every one is a circle of twelve creases running round the middle of the map. Read the same way on larger maps, every refusal is a circle round some rectangle of panels, and it needs the whole of that rectangle: one in 64 three-by-three rectangles closes one, one in 512 four-by-fours, and rectangles three cells across close nothing a pinwheel does not. Two window sizes explain all but 0.07 per cent of a twenty-by-twenty map's letterings.
-
A tube refuses round itself
On a flat map the cheap refusal — a circle in the arcs a lettering forces — is almost entirely local: small windows of the map explain all but a sliver of it. Glue the map's left edge to its right and the windows still refuse at exactly the rate their number predicts, counted across the seam. But a new refusal appears that no window can contain, a circle that goes once round the tube. It refuses half of every lettering of a tube two panels round, over half of one four round, a quarter at six, and it falls by about half with every two panels of circumference while the tube's length hardly matters.