Crystallography & Symmetry
patterns derived from their groups
Theme

The theme: Generated, not drawn — page 5

Every pattern on this site is the orbit of a motif under a group, and the group is then rediscovered from the drawing. A picture that was drawn by hand can have symmetries nobody intended.
Nine frameworks, counted and then decided. Maxwell's count subtracts bars from twice the joints; the pebble game inserts the bars one at a time and discards any that cannot be paid for. The two agree on most of these frameworks and not on all, and where they differ the count is the one that is wrong — it assumes every bar is an independent constraint, and a bar added to a part that is already rigid is not. The redundant column is how many bars the game refused. Symmetry at work

A game that decides what counting only bounds

Maxwell's count subtracts bars from twice the joints and is a bound, not an answer, because it assumes every bar constrains something new. In the plane there is an exact repair: Laman's condition, run as a game in which each joint holds two pebbles and a bar is admitted only if four can be gathered at its ends. Two rigid bodies sharing a joint are what the count gets backwards.

 One hat patch laid out as hats, as equilateral tiles and as turtles. A patch of 36 hats found by exact cover on the kite grid, 4 of them reflected and drawn in the second colour, laid out three times. Every edge keeps its direction; short edges and long edges are given their own lengths. At short 1 and long √3 the tiles are hats, at equal lengths they are the equilateral member of the family, and at short √3 and long 1 they are turtles. In all three the same tiles touch the same neighbours along the same edges, and each layout was checked to be a tiling: 0 gaps and 0 overlaps, 0 gaps and 0 overlaps, 0 gaps and 0 overlaps among 1500 sample points, and every interior vertex surrounded by a full turn. Order without repetition

The hat and the turtle are one tiling

The hat has short sides and long sides; the turtle has the same turns with the two lengths exchanged, and looks nothing like it. Take a patch of hats, keep every edge pointing the way it points, stretch the short edges and shrink the long ones, and the patch becomes a patch of turtles — every tile touching the same neighbours along the same edges.

 Square ice scatters a pinch at the origin. The intensity scattered by the horizontal arrows of square ice, averaged over 100 configurations on a 32 by 32 torus, over the whole Brillouin zone with the origin at the centre; darker is more intense. Along the horizontal axis through the origin the intensity falls to zero — 2.9e-32 at the smallest wavevector — while along the vertical axis it stays near 1.75, so the two meet at the origin in a pinch. Order without repetition

The ice rule is a conservation law

Two arrows in and two out at every vertex is a statement that nothing flows in or out anywhere. That makes one half of the arrow field vanish identically, in every arrangement and not merely on average, and what is left scatters with a pinch at the origin: an intensity that approaches different values from different directions. Break the rule now and then and the pinch acquires a width Debye and Hückel predicted for a salt solution.

 A centre at every other ring, and never between. Two families of closed cage, each a tube of hexagons closed at both ends by a cap of six pentagons, taken from no rings of hexagons to 8. The top row has five faces to a ring and a pentagon at each pole; the bottom row has six and a hexagon. Each box holds the cage's number of atoms with its number of hexagons beneath, and a box is drawn solid with a dot under it when the cage has a symmetry that reverses orientation and fixes nothing — a centre, which is what lets the cage halve onto the projective plane. The five-family has one at even numbers of rings and the six-family at odd ones, so their hexagon counts are 0, 10, 20, 30 … and 8, 20, 32, 44 … — two arithmetic progressions rather than two rows. What a lattice forbids

A centre at every other ring

A census cannot settle an infinite row, and the construction proposed to settle it was a tube capped at both ends, lengthened a ring at a time. Carried out, it alternates: a centre appears at every other ring and never between, the two families it permits reach two arithmetic progressions rather than a row, and the first of them opens with exactly the cage the census found could not halve.

 The fewest contacts twelve pentagons can have, by size. For every cage of pentagons and hexagons up to forty-four atoms, the number of pairs of pentagons sharing a bond. The lower line is the fewest any cage of that size achieves — 30, 24, 21, 18, 17, 15, 14, 12, 11, 10, 9, 8 — the upper line the most, and the dashed line the bound that counting edges gives: the twelve pentagons carry sixty edges between them, a contact uses two and an edge to a hexagon uses one, so the contacts cannot fall below 30 − 3h with h hexagons. The bound is attained while the hexagons are few and goes loose at five, after which each extra hexagon removes about one contact rather than three. The number of cages at each size is printed beneath, and it is the least rather than the average that the bound is about. What a lattice forbids

How close the twelve must be

The charge fixes twelve pentagons and says nothing about where they go, because it is a sum over faces and cannot see which face touches which. What it cannot see is a graph on twelve points, and the fewest edges that graph can have falls from thirty to eight over the cages a census reaches — then keeps falling at a rate that puts its first zero exactly where the truncated icosahedron is.

 An orbit on a parabola, discrete and cocompact. The images of the origin under the group generated by two commuting affine maps of the plane: A slides one step along x and lifts y by the x it started at plus a half, and B is the translation by one in y. The images are the points with whole-number first coordinate and second coordinate a whole number above half the square of it, so the large dots lie on the dashed parabola and the small ones are the rest of the orbit. No two distinct images come closer than 1.000, and no point of the square between the axes lies farther than 0.610 from one — so the action is discrete and its quotient is compact, which is exactly what Bieberbach's first theorem asks for. What a lattice forbids

