Crystallography & Symmetry
patterns derived from their groups
Concept

Cayley graph — where it appears

The graph whose vertices are a group's elements and whose edges join each element to the elements one generator away. For a wallpaper group it is a crystal net, so counting words and counting neighbours of an atom turn out to be one computation.

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

The ball of radius 5 in p6. Every element of p6 reachable in at most 5 multiplications by a generator or its inverse, plotted at its translation part — so each dot is a lattice position and its size says how few steps reach it. The picture is the word metric's unit ball scaled up, and its shape is what fixes the growth: a diamond where the group supplies two short translations, and a hexagon where it supplies three. Every dot here required the word problem to be solved, because the search has to know when two products are the same element.

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.

operations · Presentations 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 One curve falls and the other does not. The boundary's share of a ball, against the radius, for a plane group and for the free group on two generators. The plane group's falls like one over the radius and goes to zero; the free group's rises to two thirds and stays. A group with no sequence of regions whose boundary becomes negligible has no shape-independent average, and that is not a difficulty in the analysis — it is a property of the group.

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.

operations · Presentations Seventy-three classes, seventy-three Smith forms. Every arithmetic crystal class of space, grouped by lattice system, with the cohomology group read off the Smith normal form of the integer conditions its Cayley graph imposes, shaded by the group's exponent. Twelve classes have nothing; fifty-three have exponent two, among them the orthorhombic P holohedry with ℤ2 to the sixth; three have exponent three, three have exponent four, and two — the hexagonal 6 and 622 on the primitive lattice — have exponent six. Nothing larger occurs.

Seventy-three Smith forms

The cohomology group that counts a crystal class's intrinsic translations has a closed form only when the point group is cyclic. For every other class it is still one integer matrix away: the conditions the Cayley graph's cycles impose, reduced to Smith normal form, leave the group on the diagonal. Run on all seventy-three classes of space, the diagonal says the largest exponent is six, that a group of order forty-eight needs nothing finer than halves, and that no class needs a denominator its operations do not already have.

classification · Cohomology I222 and I2₁2₁2₁: the same axes, apart. The two-fold rotation axes of the two space groups on the body-centred class of 222, drawn in one conventional cell seen down its third edge: axes along that edge as diamonds, axes along the first edge as solid lines and along the second as dashed lines, with the height of each written beside it. Both groups have pure two-fold rotation axes in all three directions. In the symmorphic group some axes of different directions cross, at the origin among other places; in the other none does, because the heights of the axes in each direction are a quarter out of step with the positions of the axes in the others.

Two groups no single operation reveals

A space group is non-symmorphic when no choice of origin removes all of its translations at once, and every textbook example has a screw or a glide to show for it. Two of the two hundred and thirty do not need one. Every operation of I2₁2₁2₁, taken on its own, is also a plain rotation about some axis; so is every operation of I2₁3. What makes them non-symmorphic is that their rotation axes never meet — and no diffraction extinction can tell them from I222 and I23.

classification · Cohomology 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 Every special position of the seventeen plane groups, with its regular subgroups. The 55 special Wyckoff positions of the seventeen plane groups, one chip each, labelled by site symmetry and points to a cell and carrying the number of subgroups that act on the position regularly. None is zero. 26 positions have one point to a cell and are reached by the lattice alone; 12 can be reached only by subgroups containing rotations; four, the positions of three points to a cell in p3m1, p31m, p6 and p6m, are reached by exactly one subgroup each.

No Petersen graph in the plane

A finite graph can look the same from every vertex and still be the picture of no group; the Petersen graph is the smallest that does. A periodic net in the plane cannot. Whether one is a Cayley graph depends only on where its vertices sit, and they sit on one of the fifty-five special positions of the seventeen plane groups or on a general one. Every one of the fifty-five has a subgroup that carries any of its points to any other in exactly one way, and four of them have exactly one.

operations · Presentations

Named alongside it

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

Crystal netGenerating setAbelianisationArithmetic crystal classCoboundaryCocycleFree actionGroup extensionIntrinsic translationStabiliserAmenabilityArchimedean tiling

All concepts