Skip to main content
Acta Crystallographica Section A: Foundations and Advances logoLink to Acta Crystallographica Section A: Foundations and Advances
. 2023 Jan 1;79(Pt 1):1–13. doi: 10.1107/S2053273322010075

Geographic style maps for two-dimensional lattices

Matthew Bright a, Andrew I Cooper a, Vitaliy Kurlin a,*
Editor: M I Aroyob
PMCID: PMC9813684  PMID: 36601758

Continuous invariant-based maps visualize for the first time all two-dimensional lattices extracted from hundreds of thousands of known crystal structures in the Cambridge Structural Database.

Keywords: two-dimensional lattices, reduced basis, obtuse superbase, isometry, complete invariants, metric tensor, continuity

Abstract

This paper develops geographic style maps containing two-dimensional lattices in all known periodic crystals parameterized by recent complete invariants. Motivated by rigid crystal structures, lattices are considered up to rigid motion and uniform scaling. The resulting space of two-dimensional lattices is a square with identified edges or a punctured sphere. The new continuous maps show all Bravais classes as low-dimensional subspaces, visualize hundreds of thousands of lattices of real crystal structures from the Cambridge Structural Database, and motivate the development of continuous and invariant-based crystallography.

1. Practical motivations for solving the problem of how to continuously classify lattices

This paper for mathematical crystallographers presents applications of the work of Kurlin (2022b ) written for mathematicians and computer scientists, with proofs of the invariance of map coordinates up to basis choice, and their continuity under perturbations of a basis. A lattice can be considered as a periodic crystal whose atomic motif consists of a single point. In Euclidean space Inline graphic , a lattice Inline graphic consists of all integer linear combinations of basis vectors v 1, …, v n , which span a primitive unit cell U of Λ.

Crystallography traditionally splits crystals into only finitely many classes, for instance by their space-group types. These discrete symmetry-based classifications were suitable for distinguishing highly symmetric crystals manually or simply by eye. Nowadays crystals are simulated and synthesized on an industrial scale. The Cambridge Structural Database (CSD) contains nearly 1.2 million existing crystal structures (Groom et al., 2016). Crystal structure prediction (CSP) tools generate millions of crystal structures even for a fixed chemical composition (Pulido et al., 2017), mostly with P1 symmetry. Data sets of this size require finer classifications than by 230 crystallographic groups.

A more important reason for a continuous approach to classifying periodic structures is the inevitability of noise in data. Slight changes in initial simulated or actual crystallization conditions mean that the same crystal can have slightly different X-ray patterns, leading to close but distinct structures. Fig. 1 shows that a reduced cell cannot be used to continuously quantify a distance between general periodic sets. If we consider only lattices, a similar discontinuity of a reduced basis arises in Fig. 2.

Figure 1.

Figure 1

For almost any perturbation of atoms, the symmetry group and any reduced cell (even its volume) discontinuously change, which justifies a continuous classification.

Figure 2.

Figure 2

The deformation of the basis v 1 = (1, 0), v 2 = (−t, 2) for t ∈ [0, 1] defines a continuous loop of lattices. The basis v 1, v 2 is reduced for Inline graphic but after Inline graphic switches to a non-equivalent (up to rigid motion) reduced basis v 1, v 0 = (t − 1, −2).

Consider the family of lattices with the basis v 1 = (1, 0), v 2(t) = (−t, 2) in Fig. 2, where the parameter t varies continuously in [0, 1]. Since the initial basis v 1 = (1, 0), v 2(0) = (0, 2) and final basis v 1 = (1, 0), v 2(1) = (−1, 2) define identical lattices, this continuous family of lattices is a closed loop in the space of all lattices. For Inline graphic , the given basis v 1 = (1, 0), v 2(t) = (−t, 2) is reduced by Definition 2.1. At the critical moment Inline graphic , the lattice has several primitive bases that can be chosen as reduced.

When t passes through Inline graphic , if we keep the angle between basis vectors continuous, the reduced basis v 1 = (1, 0), Inline graphic = Inline graphic switches to v 1 = (1, 0), Inline graphic . For any choice at Inline graphic , the basis v 1 = (1, 0), v 0(t) = (t − 1, − 2) will be a new reduced basis for Inline graphic . The above change at Inline graphic creates the discontinuity because the given bases Inline graphic and Inline graphic = Inline graphic at Inline graphic differ only by a small perturbation 2ɛ > 0 in all coordinates but the lattices have the reduced bases v 1, Inline graphic and v 1, Inline graphic , whose last coordinates differ by 4. These reduced bases cannot be made close by rigid motion because they have opposite anticlockwise angles from v 1 to the longer vector.

One way to call lattices identical (or equivalent) is to ignore deviations of lattice parameters up to a certain threshold. An equivalence gives rise to a justified classification only if this equivalence relation (denoted by ∼) satisfies the axioms: (i) reflexivity: any lattice Λ is equivalent to itself, so Λ ∼ Λ; (ii) symmetry: if Λ ∼ Λ′, then Λ′ ∼ Λ; (iii) transitivity: if Λ ∼ Λ′ and Λ′ ∼ Λ′′, then Λ ∼ Λ′′.

The transitivity axiom is needed to split lattices into disjoint equivalence classes: the class [Λ] consists of all lattices equivalent to Λ, since if Λ is equivalent to Λ′, which is equivalent to Λ′′, all three lattices are in the same class. Past equivalences in the work of Lima-de-Faria et al. (1990) use numerical thresholds to determine a lattice class but, as Fig. 3 illustrates, all lattices can be made equivalent through sufficiently many slight perturbations up to any positive threshold due to the transitivity axiom.

Figure 3.

Figure 3

All lattices continuously deform into each other if we allow any small changes.

An alternative mathematical approach classifies lattices by space groups and finer algebraic structures (Nespolo, 2008). Since crystal structures are determined as rigid forms, the most practically important equivalence of crystal structures and their lattices is a rigid motion, which in Inline graphic is any composition of translations and rotations. This is the strongest possible equivalence on crystals that are indistinguishable as rigid bodies.

Slightly weaker is equivalence based on isometry or congruence, denoted by Λ ≅ Λ′, which is any rigid motion composed of mirror reflections. Even if we fix an equivalence such as isometry, Sacchi et al. (2020) highlight that the key question ‘same or different’ remains unanswered. What is needed is the notion of an invariant.

Definition 1.1 (invariants versus complete invariants)