Straight lines, and no distances

Every finiteness met so far rests on the motions preserving a metric, because the trick that produces one is an average and an average needs something to average over. Keep the straight lines and drop the distances, and Bieberbach's first theorem is false in the plane — by an example two lines long, whose group is the plane's own translations and whose translations have rank one.

 Every arrangement on a torus 4 across, sorted by defects. The transfer matrix that counts ice arrangements chooses, at each vertex, the one horizontal arrow the rule permits. Enumerating both choices instead and carrying a polynomial that records how many vertices end up with three arrows in or three out gives the number of arrangements at every defect count at once. The first column, drawn solid, is the ice count — 2970 arrangements with no defect at all, which is the number the earlier transfer matrix gives and is checked against it. The second column is empty: no arrangement has exactly one defective vertex, because a defect carries a charge and the charges on a closed surface must cancel. The columns together add to two raised to the number of edges, which is every assignment of arrows whatever. Order without repetition

What a defect costs the count

Each broken vertex relaxes the rule and so adds arrangements — the question left standing was whether each adds a fixed amount or the cloud around it costs some back. The exact count at every defect number at once answers both halves: almost all of the rise is the freedom to choose which vertices break, and with that removed the first defects subtract rather than add.

 One rule, one lattice, two entropies. The number of arrangements per vertex for square ice, counted two ways on the same lattice with the same rule. On a torus the count falls towards Lieb's exact value of 1.5396 from above. Inside a domain wall — every arrow on the top and bottom edges pointing in, every arrow on the left and right pointing out — the count rises towards 3√3/4, which is 1.2990, from below. A residual entropy is supposed to be a bulk quantity that forgets the boundary; these two differ by sixteen per cent and the only difference between them is the boundary. Order without repetition

The count that depends on the edge

A residual entropy is supposed to be a bulk number: so much per vertex, whatever surrounds the lattice. Square ice has two of them. On a torus the count per vertex heads for 1.5396 and inside a domain wall it heads for 1.2990, with the same rule on the same lattice — and the sixteen per cent between them is sitting in the corners.

 A colouring, and the arrows it writes. A proper three-colouring of the cells of a four-by-four torus — no two cells sharing an edge carry the same colour — with an arrow drawn on each shared edge by the difference of the two colours it separates. The difference is one or two modulo three, never nought, so every edge gets a direction. At each corner four cells meet and their four differences go round a cycle and add to nothing modulo three, which forces two of the arrows in and two out. That is the ice rule, arrived at from a colouring with no arrows in its statement. Order without repetition

Three colours on a chessboard

Colour the cells of a board in three colours so that no two sharing an edge agree. The number of ways is the number of ice arrangements on the same board — the same integer, to the last digit, at every even size — so a residual entropy a calorimeter reads is also the answer to a colouring problem with no physics in it at all. At odd sizes the two counts part company, and why they do is a condition on going round.

 The closure is a lattice exactly when the orders allow one. Twelve pairs of rotation orders, with a centre of each order placed one unit apart and the group they generate closed out to words of length 6. The linear parts reached are exactly the least common multiple of the two orders, every time — two rotations generate rotations, and the angles they generate are the multiples of the smaller of two fractions of a turn. A lattice admits rotations of order one, two, three, four and six and no others, so the closure can be a plane group exactly when that multiple is one of those five. The pairs where it is not are the pairs where the translations keep getting shorter. Operations

Closing the plane from two centres

Put two rotation centres down and close under composition: the result is a plane group or is not discrete, and nothing in between. What decides it is the least common multiple of the two orders, because two rotations generate rotations and the angles add — so the crystallographic restriction arrives as a condition on a closure rather than as one on a lattice.

 A screw out of two rotations that have none. Four pairs of located rotations of space, composed, with the result read back as a screw: its angle, and its pitch, which is the part of its translation lying along its own axis. Axes that meet give a rotation and no translation at all, because the point where they meet is fixed by both. Parallel half-turns give a translation. Skew axes give a screw — a motion with a translation in it, out of two motions with none — and the translation is twice the distance between the two axes. Nothing in either factor moves anything along the product's axis, and the product does. Operations

The axis a product lies on

Two rotations of space about axes that do not meet compose to a screw — a motion with a translation in it, out of two that have none. The translation is twice the distance between the axes and the angle twice the angle between them, and the screw's own axis is not somewhere arbitrary: it lies on the two axes' common perpendicular, at a place the arithmetic gives.

 The turns that keep the join discrete. Two copies of p4 on one square lattice, one turned against the other, with the shortest translation their union generates. At a turn whose cosine and sine are both rational the translations are a lattice, and its shortest vector is one over the square root of Σ — where Σ is the odd part of p² + q² for the rational point (p, q) — which the measurement reproduces to six places at every one tried. At a whole number of degrees other than a multiple of ninety there is no such point, and the search finds shorter translations the further it runs. Operations

Two patterns laid over one another

Compose two plane groups rather than two operations. The group generated by both is one of the seventeen or is not discrete at all, with nothing between — and it takes two conditions, one on the rotation orders and one on the turn between the lattices. The turns that work have rational cosines, which by a theorem of Niven's means none of them is a whole number of degrees.

All themes · All essays