Crystallography & Symmetry
patterns derived from their groups
Concept

Normal form — where it appears

A canonical representative of an equivalence class, chosen so that two objects are equivalent exactly when their normal forms are identical. Reduction provides one for lattices, which is what makes counting lattice shapes a finite search.

Named by 2 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 How many different lattices share a determinant. One bar per determinant: the number of inequivalent integral lattices whose metric has that determinant, which is the class number of the corresponding discriminant. Area does not decide shape — at determinant 1 and 2 there is one lattice each, and by 11 there are four — and the count does not grow steadily either. Each bar is computed twice: once by enumerating the reduced forms directly, and once by reducing every form in a box and collecting the distinct results, which is a search followed by an algorithm rather than a search over answers. The two agree at every bar.

How many lattices share a determinant

Area does not decide shape. The number of inequivalent lattices whose metric has a given determinant is a class number, computed by enumerating reduced forms — and checked by reducing every form in a box and counting what comes back distinct.

lattices · Moduli

Named alongside it

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

AbelianisationBinary quadratic formCayley graphClass numberDecidabilityDiscriminantEquivalence classGrowthHexagonal latticeLattice reductionPresentationRelator

All concepts