A descriptor I, such as a numerical vector, is called an isometry invariant of a lattice Inline graphic if I takes the same value on all isometric lattices: if Λ ≅ Λ′ are isometric then I(Λ) = I(Λ′), so I has no false negatives. An isometry invariant I is called complete (or injective) if the converse also holds: if I(Λ) = I(Λ′) then Λ ≅ Λ′, so I distinguishes all non-isometric lattices. Hence a complete invariant I has neither false negatives nor false positives (see Fig. 4).

Figure 4.

Figure 4

The root invariant RI(Λ) from Definition 3.1 used for mapping crystal structures from the CSD in this paper is a continuous and complete isometry invariant of all two-dimensional lattices.

In a fixed coordinate system, the basis vectors are not isometry invariants as they change under rotation, but the primitive cell area is preserved by isometry. If an invariant I takes different values on lattices Λ, Λ′, these lattices are certainly not isometric, while non-invariants cannot help distinguish equivalent objects. For example, isometric lattices Λ ≅ Λ′ can have infinitely many primitive bases. Most isometry invariants allow false positives that are non-isometric lattices Inline graphic with I(Λ) = I(Λ′). For instance, infinitely many non-isometric lattices have the same primitive cell area.

Complete invariants are the main goal of all classifications. Continuous invariants, which change only slightly under small perturbations of the underlying object, are even better. The dependence of pseudosymmetry on thresholds discussed by Zwart et al. (2008) can be resolved in a continuous way by finding, for any given lattice, its closest higher-symmetry neighbour through continuous invariants as in Problem 1.2.

Problem 1.2

Find a complete isometry invariant I(Λ) of any lattice Inline graphic with a metric d satisfying all necessary axioms and the new continuity condition below:

(i) First axiom: d(Λ, Λ′) = 0 if and only if Λ ≅ Λ′ are isometric;

(ii) Symmetry axiom: d(Λ, Λ′) = d(Λ′, Λ) for any lattices Inline graphic ;

(iii) Triangle axiom: d(Λ, Λ′) + d(Λ′, Λ′′) ≥ d(Λ, Λ′′) for any lattices Inline graphic ;

(iv) Lipschitz continuity: there is a constant C such that, for any lattices Inline graphic , if corresponding coordinates of their basis vectors differ by at most ɛ > 0, then d(Λ, Λ′) ≤ Cɛ.

This paper applies a solution of Problem 1.2 from Kurlin (2022b ) to visualize crystal structures in the CSD on continuous maps. Sections 2 and 3 review the related past work. Section 4 maps hundreds of thousands of crystal structures in the CSD. Section 5 explains the geographical metaphor by mapping the invariant values to a sphere, where every two-dimensional lattice (up to rigid motion and uniform scaling) has unique latitude and longitude coordinates.

2. Overview of key concepts and past work on classifications of lattices

Crystallography traditionally uses a conventional cell to uniquely represent any periodic crystal (see Hahn et al., 2016). In the simpler case of three-dimensional lattices, the cell used is Niggli’s reduced cell (Niggli, 1928). Since the current paper studies lattices in Inline graphic , we give the two-dimensional version obtained from the three-dimensional definition, which is derived as a limit of the reduction conditions for a three-dimensional reduced basis with an orthogonal third vector v 3 whose length becomes infinite. For vectors v 1 = (a 1, a 2) and v 2 = (b 1, b 2) in Inline graphic , the determinant of the matrix

2.

with the columns v 1, v 2 is defined as Inline graphic .

Definition 2.1 (reduced cell)

For a lattice up to isometry, a basis and its cell U(v 1, v 2) are called reduced (non-acute) if |v 1| ≤ |v 2| and Inline graphic . Up to rigid motion, the conditions are weaker: |v 1| ≤ |v 2| and Inline graphic , Inline graphic , and the new special condition for rigid motion is: if |v 1| = |v 2| then v 1 v 2 ≥ 0.

The new conditions for rigid motion did not appear in the work of de Wolff (2016) because reduced bases were considered up to isometry including reflections. Any rectangular lattice has a unique (up to rigid motion) reduced cell a × b, but two ‘potentially reduced’ bases v 1 = (a, 0) and v 2 = (0, ± b), which are not related by rigid motion for 0 < a < b. Definition 2.1 chooses only one of these bases, namely v 1 = (a, 0) and v 2 = (0, b). So Inline graphic defines a right-handed basis in Inline graphic .

Since reduced bases are easy to compute (Křivý & Gruber, 1976), they can be used to define the discrete metric d(Λ, Λ′) taking the same non-zero value (say, 1) for any non-isometric lattices Inline graphic . Discontinuity of a reduced basis up to perturbations was practically demonstrated in the seminal work of Andrews et al. (1980). The introduction of Edelsbrunner et al. (2021) said that ‘There is no method for choosing a unique basis for a lattice in a continuous manner. Indeed, continuity contradicts uniqueness as we can continuously deform a basis to a different basis of the same lattice’; see Fig. 2 and a formal proof in Widdowson et al. (2022, theorem 15). Since a reduced basis is discontinuous under perturbations, then so is any metric on these reduced bases.

Important advances were made (Andrews & Bernstein, 1988, 2014; McGill et al., 2014; Andrews et al., 2019a ; Bernstein et al., 2022) by analysing complicated boundary cases where cell reductions can be discontinuous. Since these advances are specialized for Inline graphic , we refer the reader to another paper (Bright et al., 2021) for a detailed review of reduced bases for three-dimensional lattices.

Another way to represent a lattice Inline graphic is by its Wigner–Seitz cell (Wigner & Seitz, 1933) or Voronoi domain V(Λ) consisting of all points Inline graphic that are closer to the origin 0 ∈ Λ than to all other points of Λ (Fig. 5). Though V(Λ) uniquely determines Λ up to rotations, almost any tiny perturbation of a rectangular lattice Λ converts the rectangular domain V(Λ) into a hexagon. Hence all combinatorial invariants (numbers of vertices or edges) of V(Λ) are discontinuous, similarly in higher dimensions.

Figure 5.

Figure 5

Left: a generic two-dimensional lattice has a hexagonal Voronoi domain with an obtuse superbase v 1, v 2, v 0 = −v 1v 2, which is unique up to permutations and central symmetry. Other pictures: isometric superbases for a rectangular Voronoi domain.

However, comparing Voronoi domains as geometric shapes by optimal rotation (Mosca & Kurlin, 2020) around a common centre led to two continuous metrics on lattices up to rigid motion and uniform scaling. The minimization over infinitely many rotations was resolved only by finite sampling, so the exact computation of these metrics is still open. Similar computational difficulties remain for stronger isometry invariants of general periodic sets (Anosova & Kurlin, 2021a ,b , 2022a ,b ; Smith & Kurlin, 2022).

