Crystallography & Symmetry
patterns derived from their groups
Concept

Divisor sum — where it appears

A count obtained by adding something over the divisors of an integer, which is how several lattice counts come out. That a geometric question about lattice points has a number-theoretic answer is the recurring shape of this part of the subject.

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

Sublattices of index n in the plane. For each index up to 12: the number of sublattices found by building every Hermite normal form of that determinant, and the number the Dirichlet series ζ(s)ζ(s−1) predicts — the sum of the divisors in the plane, and a longer sum in space. The two columns are computed by routines that share no code, and the figure does not appear at all if any row disagrees.

How many ways there are to thin a lattice

A sublattice of index n keeps one lattice point in n, and there is never only one way to do it. In the plane the number of them is the sum of the divisors of n; in space it is a longer sum; and both are counted here by writing every one of them down.

lattices · Sublattices Subgroups of index two, three and four. Every plane group with the number of subgroups it has at each small index, counted by enumerating the transitive actions on that many points. The zeros are the interesting entries: p3 has no subgroup of index two and the four-fold groups have none of index three, because a subgroup of index n gives an action on n points and the group has to have a quotient that can act. A rotation of order three has nowhere to go in a set of two, and one of order four has nowhere to go in a set of three that is not the identity — so the index is constrained by the point group before any geometry is done.

How many subgroups of index three

Taking operations away and closing what is left finds the maximal subgroups and stops there. Counting instead the ways a group can act on three points finds all of them — and finds that a four-fold group has none of index three at all.

operations · Subgroups The shells of the hexagonal lattice. Every point of the hexagonal lattice within a squared distance of 24, with a circle drawn at each length that occurs. The form is x² + xy + y², and the number of points on each circle is a coefficient of the lattice's theta series: 6 at 1, 0 at 2, 6 at 3, 6 at 4, 0 at 5, 0 at 6, 12 at 7, 0 at 8. The gaps matter as much as the counts — a circle with no points on it is a length the lattice does not have, and which lengths those are is a question in number theory rather than in geometry.

How many vectors of each length

Counting the lattice points at each distance from the origin turns out to be a question about divisors, and the answer explains something a crystallographer meets every day: why a cubic powder pattern has no line at seven.

lattices · Lengths p = 2: 1, 3, 6, 12, 24 vertices at each distance. Every sublattice of index a power of 2, up to scale, joined when one contains the other with index 2. From the whole lattice there are 3 ways down, because a sublattice of index 2 is a line over the field of 2 elements and there are 3 of those; from each of those there are 3 again, one of which is the way back. So the counts are 1, 3, 6, 12, 24 — that is (2 + 1)·2^(k−1) — and the graph has no cycles, both of which are checked on every vertex whose whole neighbourhood was grown rather than read off the picture. The object is the Bruhat–Tits tree of the p-adic plane, and it is what the set of sublattices is rather than how many there are.

Every way down, and no way round

There are as many sublattices of a given index as the index has divisors, and counting them is where that essay stopped. This one asks what they are to each other, and the answer is a shape: an infinite tree in which every vertex has exactly p + 1 neighbours and no path ever comes back.

lattices · Sublattices A row of coefficients for every group. For eight of the seventeen, the number of sublattices of each index that the group's point group carries to itself. A nought means the group has no copy of itself at that index at all. p1 and p2 preserve every sublattice, so their rows are the counts of sublattices themselves — 1, 3, 4, 7, 6, 12 — which is the sum of the divisors. The rows thin out as the point group grows, and p4m and p6m have almost nothing in them. Every row is a sequence a Dirichlet series can be built on, and the next figure is what that series factors into.

A row written as a product

Every group's copies of itself sit at a row of indices, and every row so far has been read one entry at a time. Counting all of them at once turns a row into a Dirichlet series, and every one of the seventeen rows factors into a product over the primes — which is the statement that a copy is a chain of maximal steps, written as arithmetic. The plainest group of all has the most famous series in mathematics.

space-groups · Isomorphic subgroups

Named alongside it

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

IndexSublatticeGaussian integerHermite normal formLatticeAbelianisationBruhat tits treeCosetCountingDirichlet seriesHolohedryHomothety

All concepts