Concept

Stability

Whether a small disturbance to a state dies away or grows, decided by the rule's slope there. It is decided by whether the map's slope at the fixed point is under one in size, and it is what separates an attracting point from a repelling one.

Named by 18 essays across 4 fields — each of them below, with the objects they name alongside it.

A fixed point that attracts, and one that does not. The same map at two parameters, with the staircase walking towards the crossing in one and away in the other.

A point that pulls, and a point that pushes

Every crossing of a curve with the diagonal is a value the rule leaves alone. Whether anything ever arrives there is decided by one number — the slope at the crossing — and the picture makes the reason obvious.

dynamics · Fixed points
The logistic map's bifurcation diagram, 2.4 to 4. For each parameter, the values the orbit settles into, plotted as a column of points.

The road paved with doublings

Turn one dial slowly and watch what a map settles into. It settles on a point, then on two points, then four, then eight — faster and faster, and the doublings run out at a parameter that is finite.

dynamics · Period-doubling
x ↦ cos x: two starts, one destination. A map whose graph is nowhere steeper than a fixed factor under one, with staircases from two different starting points converging on the same crossing, and the distance to it falling under a geometric bound.

A map that shrinks everything

One extra hypothesis — that every distance is shortened by at least a fixed factor — turns the existence of a fixed point into its uniqueness, an algorithm for finding it, and a bound on the error after any number of steps.

analysis · Fixed points
The splits no group can beat, for three partners. The triangle of ways to split a fixed total between three players, with each coalition's demand drawn as a straight cut across it, and the region surviving every cut shaded.

A split nobody can walk away from

Every way of dividing what a group earns is a point of a triangle, and every coalition's threat to leave cuts a straight line across it. What survives all the cuts is the set of stable divisions — and for one three-player game there is nothing left.

applied · The core
The rotation number against the parameter at K = 1. The measured rotation number of a circle map plotted against its parameter, forming a staircase that is flat over an interval at each simple rational.

The staircase that is flat almost everywhere

A map of the circle advances by an average amount each step. Plot that average against the parameter driving it and the graph is flat over an interval at every rational, rises only on a set of measure zero, and still climbs from nothing to one.

dynamics · Mode locking
A path of 4 bounces that closes, in a triangle of 100°, 40°, 40°. A triangular billiard table with a periodic path found by an exhaustive sweep of starting positions and directions.

The triangle nobody can settle

Does every triangular billiard table have a path that closes on itself? Acute triangles do, right triangles do, triangles with rational angles do — and for the rest the question has been open since it was asked.

dynamics · Billiards
Four shapes of perimeter 300 between their inner and outer circles. A square, an ellipse, a Reuleaux triangle and a stadium, each drawn with the largest circle inside it and the smallest circle around it, the ring between the two shaded, with the ring's width and the widest ring allowed.

Nearly the most means nearly round

A shape that holds almost as much as a circle of the same perimeter must almost be a circle. Bonnesen made that exact: the ring between a convex shape's largest inscribed circle and smallest enclosing circle is never wider than √(L² − 4πA)/π. Three quite different shapes holding 99% of the circle's area all have rings under 9.55 wide, and not one of 200 random convex shapes breaks the bound.

geometry · Isoperimetric
The splits of any two of three decide that nobody can out-argue. The triangle of all splits of a joint gain, with the splits marked at which every player's loudest complaint against every other is matched by an equally loud complaint back.

An objection one player makes to another

The core lets a coalition object to everybody at once. Narrow it to one player objecting to one other, require every such objection to be met by an equally loud one coming back, and exactly one split survives — with no dictionary order anywhere in the argument.

applied · The core
Two periodic orbits meeting at the edge of the 1/2 plateau. The circle at 4 parameter values, with the period-2 points marked — two orbits inside the plateau, drawing closer together towards its edge, and none outside it.

How a lock comes apart

Inside a plateau the map has two periodic orbits, one attracting and one pushing away. Track them to the plateau's edge and they run into each other and vanish together — so the edge of a tongue is a collision, and the width of the plateau is how far the two can be pulled apart.

dynamics · Mode locking
Two staircases and the interval between them, at K = 1.5. A plot against the drive of the upper and lower ends of the circle map's rotation interval above the critical line, two stepped curves with the band between them shaded.

A whole interval of speeds

Below the critical line every orbit of the circle map goes round at the same average speed. Above it the map folds back on itself, and the speed depends on where the orbit starts — not a few different values but a whole interval of them, every fraction in it the speed of some periodic orbit, and almost none of them ever seen by an orbit started at random.

dynamics · Mode locking
The standard map as its kick grows. Three square phase portraits of the standard map at increasing strengths, dotted with orbits: curves spanning the square at the smallest, fewer at the critical value, and a scattered sea with islands at the largest.

The last circle to break