Another attempt to produce computable metrics was to consider distance-based invariants (Widdowson et al., 2022; Widdowson & Kurlin, 2022) whose completeness was proved for generic crystals. These invariants helped establish the crystal isometry principle by experimentally checking that all periodic crystal structures from the CSD remain non-isometric after forgetting all chemical information. This principle implies that all periodic crystals can be studied in the common crystal isometry space (CRISP) whose version for two-dimensional lattices is the lattice isometry space Inline graphic .

Though the paper by Conway & Sloane (1992) 30 years ago aimed for continuous invariants of three-dimensional lattices, no formal proofs were given even for the isometry invariance. This past work for three-dimensional lattices has been corrected and extended by Kurlin (2022a ).

Kurlin (2022b , proposition 3.10) proves that a reduced basis from Definition 2.1 is unique (also in the case of rigid motion) and all reduced bases are in a 1–1 correspondence with obtuse superbases, which are easier to visualize, especially for n ≤ 3.

Definition 2.2 (superbase, conorms pij)

For any basis v 1, …, v n in Inline graphic , the superbase v 0, v 1, …, v n from Conway & Sloane (1992) includes the vector Inline graphic . The conorms p ij = −v i v j are the negative scalar products of the vectors. The superbase is called obtuse if all p ij ≥ 0, so all angles between the vectors v i , v j are non-acute for distinct indices i, j ∈ {0, 1, …, n}. The obtuse superbase is strict if all p ij > 0.

Definition 2.2 uses the conorms p ij from Conway & Sloane (1992), which were also known as negative Selling parameters (Selling, 1874) and Delaunay parameters (Delaunay et al., 1934). Lagrange (1773) proved that the isometry class of any lattice Inline graphic with a basis v 1, v 2 is determined by the positive quadratic form

2.

where Inline graphic , q 12 = v 1 v 2, Inline graphic . The triple Inline graphic is also called a metric tensor of (a basis of) Λ. Any Q(x, y) has a reduced (non-acute) form with 0 < q 11q 22 and −q 11 ≤ 2q 12 ≤ 0, which is equivalent to reducing a basis up to isometry.

The bases v 1 = (3, 0), Inline graphic generate the mirror images not related by rigid motion, but define the same form Q = 9x 2 − 6xy + 5y 2 satisfying the reduction conditions above. So quadratic forms do not distinguish mirror images (enantiomorphs). Hence the new conditions for the rigid motion were needed in Definition 2.1.

Motivated by the non-homogeneity of the metric tensor (two squared lengths and scalar product), Delaunay (1937) proposed the homogeneous parameters

2.

called conorms by Conway & Sloane (1992) (see Definition 2.2). Then any permutation of superbase vectors satisfying v 0 + v 1 + v 2 = 0 changes p 12, p 01, p 02 by the same permutation of indices. For example, swapping v 1, v 2 is equivalent to swapping p 01, p 02.

Delaunay’s reduction (Delaunay et al., 1973) proved the key existence result: any lattice in dimensions 2 and 3 has an obtuse superbase with all p ij ≥ 0. Section 3 further develops the Delaunay parameters to show in Section 4 how millions of lattices from real crystal structures in the CSD are distributed in continuous spaces of lattices.

3. Homogeneous complete invariants of two-dimensional lattices up to four equivalences

This section provides a reminder of the lattice classifications in Theorem 3.4 based on the recent invariants introduced in Definitions 3.1 and 3.2 from Kurlin (2022b , sections 3–4).

Definition 3.1 [sign(Λ) and root invariants RI, RIo]

Let B = {v 0, v 1, v 2} be any obtuse superbase of a lattice Inline graphic . If Λ is mirror-symmetric (achiral), set sign(Λ) = 0. Otherwise v 0, v 1, v 2 have different lengths and no right angles, and hence can be ordered so that |v 1| < |v 2| < |v 0|. Let sign(Λ) be the sign of Inline graphic of the matrix with the columns v 1, v 2. The root invariant RI(Λ) is the triple of the root products Inline graphic , which have original units of vector coordinates such as ångströms and are ordered by their size for distinct indices i, j ∈ {0, 1, 2}. The oriented root invariant RIo(Λ) is RI(Λ) with sign(Λ) as a superscript, which we skip if sign(Λ) = 0.

We assume that r ij = r ji . If |v 1| < |v 2| < |v 0|, then r 12 < r 01 < r 02. If some v i , v j have equal lengths, then r ik = r jk for ki, j. Writing RI(Λ) = (r 12, r 01, r 02) means that |v 1| ≤ |v 2| ≤ |v 0| for a suitable indexing of obtuse superbase vectors v 0, v 1, v 2.

Kurlin (2022b , lemma 3.8) proved that RI(Λ) is an isometry invariant of Λ, independent of an obtuse superbase B because an obtuse superbase of Λ is unique up to isometry, also up to rigid motion for non-rectangular lattices. This uniqueness was missed by Conway & Sloane (1992) and actually fails in Inline graphic (see Kurlin, 2022a ).

Definition 3.2 (projected invariants PI, PIo)

The root invariants of all lattices Inline graphic live in the triangular cone TC in Fig. 6. The triangular projection TP: TC → QT divides each coordinate by the size σ(Λ) = r 12 + r 01 + r 02 and projects RI(Λ) to Inline graphic in the quotient triangle QT in Fig. 7. This triangle can be visualized as the isosceles right-angled triangle Inline graphic parameterized by Inline graphic and Inline graphic . The resulting pair PI(Λ) = (x, y) is the projected invariant. The oriented invariant PIo(Λ) is obtained by adding the superscript sign(Λ).

Figure 6.

Figure 6

Left: the triangular cone TC = { Inline graphic Inline graphic } is the space of all root invariants, see Definition 3.1. Middle: TC projects to the quotient triangle QT representing all two-dimensional lattices up to isometry and uniform scaling. Right: QT is parameterized by Inline graphic and Inline graphic .

Figure 7.

Figure 7

Left: all projected invariants PI(Λ) live in the quotient triangle QT parameterized by Inline graphic and Inline graphic . Right: mirror images (enantiomorphs) of any oblique lattice are represented by a pair (x, y) ↔ (1 − y, 1 − x) in the quotient square QS = QT+ ∪ QT symmetric in the diagonal x + y = 1.

