Seventy-four homomorphisms, forty-six groups
Each row is a plane group: how many two-colourings it has, and how many of those are genuinely different designs. The first count is of homomorphisms onto the two-element group and comes to 74; the second identifies colourings related by an affine map carrying the group onto itself, and comes to 46 — the classical number of two-colour wallpaper groups. pmm supplies the largest gap, with fifteen colourings and five designs. Both numbers are computed here and neither is looked up.
4 essays call
colour-classes. The drawing above is what it returns with no arguments at all; every
call below passes it something, because a placement that passes nothing draws whichever member
of the family the generator happens to default to rather than the one its essay argues about.
Every one of this site's 393 essays names its parameters at the
call site, which the standard pass of 2026-08-09 established and param-floor
holds.
Where it is called
Changing this generator changes every one of these figures.
The domains a lost translation makes, which nothing optical can see
An ordering transition can leave the crystal class untouched and take away translations instead. The domains that result have the same orientation, the same shape and the same optical properties as each other, and where two of them meet the ordering is simply out of step — a boundary with no change of direction across it and no way to find it except by looking at the ordering itself.
Two colours, and a symmetry that swaps them
A chessboard and a grid of identical squares have the same group, which is plainly not what anybody sees. Admitting the colour swap as an operation gives a finer classification — and one of the seventeen turns out to admit no two-colouring at all.
Seventy-four colourings, forty-six groups
This site counts the two-colourings of the seventeen and gets seventy-four. The literature says there are forty-six two-colour wallpaper groups. Both numbers are right, and the gap between them is a disagreement about when two coloured patterns are the same pattern.
What a half-turn does to three colours
Ten of the seventeen plane groups have no three-colouring, because a half-turn cannot permute three colours cyclically — that is the first rung of this ladder and it is true. Drop the word cyclically and the answer changes completely: a half-turn permutes three colours perfectly well by swapping two and fixing one, and only the three four-fold groups refuse three colours at all.