Cayley graph — where it appears
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
Telling two words apart
There are finitely presented groups in which no algorithm can decide whether two products of the generators are the same element. The seventeen are not among them, and the procedure that settles it is short enough to state in a sentence — which then makes it possible to measure how fast each group grows.
How fast a group grows
Take a wallpaper group, forget the plane, and keep only the generators and the rule for multiplying. Count the elements that can be spelled in at most R letters. The answer grows like R squared — for every one of the seventeen — and the group has told you the dimension of a plane it no longer knows about.
Every wall names a generator
The copies of a fundamental domain tile the plane and stand in one-to-one correspondence with the elements of the group. So the elements that carry the home copy across a wall generate everything — and the generators of a wallpaper group can be read off a picture rather than looked up.
The boundary a growing region forgets
Quoting a density assumes the region it was averaged over does not matter, and that assumption is a property of the group of translations rather than of the crystal. A ball in a plane group grows like R² and its boundary like R, so the edge becomes negligible — and where that fails, the average genuinely moves. The free group on two generators keeps two thirds of itself on the boundary forever, and a slab seven layers deep is wrong by exactly one seventh however wide it is made.
Named alongside it
The objects these essays reach for when they reach for this one.
Generating setAbelianisationAmenabilityCrystal netDecidabilityFundamental domainGroup closureGroup invariantGroup presentationGrowthGrowth functionGrowth rate