All oriented projected invariants PIo(Λ) with sign(Λ) live in a union of two quotient triangles QT+ ∪ QT. These triangles should be glued along the common subspace of mirror-symmetric lattices (all non-oblique lattices Inline graphic ), whose PI(Λ) belong to the boundary of QT. Fig. 7 (right) glues the hypotenuses of QT± and indicates how to glue the remaining sides. We get a punctured sphere due to the excluded vertex (1, 0).

Example 3.3 (subspaces of Bravais classes in QT).

(tp) The square lattice Inline graphic with a unit cell a × a has RI(Λ4) = (0, a, a) ∈ TC projected by TP to Inline graphic . By Definition 3.2 the projected invariant Inline graphic = Inline graphic = Inline graphic [see Fig. 7 (left)]. So the Bravais class (tp) of all square (tetragonal) lattices Inline graphic is represented by the bottom-left vertex (0, 0) in the quotient triangle QT, identified with the top-right vertex of the quotient square QS in Fig. 7 (right).

(hp) The hexagonal lattice Λ6 with a minimum inter-point distance a has the root invariant Inline graphic = Inline graphic projected by TP to Inline graphic . The projected invariant is PI(Λ6) = (x, y) = (0, 1) ∈ QT [see Fig. 7 (left)]. The Bravais class (hp) of all hexagonal lattices Inline graphic is represented by the top-left vertex (0, 1) in the quotient triangle QT, identified with the bottom-right vertex of the quotient square QS.

(op) Any rectangular lattice Λ with a unit cell a × b for 0 < a < b has the obtuse superbase v 1 = (a, 0), v 2 = (0, b), v 0 = (−a, −b) [see Fig. 8 (left)]. Then RI(Λ) = (0, a, b) and Inline graphic belongs to the horizontal side of QT, which represents the Bravais class (op). We approach the excluded vertex (1, 0) as b → +∞.

Figure 8.

Figure 8

Left: any rectangular lattice Λ with a unit cell a × b has the obtuse superbase B with v 1 = (a, 0), v 2 = (0, b), v 0 = (−a, −b), see Example 3.3 (op). Other lattices Λ have a rectangular cell 2a × 2b and an obtuse superbase B with v 1 = (2a, 0), v 2 = (−a, b), v 0 = (−a, − b). Middle: RI(Λ) = Inline graphic , ab Inline graphic . Right: RI(Λ) = Inline graphic , Inline graphic , see Example 3.3 (oc).

(oc) Any centred rectangular lattice Λ with a conventional unit cell 2a × 2b for 0 < a < b has the obtuse superbase v 1 = (2a, 0), v 2 = (−a, b), v 0 = (−a, −b) (see Fig. 8). Then r01 = Inline graphic = r 02 and r 12 = Inline graphic . If Inline graphic , then RI(Λ) = Inline graphic and

3.

belongs to the vertical (orange) edge of QT. This vertical edge is the shortest straight-line path between the vertices (x, y) = (0, 0) representing the tetragonal and hexagonal Bravais classes, where a = b and Inline graphic , respectively. Hence the subspace of centred rectangular lattices for Inline graphic can be considered as having the symmetries of both hexagonal and square lattices. If Inline graphic , then RI(Λ) = Inline graphic and

3.

belongs to the hypotenuse x + y = 1 of the triangle QT. The open vertical edge and open hypotenuse of QT represent the Bravais class oc of all centred rectangular lattices.

The companion paper (Kurlin, 2022b ) proves the following classifications of two-dimensional lattices up to four equivalences, fulfilling the invariance and completeness conditions.

Theorem 3.4 [proved by Kurlin (2022b, theorem 4.2, corollary 4.6)]

For a lattice Inline graphic ,

(a) the invariant RI(Λ) uniquely identifies Λ up to isometry,

(b) the invariant RIo(Λ) uniquely identifies Λ up to rigid motion,

(c) the invariant PI(Λ) uniquely identifies Λ up to isometry and uniform scaling,

(d) the invariant PIo(Λ) uniquely identifies Λ up to rigid motion and uniform scaling.

Each part in Theorem 3.4 can be rephrased as a two-directional criterion. For example, part (a): any lattices Inline graphic are isometric if and only if RI(Λ) = RI(Λ′). The first (only if) direction means that if Λ ≅ Λ′ are isometric, then RI(Λ) = RI(Λ′), so RI(Λ) is an isometry invariant taking the same value on all isometric lattices. The second (if) direction means that if RI(Λ) = RI(Λ′), then Λ ≅ Λ′ are isometric.

4. Mapping millions of two-dimensional lattices extracted from crystal structures in the CSD

For any periodic crystal structure from the CSD, which has full geometric data of its lattice Inline graphic , we extract three two-dimensional lattices generated by three pairs {v 2, v 3}, {v 1, v 3}, {v 1, v 2} of given basis vectors of Λ. So the CSD provides a huge collection of 2.6 million two-dimensional lattices, which our reduction approach maps to the triangle QT in under 1 h on a standard laptop.

Fig. 9 shows all resulting 2.6 million lattices in QT. Only about 55% of all lattices have Bravais classes oc, op, hp, tp. The remaining 45% of lattices are oblique, with Bravais class mp. These occupy almost the full quotient triangle QT, although we see a somewhat greater density close to subspaces representing higher-symmetry lattices – especially around hexagonal and rectangular centred lattices.

Figure 9.

Figure 9

The heat map in QT of all two-dimensional lattices extracted from 870 000+ crystal structures in the CSD. The colour of each pixel indicates (on the logarithmic scale) the number of lattices whose projected invariant Inline graphic = Inline graphic = Inline graphic belongs to this pixel. The darkest pixels represent rectangular lattices on the bottom edge of QT.

The gap of about two pixels near the horizontal edge in Fig. 9 corresponds to Inline graphic . The relevant lattices have basis vectors v 1, v 2 whose angle is perturbed from 90° by less than 0.03°. The CSD has only 399 such lattices and Inline graphic for all but one of them. After removing all non-oblique lattices represented by root invariants along the boundary of QT, the map in Fig. 10 shows more clearly that all oblique lattices extracted from the CSD occupy the triangle QT without any gaps.

Figure 10.

Figure 10

The normal-scale heat map in QT of all two-dimensional oblique lattices from CSD crystals. After removing mirror-symmetric lattices on the boundary of QT, we can better see the tendency towards hexagonal lattices at the top-left corner (0, 1) ∈ QT.

The heat map of rectangular lattices in Fig. 11 (top) has two high-concentration (black) pixels at a ≃ 3.5 Å arising from 386 near-identical primitive monoclinic crystal structures of α-oxalic acid dihydrate. This molecule was used as a benchmark for the calculation of electron densities since its crystallographic properties were thoroughly documented by Stevens & Coppens (1980). Hundreds of publications have since generated and deposited further refinements of its structural determination.

