Spectrum
Named by 7 essays across 3 fields — each of them below, with the objects they name alongside it.
A square wave built entirely out of round ones
Add enough sine waves together and flat tops and vertical cliffs appear from nothing. Almost — there is a 9% overshoot that never goes away, and it is not a bug.
Where the coefficients come from
The recipe for a square wave has a four over pi in front and a one over three on the second term, and the essay that built a square wave from sines used them without saying where they came from. They come from multiplying by one harmonic and taking the area.
When the period grows without bound
A repeating signal has a spectrum of separate lines. Stretch the gap between repeats and the lines crowd together while the curve they sit on stays exactly where it is — and at infinite period the lines are gone and the curve is the whole answer.
The corners go first
Fourier was not decomposing waves for the pleasure of it. He was solving the flow of heat, and the whole apparatus exists because each harmonic fades at a rate set by the square of its frequency — which is why a sharp profile smooths instantly and why the flow cannot be run backwards.
A plucked string keeps its corners
Heat smooths a sharp profile at once, because each harmonic decays at a rate set by the square of its frequency. Change one time derivative into two and nothing decays at all: each harmonic swings for ever, the corner of a pluck splits in two and runs along the string, and after one period the shape comes back exactly. The same sines, the same coefficients — and a flow that loses nothing.
Two graphs the eigenvalues cannot tell apart
A graph's matrix has eigenvalues, and they count a surprising amount of the drawing: its edges, its triangles, every closed walk of every length. They do not count everything. A star with four arms and a square beside a lone point have the same eigenvalues exactly, although one of them is in two pieces — and on six points ten of the 156 graphs have a twin of this kind.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Fourier analysisHarmonicsPeriodicityConvergenceEigenfunctionExhaustive searchHeat equationIrreversibilityOrthogonalityAutomorphismCanonical formCharacteristic polynomial