Crystallography & Symmetry
patterns derived from their groups
Concept

Generating set — where it appears

A set of group elements from which every element can be built as a product. It is never unique, so quantities that depend on it — word length, the growth coefficient, the shape of a ball — are properties of the pair rather than of the group.

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

p1, p2, p4, p6m: every one quadratic. How many elements each group has at word length at most R, to 14 terms, against the same kind of generating set. Every curve is a quadratic in R — which is the group knowing its own dimension, since a crystallographic group of d dimensions grows like R to the d and nothing about the counting mentions the plane. The curves differ by a factor: p1 reaches 421, p2 reaches 786, p4 reaches 1464, p6m reaches 5478.

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.

operations · Presentations p4: a domain of 38 cells with 7 walls. The fundamental domain of p4 on a grid of 12ths, with the walls it shares with its neighbouring copies marked. Each wall names the element that carries this copy onto the copy across it, and there are 7 distinct such elements. Those elements generate the whole group — checked by closing them up and requiring every coset and the whole translation lattice to be reached, not assumed — which is Poincaré's theorem, and it means the generators of a wallpaper group can be read off a picture. The domain is pixelated rather than a polygon, so the wall count is a property of this domain and not of the group.

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.

operations · Fundamental domain Thirty-two classes, eighteen groups. Every abstract group the thirty-two crystal classes realise, with the classes that realise it. 8 of the eighteen carry more than one class, and the largest collision is the four hexagonal classes that are all the dihedral group of order twelve. Nothing here is looked up: two classes are put in the same row when a search over images of a generating set finds a bijection preserving multiplication, and the search is finite because a generating set is small and the elements it may map to are the ones of the same order.

Thirty-two classes, eighteen groups

An inversion centre, a mirror and a two-fold rotation are three of the most different things a crystal can have, and they are the same group of order two. Forget the matrices and keep the multiplication table, and the thirty-two classes collapse to eighteen.

point-groups · Crystal classes How few of their own operations the space groups need. The 212 space-group types that their own rotations, screws, mirrors, glides and inversions generate, by the fewest of those operations that suffice: 64 need 2, 93 need 3, 46 need 4, 8 need 5, 1 need 6. For 198 the number equals a lower bound read off the group's largest elementary abelian quotient; for the other 14 a finite quotient proves that one more is needed, and a set of that size is found.

Two operations make rock salt's group, and Pmmm needs six

Every space group that its own rotations, screws, mirrors, glides and inversions can build is built by a handful of them, and how small a handful is now known for all 212. A quotient of each group says how many it cannot do without, a search finds that many for 198, and for the other fourteen a finite quotient proves that one more is needed. Rock salt's group needs two operations, Pmmm six, and P312 needs four where its abelian quotient allows two.

space-groups · Screws and glides The square net drawn as the Cayley graph of four different groups. The same square net four times. In each panel the edges are coloured by the group operation that spells them, read from one regular subgroup of the net's symmetry group: the lattice of translations, a p2 whose half-turn centres sit at the midpoints of edges, a pmm whose four mirrors run between rows of vertices, and a p4 whose quarter-turn centres sit in the middle of the squares. No symmetry element drawn passes through a vertex, which is what makes each group act without fixing any, and the large dot is the vertex named by the identity.

The square net draws eleven groups

The Cayley graph of a wallpaper group is a periodic net. Asked the other way, the question is which nets are Cayley graphs, and of what. A net is one exactly when some group of its symmetries carries every vertex to every other and fixes none. All eleven uniform nets pass. The square net is the Cayley graph of eleven of the seventeen groups, the kagome net of exactly one, and between them the eleven nets use all seventeen.

operations · Presentations Which two kinds of operation make each of the 64 two-generator space groups. For each of the fifteen pairs of kinds of operation, rotation, screw, mirror, glide and rotoinversion (the inversion included), the number of the 64 space-group types generated by two of their own operations that some pair of those kinds generates. Every one of the 960 cases is decided: by a generating pair found, by the pair's linear parts failing to generate the point group, or by a proof in a finite quotient of the group. A screw and a glide make 32 types; two mirrors and a rotation with a mirror make none.

Two mirrors never make a crystal

Sixty-four space groups are generated by two of their own operations. Which two kinds can do it is a finite question, and it has been settled for all sixty-four and all fifteen pairs of kinds. A screw and a glide make thirty-two of them. Two mirrors make none, and neither does a rotation with a mirror, for reasons that need no computation: two operations that undo themselves generate a dihedral group, and an axis and a plane always share a point or a direction. Two plain rotations make six groups, every one of them cubic and without a mirror.

space-groups · Screws and glides Which three kinds of operation make each of the 93 three-generator space groups. For each of the 35 triples of kinds of operation (rotation, screw, mirror, glide, rotoinversion with the inversion), how many of the 93 space-group types that need three of their own operations some triple of those kinds generates. Of the 3255 cases 978 are generating triples found, 2275 are refuted (by the point group or in a finite quotient) and 2 remain undecided. Three mirrors make none; a screw and two glides make the most, 53.

Three mirrors never make a crystal either

Ninety-three space groups need three of their own operations to generate them, and which three kinds can do it is a finite question with 3,255 cases. All but two are now decided. Three mirrors make none of the ninety-three, as a theorem about reflection groups requires. A rotation with two mirrors makes exactly three, all cubic. Three plain rotations make thirteen, every one without a mirror. One group can be made thirty ways and three can be made only one.

space-groups · Screws and glides

Named alongside it

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

Cayley graphGlide planeScrew axisSpace groupCrystal netMirrorRotoinversionSohncke groupAbelianisationAbstract groupArchimedean tilingCharacter

All concepts