Figure 11.

Figure 11

Heat maps of parameters (a, b) in ångströms. Top: rectangular lattices with primitive unit cells a × b in N = 1 268 065 crystal structures in the CSD. Bottom: centred rectangular lattices with conventional cells 2a × 2b in N = 150 167 crystal structures in the CSD.

In the heat map of centred rectangular lattices in Fig. 11 (bottom), the most prominent feature is the hottest area in the region where the shortest side length is between 2.5 and 5 Å. We also see a visible line Inline graphic of high-concentration pixels. This line represents two-dimensional lattices in body-centred cubic lattices, where the ratio of side lengths is Inline graphic . This ratio was reported among preferred values for lattice length ratios in dimension 3 by de Gelder & Janner (2005). Another high-concentration pixel represents 130 structures of a standard test molecule (hexamethylenetetramine), which was frequently used in the investigation of lattice vibrations (Becka & Cruickshank, 1963).

Hexagonal and square lattices are characterized by the inter-point distance a. Fig. 12 shows distributions and preferred values of a (in Å) among CSD lattices.

Figure 12.

Figure 12

The histograms of minimum inter-point distances a in ångströms.

5. Other complete invariants and a spherical map of two-dimensional lattices

In comparison with other complete invariants, RI(Λ) has the advantage of homogeneity so that any permutation σ of (indices of) superbase vectors v 0, v 1, v 2 permutes the three root products accordingly: Inline graphic . The metric tensor Inline graphic including the coefficients of the form Q Λ(x, y) = q 11 x 2 + 2q 12 xy + q 22 y 2 representing Λ is not homogeneous in the above sense. Taking square roots gives the quadratic invariant QI(Λ) = (τ11, τ12, τ22) = Inline graphic in the units of basis coordinates. The quadratic invariant QI(Λ) is complete up to isometry by Theorem 3.4(a).

In the isosceles triangle QT, continuous metrics and chiral distances have simple formulae in the work of Kurlin (2022b , sections 5–6) for the coordinates Inline graphic , Inline graphic but can be now re-written for any coordinates on Inline graphic [see the earlier non-isosceles triangles of Engel et al. (2004, Fig. 1.2 on p. 82) and Zhilinskii (2016, Fig. 6.2)].

Since the quotient square QS = QT+ ∪ QT with identified sides is a punctured sphere, it is natural to visualize QS as the round surface of Earth with QT± as the north/south hemispheres separated by the equator along their common boundary of QT represented by projected invariants PI(Λ) of all mirror-symmetric lattices Λ.

We can choose any internal point of the quotient triangle QT as the north pole. The most natural choice is the incentre P + (pole), the centre of the circle inscribed into QT+ because the rays from P + to the vertices of QT+ equally bisect the angles 90°, 45°, 45°. The incentre of QT+ has the coordinates (x, x), where Inline graphic . The lattice Inline graphic with the projected invariant Inline graphic has the basis v 1 ≃ (1.9, 0), v 2 ≃ (−0.18, 3.63) inversely designed by Kurlin [2022b , example 4.10 (Λ2)].

Definition 5.1 (spherical map SM: QS → S2)

(a) The spherical map SM sends the incentre P + of QT to the north pole of the hemisphere HS+ and the boundary ∂QT to the equator of HS+ [see Fig. 13 (middle)]. Linearly map the line segment between P + and any point (x, y) in the boundary ∂QT to the shortest arc connecting the north pole SM(P +) to SM(x, y) in the equator of HS+. Extend the spherical map to SM: QS → S 2 by sending any pair of invariants PIo±) with sign(Λ±) = ±1 to the northern/southern hemispheres of the two-dimensional sphere S 2, respectively.

(b) For any lattice Inline graphic , the latitude φ(Λ) ∈ [−90°, + 90°] is the angle from the equatorial plane EP of S 2 to the radius-vector to the point SM[PIo(Λ)] ∈ S 2 in the upwards direction. Let v(Λ) be the orthogonal projection of this radius-vector to EP. Define the Greenwich point as Inline graphic ∈ ∂QT in the line through P + and (1, 0). This G represents all centred rectangular lattices with a conventional unit cell 2a × 2b whose ratio Inline graphic can be found from Example 3.3:

Definition 5.1 (spherical map SM: QS → S2)

Setting Inline graphic , we get Inline graphic = Inline graphic , Inline graphic , Inline graphic ≃ 1.1. The Greenwich meridian is the great circle on the sphere S 2 passing through the point SM(G) in the equator E. The longitude μ(Λ) ∈ (−180°, 180°] is the anticlockwise angle from the Greenwich plane through the Greenwich meridian to the vector v(Λ) above.

Figure 13.

Figure 13

Top: in QT+, the Greenwich line goes from the ‘empty’ point (1,0) through incentre P + to the point Inline graphic . Middle: the hemisphere HS+ has the north pole at P +, the equator ∂QT+ of mirror-symmetric lattices. Bottom: the longitude μ ∈ (−180°, + 180°] anticlockwise measures angles from the Greenwich line, the latitude φ ∈ [−90°, + 90°] measures angles from the equator to the north pole.

For lattices with PI(Λ) in the straight-line segment between the excluded vertex (1, 0) and the incentre P +, we choose the longitude μ = +180° rather than −180°. Proposition 5.2 computes μ(Λ), φ(Λ) via PI(Λ) = (x, y) and is proved in Appendix A .

Proposition 5.2 (formulae for SM)

For any lattice Inline graphic with PI(Λ) = (x, y) ∈ QT, if Inline graphic , then set Inline graphic , otherwise ψ = sign(yt)90°.

The longitude of the lattice Λ is

Proposition 5.2 (formulae for SM)

The latitude is

Proposition 5.2 (formulae for SM)

The incentres P ± ∈ QT± have ψ = 0 and φ = ±90°, respectively, μ is undefined.

Example 5.3 (prominent lattices). Any mirror-symmetric lattice Inline graphic has sign(Λ) = 0, and hence belongs to the equator E of S 2 and has φ(Λ) = 0 by (2). Any square lattice Λ4 with PI(Λ4) = (0, 0) has Inline graphic by (1). Any hexagonal lattice Λ6 with PI(Λ4) = (0, 1) has Inline graphic . Any rectangular lattice Λ with Inline graphic has μ(Λ) = −90° + 202.5° = 112.5°. Any centred rectangular lattice Λ with Inline graphic at the midpoint of the diagonal of QT has Inline graphic . Any Greenwich lattice Λ G with PI(Λ G ) = G = Inline graphic has Inline graphic = Inline graphic .

