Crystallography & Symmetry
patterns derived from their groups
Series

Flat space — the series

4 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. p1 folds into a torus. The cell of p1 with its edges marked as the group joins them: both pairs by a plain translation, both arrows the same way round. Gluing top to bottom gives a tube and gluing its ends gives a torus. Nothing in p1 holds a point still, so the surface has no marked points and its first homology is two copies of the integers.

    The two that fold into a surface

    Fold a wallpaper pattern along its own symmetries and what is left is usually a shape with corners and edges nobody drew. For two of the seventeen it is a plain surface with no marks on it at all — a torus and a Klein bottle — and which two is decided by a single question asked of every operation.

    part 1 · classification
  2. Ten ways for space to be flat. The thirteen groups, with each mirror-image pair counted once, because a shape and its mirror image are the same shape. 3 of the ten arrive that way — the three-fold, four-fold and six-fold screws, which are the enantiomorphic pairs this collection already counts among the two hundred and thirty. Six of the ten are orientable and four are one-sided.

    Ten ways for space to be flat

    Thirteen of the two hundred and thirty space groups hold no point still, and folding space along one of them gives a shape with no curvature anywhere. There are ten such shapes, not thirteen, and the difference is the same eleven pairs that separate 230 from 219.

    part 2 · space-groups
  3. 11 nets, and one accounting. Every plane net folds onto a torus when its own translations are divided out, and a torus has Euler characteristic zero — so the quotient's vertices, edges and faces satisfy n − e + f = 0 and the number of faces is not something to be counted off a drawing but e − n. Dividing through gives one over the mean face size plus one over the mean degree equal to a half, which is the same relation that forbids a plane tiling by pentagons, reached here with no geometry in it at all. It holds for every net in the table.

    Every net folds onto a torus

    Divide a plane net by its own translations and the quotient is a finite graph drawn on a doughnut. A doughnut has Euler characteristic zero, so the number of faces is not something to count — it is forced, and with it a relation between how many edges meet at a vertex and how many bound a face.

    part 3 · classification
  4. A wavevector of thirds, and the boxes that cannot see it. Which sizes of box can carry the wavevector at the corner of a hexagonal zone. The characters of the box's translation group are its wavevectors, and there are exactly N² of them — the fractions with denominator dividing N. A wavevector of thirds is therefore present in a box of three, six, nine or twelve cells and absent from one of two, four or five: not approximated badly, not resolved coarsely, absent. A mechanism or a level living there is invisible to such a calculation, and that is the practical content of a mechanism count depending on the cell it was looked for in.

    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.

    part 4 · classification

All series