Transposition
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The crossings that will not come out even
Draw a rearrangement as strings from one row of pegs to another and count where they cross. The count depends on how the strings are drawn; whether it is odd or even does not, and that single bit is what makes determinants exist and a sliding puzzle unsolvable.
Which graphs let the tokens go anywhere
A sliding puzzle is a graph with a token on every vertex but one. Richard Wilson found in 1974 what every such puzzle can reach, and the answer has a surprise in it — the half the tray is stuck with is not a fact about permutations at all, but about the board being two-coloured — and one exception, a graph of seven vertices that reaches exactly 120 of 720.
Named alongside it
The objects these essays reach for when they reach for this one.
GroupParityPermutationBijectionBipartite graphCounting argumentDeterminantExhaustive searchInvariantSignState spaceSymmetry