The north pole represents the incentre P + whose pixel contains 230 lattices in Fig. 10 but appears sparsely populated in Fig. 14 because this incentre pixel is split into many 1 × 1° curved ‘pixels’ of a much lower concentration. The high concentration near the point representing hexagonal lattices is visible in Figs. 14, 15 as dark pixels near the longitude μ = −45°. Where non-oblique lattices are included, we see the high concentrations along the borders of QT, with primitive rectangular lattices appearing as a dark thick arc on the equator for μ ∈ [67.5°, 180°).

Figure 14.

Figure 14

The heat map of two-dimensional lattices from crystal structures in the CSD on the northern hemisphere. The radial distance is the latitude φ ∈ [0°, 90°]. Top: all N = 2 191 887 lattices with sign(Λ) ≥ 0, φ ≥ 0. Bottom: all N = 741 105 oblique lattices with sign(Λ) > 0, φ > 0.

Figure 15.

Figure 15

The heat map of two-dimensional lattices from crystal structures in the CSD on the northern hemisphere. The radial distance is the latitude φ ∈ [0°, 90°]. Top: all N = 1 854 209 lattices with sign(Λ) ≤ 0, φ ≤ 0. Bottom: all N = 406 930 oblique lattices with sign(Λ) < 0, φ < 0.

The heat maps show a hexagonal ‘ridge’ along the meridional arc at μ = −45° in Figs. 14 and 15, which appears as a round arc in Figs. 16 and 17. The concentration of exact square and rectangular lattices is even higher (dark pixels for the Bravais classes tp and op), but there are fewer lattices close to these classes possibly because manual or automatic adjustments are easier for angles close to 90° than to 60°.

Figure 16.

Figure 16

The heat map of two-dimensional lattices from crystal structures in the CSD on the western hemisphere. Angles on the circumference show the latitude φ ∈ [−90°, 90°]. Top: N = 1 100 580 lattices with μ ∈ (−180°, 0°]. The hexagonal lattice at μ = −45° and the centred rectangular lattice at μ = −112.5° are marked on the horizontal arc (western half-equator). Bottom: all N = 932 626 oblique lattices with μ ∈ (−180°, 0°] and φ ≠ 0.

Figure 17.

Figure 17

The heat map of two-dimensional lattices from crystal structures in the CSD on the eastern hemisphere. Angles on the circumference show the latitude φ ∈ [−90°, 90°]. Top: all N = 1 511 307 lattices with μ ∈ [0°, 180°), the square lattice point at μ = 67.5° and the rectangular lattice at μ = 112.5° are marked on the horizontal arc (eastern half-equator). Bottom: all N = 215 409 oblique lattices with μ ∈ [0°, 180°), φ ≠ 0.

6. Main conclusions and motivations for a continuous crystallography

The heat maps in Figs. 9–10 and 14–17 visualize for the first time 2.6 million two-dimensional lattices in real crystal structures from the CSD. The preprint of Bright et al. (2021) extends this approach to three-dimensional lattices, but there is a growing database of real and theoretical two-dimensional lattice structures with potentially interesting properties (Mounet & Gibertini, 2020) for which two-dimensional lattice invariants may have direct utility. The maps indicate that lattices occur naturally in continuous distributions, and their geometry can be investigated by continuous invariant-based classification in addition to using discrete symmetry groups. The continuous approach has the added advantage of more easily spotting structures that are geometrically nearly identical, but where small variances in crystallization conditions have led to slight structure perturbations which disrupt higher lattice symmetries. The Python code for new invariants is available at https://github.com/MattB-242/Lattice_Invariance.

Using a geographic analogue, the recent isometry invariants create complete and continuous maps for efficient navigation in the lattice isometry space Inline graphic , which can be magnified as satellite images and explored at any desirable resolution. Since each invariant is a point in a space on which various metrics can be defined, this representation leads to a continuous ‘distance’ between two lattices based on their separation in Inline graphic and also a continuous measure of ‘dissymmetry’ as the closest distance to the subspace corresponding to lattices with higher symmetry (see Kurlin, 2022b ).

The four non-generic Bravais classes of two-dimensional lattices are lower-dimensional subspaces in Inline graphic whose separate maps in Fig. 11 and 12 have no intermediate gaps and include sparse or empty regions only for small or very large values of cell parameters.

Using a biological analogue, crystallography previously took a similar approach to the classical taxonomy, dividing lattices into an increasingly complex sequence of discrete categories based on symmetries as they divided organisms according to physical characteristics; see a comprehensive review by Nespolo et al. (2018).

The new area of continuous crystallography uses the geometric properties of the lattice itself to continuously classify an individual lattice in as granular a manner as we like, in a manner akin to the modern use of genetic sequences and markers to classify organisms. Indeed, since the root invariant RI(Λ) of a lattice Λ is complete, this RI(Λ) could be said to represent the DNA of Λ. Even better than the real DNA, any two-dimensional lattice can be explicitly built up from RI(Λ) [see Kurlin (2022b ), proposition 4.9].

The complete root invariant from Definition 3.1 extends to a three-dimensional lattice as follows. For any three-dimensional lattice, depending on its Voronoi domain, all obtuse superbases Inline graphic with v 0 + v 1 + v 2 + v 3 = 0 are described by Kurlin (2022a , lemmas 4.1–4.5). Any generic three-dimensional lattice has a unique (up to isometry) obtuse superbase whose root products r ij = Inline graphic can be considered as labels on the edges of a three-dimensional tetrahedron or written in the matrix

6.

Permutations of four superbase vectors induce 4! = 24 permutations of the above six root products. Other non-generic cases require other permutations, which were not previously considered by Andrews et al. (2019b ), to guarantee a complete invariant of all three-dimensional lattices [in Kurlin (2022a , theorem 6.3)]. Maps of three-dimensional lattices extracted from crystal structures in the CSD appear in the work of Bright et al. (2021).

Working towards a complete materials genome, Widdowson et al. (2022, section 7) introduced the pointwise distance distribution (PDD). This PDD invariant distinguished all periodic point sets after a tiny perturbation. More than 200 billion pairwise comparisons of all 660 000+ periodic crystal structures in the CSD over 2 days on a modest desktop PC detected five pairs of isometric duplicates [see Widdowson et al. (2022), section 7], where two crystals are geometrically identical to the last decimal place in all data including structure factors but one atom is replaced with a different one: Cd with Mn in the pair HIFCAB versus JEPLIA. These pairs are under investigation by five journals for data integrity. (Near-)duplicates in the CSD can be recognized only by a continuous invariant taking close values for close crystals. The CSD entries DEBXIT01,…, DEBXIT06 represent two polymorphs: four (near-)duplicates of T2-γ and two (near-)duplicates of T2-β reported in our past work (Pulido et al., 2017). Zhu et al. (2022) predicted and synthesized new material based on PDD invariants.

