Elliptic curve
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
Give or take twice the square root
A cubic curve over the integers mod 43 should have about 44 points — one for each value of x, on average, and one at infinity. No curve misses by more than 13, the largest whole number below 2√43, and every count from 31 to 57 belongs to some curve. The first fact is Hasse's theorem, the second Deuring's, and the way the counts spread between the limits is a semicircle.
Rows of three, planted on a cubic
Nine trees can be planted in ten rows of three, and the arrangement that does it is not a grid or a star but nine points on a cubic curve. On the curve three points are in line exactly when their angles add up to a right angle, so choosing the points as a cyclic group turns collinearity into addition — and the count of rows it produces is the number Green and Tao proved is the most any planting can reach.
A triangle that fits once fits everywhere
Put one circle inside another and try to fit a triangle between them, its corners on the outer circle and its sides touching the inner. Usually no triangle fits. But if one does, then one fits starting from every point of the outer circle — and whether it does is decided by a single equation in the two radii and the distance between the centres.
Named alongside it
The objects these essays reach for when they reach for this one.
Counting argumentCircumcircleConjectureCyclic groupEuler relationExtremal configurationFinite fieldGenusIncidenceIncircleInvariant measureLegendre symbol