Ferrers diagram
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
A diagram turned on its side
Write a partition as rows of dots, then read the columns instead. Every theorem in this essay is that one move, and the move proves things that no formula suggests.
The shape a random partition takes
There are about twenty-four thousand billion billion billion ways to write 1,000 as a sum of whole numbers. Pick one at random, draw its Ferrers diagram, shrink it by the square root of a thousand, and it is almost exactly the curve e^(−cx) + e^(−cy) = 1 with c = π/√6. So is the next one, and the next. A random partition of a large number has a shape, and the shape is known exactly.
Two counts that agree for no visible reason
Write 10 as a sum of whole numbers that differ from each other by at least two, and there are six ways. Write 10 as a sum of numbers that each leave 1 or 4 on division by 5, and there are six ways. The same happens for 20 (thirty-one each), for 40 (three hundred and seventy-four each), for every number anyone has checked and every number there is. The two lists look nothing alike, and no one has found a simple way to turn one into the other.
Named alongside it
The objects these essays reach for when they reach for this one.
Generating functionPartitionBijectionConjugate partitionCounting two waysDurfee squareAsymptoticsContinued fractionsGolden ratioInvolutionLimit shapeModular arithmetic