Acknowledgments

We thank Mois Aroyo, Bernd Souvignier and Nikolai Dolbilin for helpful discussions.

Appendix A. A proof of Proposition 5.2 and plots of orientation-aware invariants

(a) For any point P = (x, y) ∈ QT, the vector Inline graphic has coordinates (xt, yt), where P + = (t, t) is the incentre (the centre of the inscribed circle) of the quotient triangle QT and Inline graphic [see Fig. 13 (top)]. Recall that, for any Inline graphic , the function Inline graphic outputs a unique angle α ∈ (−90°, 90°) such that Inline graphic . If x > t, then Inline graphic = Inline graphic is the anticlockwise angle from the positive x direction (with the origin at P +) to the vector Inline graphic .

For x = t, the limit values of arctan give ψ = sign(yt)90°. For x < t, the anticlockwise angle from the positive x direction to Inline graphic is ψ + 180°. For example, the Greenwich vector Inline graphic from the excluded vertex (1, 0) to Inline graphic ∈ QT has the anticlockwise angle ψ + 180° = 157.5° from the positive x direction because

Appendix A.

and Inline graphic . The anticlockwise angle from the x axis to Inline graphic is

Appendix A.

In all cases above, since the Greenwich vector Inline graphic was chosen as the 0-th meridian, the anticlockwise angle from Inline graphic to Inline graphic is the longitude μ = α − 157.5°. For example, any centred rectangular lattice Λ with Inline graphic has Inline graphic = Inline graphic = Inline graphic and longitude μ = α − 157.5° = −112.5°. If α − 157.5° is outside the expected range of μ ∈ (−180°, 180°], we add or subtract 360°. Any hexagonal lattice Λ6 with PI(Λ6) = (0, 1) has

Appendix A.

α = ψ + 180° = 112.5° and longitude μ = α − 157.5° = −45°. Any square lattice Λ4 with PI(Λ6) = (0, 0) has Inline graphic = Inline graphic , α = ψ + 180° = 225° and longitude μ = α − 157.5° = 67.5°. Equation (1) is split into three subcases only to guarantee the range of a longitude μ ∈ (−180°, 180°] for the anticlockwise angle α − 157.5° from Inline graphic to Inline graphic , where α is computed above.

(b) For a fixed longitude μ(Λ), the projected invariant PI(Λ) varies along the line segment L at a fixed angle from the incentre P + to the boundary ∂QT. Equation (2) is split into three subcases according to the three boundary edges of QT.

Consider the vertical edge between hexagonal and square lattices, where μ(Λ) ∈ [−45°, 67.5°]. The latitude φ(Λ) is proportional to the ratio in which the point PI(Λ) = (x, y) splits the line segment L from P + to the vertical edge. The endpoint x = 0 means that SM[PI(Λ)] is in the equator with φ = 0. The endpoint Inline graphic means that PI(Λ) = P + is in the centre whose image SM(P +) is the north pole with φ = 90°. The linear map between these extreme cases gives Inline graphic . The case of the horizontal edge of QT gives a similar φ after replacing x with y. The hypotenuse of QT, where x + y = 1, is also similar as the incentre

Appendix A.

has the latitude

Appendix A.

as expected. The factor sign(Λ) in (2) guarantees a symmetry of SM: QS → S 2 in the equator.

In the main body of this paper, we show heat maps of orientation-unaware projected invariants, which clearly demonstrate the way that lattices generated from the CSD distribute through the lattice invariant space without gaps. Fig. 18 shows plots of orientation-aware projected invariants PIo(Λ) for the same data set.

Figure 18.

Figure 18

Heat maps of two-dimensional lattices derived from crystal structures in the CSD in the quotient square QS. Each pixel in the map represents a 0.005 × 0.005 interval of projected form invariant value, where each such value uniquely represents a lattice up to rigid motion only. Top: N = 2 611 887 lattices derived from the CSD. Projected invariants for primitive and centred rectangular lattices are duplicated at the boundaries of the quotient square – indicative positions of non-trivially symmetric lattices are shown. Bottom: all N = 1 165 348 oblique (non-mirror-symmetric) lattices derived from the CSD.

In both plots, we see an additional apparent non-smooth jump across the diagonal representing higher-symmetry lattices, so that there is some apparent favouring of positive chirality among two-dimensional lattices. This is an artefact of the interaction between vectors in the initial CSD data, and our consistently ordered selection of pairs from those vectors, and should not be read as a real physical effect. We also note that there is a much lower relative concentration, apparent from the lightness of the colour of each pixel, in the standard plot of oblique lattices. In this case the oxalic acid structures mentioned in the main body of the paper all have consistent chirality and remain below the diagonal of the quotient square, while the lattices in any other pixel split between each half of the plot and therefore have much lower relative counts.

Funding Statement

This research was partially supported by the £3.5M EPSRC grant ‘Application-driven Topological Data Analysis’ (2018–2023, EP/R018472/1), the £10M Leverhulme Research Centre for Functional Materials Design (2016–2026), the last author’s Royal Academy of Engineering Fellowship ‘Data Science for Next Generation Engineering of Solid Crystalline Materials’ (2021–2023, IF2122/186) and the EPSRC grant ‘Inverse design of periodic crystals’ (2022–2024, EP/X018474/1).

