Burnside lemma — where it appears
Named by 3 essays across 3 fields — each of them below, with the objects they name alongside it.
Counting what a group cannot tell apart
Sixty-five thousand ways of putting two species on sixteen sites; eight hundred and five structures. The difference between those numbers is not a division, because the symmetric arrangements have short orbits — and the count that gets it right is an average of fixed points.
Crystallography in a box
A calculation over a crystal is not performed on a crystal. It is performed on a finite block with its edges glued, and the block has a symmetry group of its own — finite, complete in one direction and missing something decisive in the other.
The shell that splits into kinds
The neighbours of an atom carry a space of functions as large as the shell, and the group does not treat that space as one thing. It splits into pieces of a few kinds, in whole numbers, and the count is the cheapest character in the subject: how many neighbours each operation leaves where they are.
Named alongside it
The objects these essays reach for when they reach for this one.
OrbitCharacterCluster expansionCommensurateConfigurationFinite groupFixed pointIrreducible representationMultiplicityPeriodic boundary conditionsPermutationPermutation representation