The theme: Symmetry is decidable — page 10
The parts a property splits into
A symmetric property of rank r is a polynomial of degree r wearing indices, so the number of components a class permits it is a coefficient of an invariant ring's series. The elastic tensor is not a polynomial in disguise, and its counts are not in that table — which is the most useful thing about it.
The placement nobody chose
A net has no coordinates, so drawing one means inventing them. There is exactly one way to invent them that involves no choice: put every vertex at the average of its neighbours. The drawing that results has the largest symmetry group the net admits, and this site's own detector finds it.
The solver that knows no symmetry
Compute a map from amplitudes and random phases, reverse the sign of everything below a small threshold, transform back and keep the phases. Repeat. The structure appears — and so does its space group, which was never supplied.
What a group forbids to happen
Two levels and a thing that might carry a crystal from one to the other. Whether it can is one sum over the group — and a zero there is a prohibition that no material, no temperature and no intensity of light gets round.
The degeneracy time reversal forces
A crystal with a glide has levels that stick together at the edge of its zone for a reason no character table contains. The operation responsible is antiunitary, it squares to minus one, and Kramers' theorem then applies to a model with no spin anywhere in it — which closes nine rows an earlier census in this collection had to leave open.
A net is a choice of what counts as a bond
A list of atomic positions does not contain a net. It contains distances, and somebody has to decide which of them are bonds — so the net is a fact about the cutoff as much as about the crystal, and moving the cutoff past a shell of neighbours changes the answer.
How much of it is the other hand
A crystal of one enantiomer is a hypothesis, not an observation. What the diffraction actually measures is a fraction — how much of the specimen is the inverted structure — and the useful part of that measurement is the uncertainty on it.
The axes a class pins down
A property tensor has a shape and an orientation, and symmetry treats them differently. Three principal directions fixed for ever in an orthorhombic crystal; one in a monoclinic one, with the other two turning as the wavelength changes.
The count that promises a mechanism
Count the joints, count the bars, subtract. The number that comes out promises rigidity when it is small and a mechanism when it is large, and it is wrong in both directions — because it assumes every bar removes a freedom the others have not already removed.
A translation that is nearly there
Half a structure copied onto the other half by a half-cell shift, with nothing exact about it. No reflection vanishes, so no extinction rule fires — and the test for a centre of symmetry answers yes about a structure that has none.
A fold that keeps its symmetry
The kagome framework has exactly one mechanism, and it does not stop at first order. Every triangle turns, alternate ones the other way, the cell shrinks to half its size, and not one bar changes length — and the count that found the mechanism cannot see how many there really are.
The level that does not move
Three levels cross the kagome net's zone and one of them is a horizontal line. The reason is a state that alternates in sign round a single hexagon and is exactly zero everywhere else — a solution with no wavevector in it at all, which is why no wavevector can move it.
Two structures on a torus, and one Patterson
Homometry was settled here on a ring of positions, which is a crystal in one dimension. Moving the same exhaustive search to a torus asks whether the coincidence is commoner or rarer when the vectors have a plane to land in — and the honest answer is that dimension is not what decides it.
How many reflections it takes to know there is a centre
The test for a centre of symmetry compares one average of the intensities against two theoretical values a quarter apart. Whether that is a measurement depends on how many reflections went into the average, and the only honest way to find out is to run the test on structures whose answer is already known and count the mistakes.
The step that never runs out
A perfect crystal face cannot grow: an atom arriving on a flat plane touches it on one side and leaves again. Faces grow anyway, and the reason is a defect — a screw dislocation puts a step on the surface that winding round it never consumes.
A small angle is a row of dislocations
Turn one crystal a degree against another and the coincidence arithmetic says they share almost nothing. The boundary between them is nevertheless nearly perfect crystal, and both statements are true: the misfit stays small for a long way and then, all at once, needs an extra half-plane.
The strain that arrives with the transition
A crystal that loses symmetry usually changes shape, and whether it does is a subtraction: how many strain components the child permits, minus how many the parent did. The difference is a distortion nobody applied, and it is what makes a domain visible in a microscope.
The walls a strain permits
Two domains of different shape can only meet along a line neither of them stretches. That condition is a quadratic in a direction, so a pair of domains has exactly two permissible walls — and the reason there are always two rather than sometimes none is that their strains differ by no area at all.
The polarisation nobody asked for
A mode whose displacements cancel exactly can still leave a phase whose class permits a polarisation. The crystal then becomes polar as a side effect of a transition that was about something else — and in the plane, at the zone centre, the arithmetic says this cannot happen at all.
The dislocations a boundary allows
Two crystals meeting at a coincidence angle share one lattice and generate another. The second is where a boundary's own defects live, its shortest vector is one over the square root of the index, and a dislocation's energy is the square of that.
The wall has a group of its own
A boundary between two domains is periodic along its length and bounded across it, so its symmetry is a frieze. The seven, derived here early on as an exercise on a strip, turn out to be the classification of interfaces.
A hundred and thirteen orbits, and forty-eight shapes
This collection reports 113 kinds of crystal form and every mineralogy text reports 47. That difference was explained here in a paragraph and never computed, which means nobody had checked it. Computing it needs a definition of *shape* a program can decide, and the definition turns out to be the interesting part.
The figure of merit a supercell always beats
Indexing a powder pattern returns a ranked list rather than an answer, and the ranking needs a number. The obvious number — how well the cell accounts for the lines — is exactly the number a supercell cannot lose on, because the supercell's grid contains the true cell's grid and the discrepancies are identical to every digit. What has to be paid for is the lines nobody saw.
The densest packing of a shape that is not a disc
Which lattice packs equal discs most densely has a proof that finishes. Replace the disc with a pentagon and the same question has no closed form, but it does have a reduction: translates overlap exactly when the difference of their positions lies inside the shape minus itself, so the question becomes the smallest determinant a lattice can have while avoiding one convex body — and that is a search with a resolution attached.