References

  1. Andrews, L. C. & Bernstein, H. J. (1988). Acta Cryst. A44, 1009–1018.
  2. Andrews, L. C. & Bernstein, H. J. (2014). J. Appl. Cryst. 47, 346–359. [DOI] [PMC free article] [PubMed]
  3. Andrews, L. C., Bernstein, H. J. & Pelletier, G. A. (1980). Acta Cryst. A36, 248–252.
  4. Andrews, L. C., Bernstein, H. J. & Sauter, N. K. (2019a). Acta Cryst. A75, 115–120. [DOI] [PMC free article] [PubMed]
  5. Andrews, L. C., Bernstein, H. J. & Sauter, N. K. (2019b). Acta Cryst. A75, 593–599. [DOI] [PMC free article] [PubMed]
  6. Anosova, O. & Kurlin, V. (2021a). arXiv:2103.02749.
  7. Anosova, O. & Kurlin, V. (2021b). Discrete Geometry and Mathematical Morphology, DGMM 2021. Lecture Notes in Computer Science, Vol. 12708, edited by J. Lindblad, F. Malmberg & N. Sladoje, pp. 229–241. Cham: Springer.
  8. Anosova, O. & Kurlin, V. (2022a). arXiv:2205.15298.
  9. Anosova, O. & Kurlin, V. (2022b). Discrete Geometry and Mathematical Morphology, DGMM 2022. Lecture Notes in Computer Science, Vol. 13493, edited by É. Baudrier, B. Naegel, A. Krähenbühl & M. Tajine, pp. 395–408. Cham: Springer.
  10. Becka, L. N. & Cruickshank, D. W. J. (1963). Proc. R. Soc. Lond. A, 273, 435–454.
  11. Bernstein, H. J., Andrews, L. C. & Xerri, M. (2022). arXiv:2208.04152.
  12. Bright, M., Cooper, A. I. & Kurlin, V. (2021). arXiv:2109.11538.
  13. Conway, J. H. & Sloane, N. J. (1992). Proc. R. Soc. Lond. A, 436, 55–68.
  14. Delaunay, B., Galiulin, R., Dolbilin, N., Zalgaller, V. & Stogrin, K. (1973). Dokl. Akad. Nauk SSSR, 209, 309–313.
  15. Delaunay, B., Padurov, N. & Aleksandrov, A. (1934). Mathematical Foundations of Structural Analysis of Crystals. USSR: State Technical-Theoretical Press.
  16. Delaunay, B. N. (1937). Uspekhi Mat. Nauk, 3, 16–62.
  17. Edelsbrunner, H., Heiss, T., Kurlin, V., Smith, P. & Wintraecken, M. (2021). 37th International Symposium on Computational Geometry (SoCG 2021), pp. 32:1–32:16. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  18. Engel, P., Michel, L. & Sénéchal, M. (2004). Lattice Geometry. Technical Report IHES-P-2004-45. IHES, Bures-sur-Yvette, France.
  19. Gelder, R. de & Janner, A. (2005). Acta Cryst. B61, 296–303. [DOI] [PubMed]
  20. Groom, C. R., Bruno, I. J., Lightfoot, M. P. & Ward, S. C. (2016). Acta Cryst. B72, 171–179. [DOI] [PMC free article] [PubMed]
  21. Hahn, Th., Looijenga-Vos, A., Aroyo, M. I., Flack, H. D., Momma, K. & Konstantinov, P. (2016). International Tables for Crystallography, Vol. A, edited by M. I. Aroyo, Chapter 2.1, pp. 142–174. Chichester: Wiley.
  22. Křivý, I. & Gruber, B. (1976). Acta Cryst. A32, 297–298.
  23. Kurlin, V. (2022a). arXiv:2201.10543.
  24. Kurlin, V. (2022b). Found. Comput. Math. In the press.
  25. Lagrange, J. L. (1773). Nouveaux Mémoires de l’Académie de Berlin.
  26. Lima-de-Faria, J., Hellner, E., Liebau, F., Makovicky, E. & Parthé, E. (1990). Acta Cryst. A46, 1–11.
  27. McGill, K. J., Asadi, M., Karakasheva, M. T., Andrews, L. C. & Bernstein, H. J. (2014). J. Appl. Cryst. 47, 360–364. [DOI] [PMC free article] [PubMed]
  28. Mosca, M. & Kurlin, V. (2020). Cryst. Res. Technol. 55, 1900197.
  29. Mounet, N., Gibertini, M., Schwaller, P., Campi, D., Merkys, A., Marrazzo, A., Sohier, T., Castelli, I. E., Cepellotti, A., Pizzi, G. & Marzari, N. (2020). Materials Cloud Archive, 2020.158.
  30. Nespolo, M. (2008). Acta Cryst. A64, 96–111. [DOI] [PubMed]
  31. Nespolo, M., Aroyo, M. I. & Souvignier, B. (2018). J. Appl. Cryst. 51, 1481–1491.
  32. Niggli, P. (1928). Krystallographische und strukturtheoretische Grundbegriffe, Vol. 1. Akademische verlagsgesellschaft mbh.
  33. Pulido, A., Chen, L., Kaczorowski, T., Holden, D., Little, M., Chong, S., Slater, B., McMahon, D., Bonillo, B., Stackhouse, C., Stephenson, A., Kane, C., Clowes, R., Hasell, T., Cooper, A. & Day, G. (2017). Nature, 543, 657–664. [DOI] [PMC free article] [PubMed]
  34. Sacchi, P., Lusi, M., Cruz-Cabeza, A. J., Nauha, E. & Bernstein, J. (2020). CrystEngComm, 22, 7170–7185.
  35. Selling, E. (1874). J. Reine Angew. Math. 77, 143–229.
  36. Smith, P. & Kurlin, V. (2022). Advances in Visual Computing, 17th International Symposium, ISVC 2022, San Diego, USA, Proceedings, Part II. Cham: Springer.
  37. Stevens, E. D. & Coppens, P. (1980). Acta Cryst. B36, 1864–1876.
  38. Widdowson, D. & Kurlin, V. (2022). Advances in Neural Information Processing Systems (NeurIPS), Vol. 35.
  39. Widdowson, D., Mosca, M., Pulido, A., Cooper, A. I. & Kurlin, V. (2022). match, 87, 529–559.
  40. Wigner, E. & Seitz, F. (1933). Phys. Rev. 43, 804–810.
  41. Wolff, P. M. de (2016). International Tables for Crystallography, Vol. A, edited by M. I. Aroyo, Section 3.1.3, pp. 709–714. Chichester: Wiley.
  42. Zhilinskii, B. (2016). Introduction to Louis Michel’s Lattice Geometry through Group Action. EDP Sciences.
  43. Zhu, Q., Johal, J., Widdowson, D., Pang, Z., Li, B., Kane, C., Kurlin, V., Day, G., Little, M. & Cooper, A. I. (2022). J. Am. Chem. Soc. 144, 9893–9901. [DOI] [PMC free article] [PubMed]
  44. Zwart, P. H., Grosse-Kunstleve, R. W., Lebedev, A. A., Murshudov, G. N. & Adams, P. D. (2008). Acta Cryst. D64, 99–107. [DOI] [PMC free article] [PubMed]

Articles from Acta Crystallographica. Section A, Foundations and Advances are provided here courtesy of International Union of Crystallography

RESOURCES