Concept

Involution

An operation that undoes itself, so that applying it twice returns what it started from. Pairing objects by an involution that reverses a sign is the standard way to make a signed sum collapse: the paired terms cancel and only what the pairing cannot touch survives.

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

The partition 5 + 4 + 2 + 1 and its conjugate. A row of dots for each part, and the same dots read down the columns instead.

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.

number · partitions

A determinant counting the 16 spanning trees. A small graph, the minor of its Laplacian, and every one of its spanning trees drawn as thumbnails.

A determinant that counts trees

Write down a graph's Laplacian, strike out one row and its column, take the determinant. The answer is the number of spanning trees — and the minus signs in the determinant are what cancel every subset of edges that is not one.

algebra · determinant

The product of (1 − qᵏ), and what survives at 12. The coefficients of the pentagonal product drawn as signed bars, with the partitions into distinct parts that Franklin's move leaves unpaired.

The terms that cancel almost everything

Multiply out the product of 1 − q, 1 − q², 1 − q³ and so on, and nearly every coefficient is zero. What survives is a single plus or minus one at 1, 2, 5, 7, 12, 15 — and the reason is a way of pairing partitions off so that each pair cancels.

number · partitions

Named alongside it

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

Bijection Counting two ways Cancellation Generating function Partition Recursion Algebraic identity Conjugate partition Counting argument Determinant Durfee square Ferrers diagram

All concepts