Kick a spinning rotor once a turn and most of its motions stay on curves that wind round forever, walls no orbit can cross. As the kick grows the walls break one by one, and the last to go is the one whose winding is the golden ratio — at a kick of 0.9716, found by watching a sequence of periodic orbits approximate it and asking whether they are stable.

dynamics · Mode locking
The trace–determinant plane and the flows it sorts. The plane of trace against determinant, divided by the horizontal axis and the parabola tr² = 4 det into saddle, node, spiral and centre regions, with 6 matrices marked and their phase portraits drawn alongside.

Two numbers decide the flow

A linear system in the plane has four coefficients, and what its solutions do forever afterwards — spiral in, race out, swing round, or split along two lines — is decided by two of the numbers made from them. The plane of trace against determinant is a complete map of the possibilities, and the only places it cannot decide are the lines where it changes its mind.

analysis · The exponential
The medial axis of a wobbly rectangle, whole and trimmed. A rectangle with sides wobbling by ±0.02: its medial axis (654 Voronoi vertices, Hausdorff distance 0.499 from the clean axis) and its λ-medial axis at λ = 0.2 (63 vertices, distance 0.078).

A skeleton that ignores small teeth

The medial axis of a shape grows a branch to every bump on its outline, however small, so a scanned shape has a skeleton made mostly of noise. Keep only the points of the axis whose nearest boundary points are spread across a circle of radius at least λ, and the branches to bumps smaller than about 2λ disappear while the real skeleton stays. That λ-medial axis moves only a little when the outline wobbles by much less than λ — and the price is λ itself, a size below which a feature is declared not to exist, which can even cut a shape's skeleton in two.

geometry · Voronoi
Two chaotic maps, coupled weakly and strongly. The gap between two coupled copies of the logistic map at full chaos: at ε = 0.15 it stays large; at ε = 0.3 it falls to nothing.

Two chaotic orbits made to agree

Chaos means two copies of a system started a hair apart soon have nothing in common. Couple them — let each take a fraction ε of its next step from the other — and above a definite strength they agree to every digit for ever, while each stays exactly as chaotic as before. The strength needed is read off the same number that measured the chaos: the Lyapunov exponent.

dynamics · Sensitive dependence
Oscillators scattered below the threshold and gathered above it. N = 240, Lorentzian width 0.5: K = 0.5 gives r = 0.068; K = 2.5 gives r = 0.775.

A crowd of clocks that falls into step

Give a thousand oscillators a thousand different natural rhythms and let each be pulled towards the average phase. Below a definite pull nothing happens; above it a cluster forms and grows, and Kuramoto's 1975 calculation says exactly where: at twice the spread of the frequencies, with the order growing as the square root of one minus the threshold over the pull. A simulation lands on that curve to the third decimal.

dynamics · Sensitive dependence
A chain locks whole or breaks at its weakest link. Chain of 40, Kₗ = 4.4817 at link 27; frequency spread 1.86e-5 at 1.04 Kₗ, 0.0645 at 0.96 Kₗ.

A long enough chain never locks

Line oscillators with different natural rhythms up in a row and let each feel only its two neighbours. The chain locks into one frequency exactly when the coupling exceeds the largest running total of their frequency differences — a random walk tied down at both ends — so the coupling needed grows like √N, and its law is Kolmogorov's, the same distribution that tests whether a sample fits a curve.

dynamics · Sensitive dependence
A ring of identical clocks locked into a twist. Ring of 40, nearest-neighbour coupling, settled into a 2-twisted state; largest deviation 2.6e-11; order parameter 2.5e-16.

A ring of clocks settles into a twist

Put identical oscillators round a ring, each pulled only by its neighbours, and start them at random. They always lock — every one ends at the same frequency — but most of the time not in step: the angles wind round the ring a whole number of times and stay wound. The winding number a random start chooses is spread like a bell whose width grows like the square root of the ring, and only coupling to about a third of the ring makes full synchrony certain.

dynamics · Sensitive dependence
A chaotic sea with islands in it. The standard map at K = 2: one chaotic orbit of 7000 points and 18 regular orbits of the islands, the regular ones identified by a Lyapunov estimate below 0.01.

An orbit stuck to an island

A chaotic orbit in the standard map stretches at 0.44 a step, and then for 19,000 steps it almost stops stretching at all. It has wandered into the fringe of an island of regular motion and been caught. So gaps between visits to a box do not die away exponentially as they would in a uniformly chaotic map; they fall as a power, and an orbit of 400 million steps still has not seen the longest.

dynamics · Period-doubling

Named alongside it

The objects these essays reach for when they reach for this one.

Periodic orbitBifurcationChaosOrbitRotation numberSimulationEigenvalueSynchronisationCircle mapExhaustive searchLogistic mapSelf-similarity

All concepts