Recurrence relation
Named by 4 essays across 3 fields — each of them below, with the objects they name alongside it.
Two barriers and a fair game
A fair walk between two absorbing barriers is ruined with a probability that is a straight line in the starting stake, and lasts for a number of steps that is the product of what each side can lose. Both facts come from the same two-line recurrence, and both are bad news for the smaller player.
Counting the colourings
Asking whether a graph can be coloured with four colours gives a yes or a no. Asking how many ways there are gives a polynomial — and the polynomial answers the first question, and several others nobody asked.
A polynomial that counts
Hang a counting sequence on the powers of a variable and the two ways of combining choices — this and that, this or that — become multiplication and addition, so a recursion turns into an equation and the equation can be solved.
The race that makes ζ(3) irrational
Roger Apéry's 1978 proof that the sum of the reciprocal cubes is not a fraction comes down to a race between two numbers. A whole-number multiplier grows by a factor of ten every 0.79 steps; the gap it multiplies shrinks by a factor of ten every 0.65. The gap wins, by a margin of about seventeen per cent, and that margin is the whole proof.
Named alongside it
The objects these essays reach for when they reach for this one.
Absorbing stateBinomial coefficientCatalan numbersChromatic numberChromatic polynomialConvolutionCountingCounting two waysDeletion contractionExpectationFormal power seriesGamblers ruin