International
Tables for Crystallography Volume A Spacegroup symmetry Edited by M. I. Aroyo © International Union of Crystallography 2016 
International Tables for Crystallography (2016). Vol. A, ch. 3.1, pp. 698718
doi: 10.1107/97809553602060000929 Chapter 3.1. Crystal lattices
H. Burzlaff,^{a} H. Grimmer,^{e} B. Gruber,^{d}^{‡} P. M. de Wolff^{c}^{§} and H. Zimmermann^{b}^{*}
^{a}Universität Erlangen–Nürnberg, RobertKochStrasse 4a, D91080 Uttenreuth, Germany,^{b}Institut für Angewandte Physik, Lehrstuhl für Kristallographie und Strukturphysik, Universität Erlangen–Nürnberg, Bismarckstrasse 10, D91054 Erlangen, Germany,^{c}Laboratorium voor Technische Natuurkunde, Technische Hogeschool, Delft, The Netherlands,^{d}Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, CZ11800 Prague 1, Czech Republic, and ^{e}Research with Neutrons and Muons, Paul Scherrer Institut, WHGA/342, Villigen PSI, CH5232, Switzerland The chapter starts with a brief revision of the basic definitions of lattices and their bases followed by a discussion of the symmetry rules for the selection of the conventional crystallographic bases and unit cells. In Section 3.1.2 crystal lattices are described and classified algebraically by their standard bases, topologically by their Voronoi domains and in terms of symmetry by Delaunay types and their Bravais types of lattices. The Delaunay reduction procedure is described and illustrated, and the resulting classification of lattices into the 24 Delaunay sorts (`Symmetrische Sorte') is presented. Reduced bases (reduced cells) are described in Section 3.1.3. The treatment starts with the definition of the reduced basis and the reduced form in terms of the metric tensor and lists the conditions (both main and special) for reduced bases of typeI cells and typeII cells. This is followed by a detailed and systematic geometric explanation of these conditions. The resulting 44 lattice characters are defined and tabulated, and the relations between the lattice characters and the conventional cell parameters of the 14 Bravais lattices are listed and discussed. In Section 3.1.4, several less known aspects of lattices, concerning mainly their classification, are treated. It is shown that the 44 lattice characters can be rigorously introduced using the topological concepts of connectedness and convexity. A very detailed division of lattices into 127 genera appears as a result of the search for a common subdivision of the classifications in Delaunay sorts and lattice characters. In Section 3.1.4.4, it is found that the conditions characterizing the conventional cells of the 14 Bravais types of lattices are only necessary and to make them sufficient they have to be extended to a more comprehensive system. It is shown which Bravais types appear as limiting cases of other, more general types. The subdivision of the Bravais types of lattices into 22 conventional characters and the problem of sublattices of arbitrary index of an ndimensional (n ≥ 1) lattice are discussed in the last two sections of the chapter. 
In three dimensions, a coordinate system is defined by an origin and a basis consisting of three noncoplanar vectors. The lengths a, b, c of the basis vectors a, b, c and the intervector angles , , are called the metric parameters. In n dimensions, the lengths are designated and the angles , where .
Another description of the basis consists of the scalar products of all pairs of basis vectors. The set of these scalar products obeys the rules of covariant tensors of the second rank (see Section 1.5.2 ). The scalar products may be written in the form of a matrix which is called the matrix of the metric coefficients or the metric tensor.
The change from one basis to another is described by a transformation matrix P. The transformation of the old basis (a, b, c) to the new basis is given by The relation holds for the metric tensors G and .
A threedimensional lattice can be visualized best as an infinite periodic array of points, which are the termini of the vectors The parallelepiped determined by the basis vectors a, b, c is called a (primitive) unit cell of the lattice (cf. Section 1.3.2.3 ), a, b and c are a primitive basis of the lattice. The number of possible lattice bases is infinite.
For the investigation of the properties of lattices, appropriate bases are required. In order to select suitable bases (see below), transformations may be necessary (Chapter 1.5 ). Of the several properties of lattices, only symmetry and some topological aspects are considered in this section. Some further properties of lattices are given in Section 3.1.4.
The treatment of the topological properties is restricted here to the consideration of the neighbourhood of a lattice point. For this purpose, the domain of influence (Wirkungsbereich, Dirichlet domain, Voronoi domain, Wigner–Seitz cell) (Delaunay, 1933) is introduced. The domain of a particular lattice point consists of all points in space that are closer to this lattice point than to any other lattice point or at most equidistant to it. To construct the domain, the selected lattice point is connected to all other lattice points. The set of planes perpendicular to these connecting lines and passing through their midpoints contains the boundary planes of the domain of influence, which is thus a convex polyhedron. (Niggli and Delaunay used the term `domain of influence' for the interior of the convex polyhedron only.) Without the use of metrical properties, Minkowski (1897) proved that the maximal number of boundary planes resulting from this construction is equal to , where n is the dimension of the space. The minimal number of boundary planes is 2n. Each face of the polyhedron represents a lattice vector. Thus, the topological, metrical and symmetry properties of infinite lattices can be discussed with the aid of a single finite polyhedron, namely the domain of influence (cf. Burzlaff & Zimmermann, 1977).
Different procedures are in use to select special bases of lattices. The reduction procedures employ metrical properties to develop a sequence of basis transformations which lead to a reduced basis and reduced cell (see Section 3.1.4).
Another possibility is to make use of the symmetry properties of lattices. This procedure, with the additional aid of standardization rules, leads to the conventional crystallographic basis and cell. In addition to translational symmetry, a lattice possesses pointgroup symmetry. No crystal can have higher pointgroup symmetry than the point group of its lattice, which is called its holohedry. (Detailed treatment of the symmetry properties of lattices and their classification is given in Chapter 1.3 . Following the terminology introduced there, the lattice point groups are the geometric classes to which the Bravais groups of the lattices belong.) The seven holohedries in three dimensions and the four in two dimensions form the basis for the classification of lattices (Table 3.1.1.1). It may be shown by an algebraic approach (Burckhardt, 1966) or a topological one (Delaunay, 1933) that the arrangement of the symmetry elements with respect to the lattice vectors is not arbitrary but well determined. Taking as basis vectors lattice vectors along important symmetry directions and choosing the origin in a lattice point simplifies the description of the lattice symmetry operations (cf. Section 3.3.1 ). Note that such a basis is not necessarily a (primitive) basis of the lattice (see below). The choice of a basis controlled by symmetry is not always unique; in the monoclinic system, for example, one vector can be taken parallel to the symmetry direction but the other two vectors, perpendicular to it, are not uniquely determined by symmetry.
^{†}The symbols for crystal families were adopted by the International Union of Crystallography in 1985; cf. de Wolff et al. (1985).

The choice of conventions for standardizing the setting of a lattice depends on the purpose for which it is used. The several sets of conventions rest on two conflicting principles: symmetry considerations and metric considerations. The following rules (i) to (vii) defining a conventional basis are taken from Donnay (1943; Donnay & Ondik, 1973); they deal with the conventions based on symmetry:
The metric parameters of the conventional basis are called lattice parameters. For the purpose of identification, additional metric rules are to be applied to make the labelling unique; they can be found in the introduction to Crystal Data (Donnay & Ondik, 1973).
When the above rules have been applied, it may occur that not all lattice points can be described by integral coordinates. In such cases, the unit cell contains two, three or four lattice points. The additional points may be regarded as centrings of the conventional cell. They have simple rational coordinates. For a conventional basis, the number of lattice points per cell is 1, 2, 3 or 4 (see Tables 3.1.2.1 and 3.1.2.2).
In two dimensions, only two centring types are needed:
In three dimensions, the following centring types are used:
In orthorhombic and monoclinic lattices, some differently centred cells can be transformed into each other without violating the symmetry conditions for the choice of the basis vectors. In these cases, the different centred cells belong to the same centring mode. In the orthorhombic case, the three types of onefacecentred cells belong to the same centring mode because the symbol of the cell depends only on the labelling of the basis vectors; C is usually preferred to A and B as the standard setting; the centring mode is designated S (seitenflächenzentriert). In the monoclinic case (bunique setting), A, I and C may occur if the basis is chosen according to rule (vi). They can be transformed into each other without changing the symmetry direction. C is used for the standard setting (cf. Section 2.1.1.2 ); it represents the centring mode S. The vectors a, c are conventionally chosen as short as the Ccentring allows so that they need not be the shortest two vectors in their net plane and need not fulfil the inequalities (3.1.1.3).
By means of the abovementioned lattice properties, it is possible to classify lattices according to various criteria. Lattices can be subdivided with respect to their topological types of domains, resulting in two classes in two dimensions and five classes in three dimensions. They are called Voronoi types. If the classification involves topological and symmetry properties of the domains, 24 Symmetrische Sorten (Delaunay, 1933) are obtained in three dimensions and 5 in two dimensions. Other classifications consider either the centring type or the point group of the lattice.
The most important classification takes into account both the lattice pointgroup symmetry and the centring mode (Bravais, 1866). The resulting classes are called Bravais types of lattices or, for short, Bravais lattices. Two lattices belong to the same Bravais type if and only if they coincide both in their pointgroup symmetry and in the centring mode of their conventional cells. The Bravais lattice characterizes the translational subgroup of a space group. The number of Bravais lattices is 1 in one dimension, 5 in two dimensions, 14 in three dimensions and 64 in four dimensions. The Bravais lattices may be derived by topological (Delaunay, 1933) or algebraic procedures (Burckhardt, 1966; Neubüser et al., 1971). It can be shown (Wondratschek et al., 1971) that `all Bravais types of the same [crystal] family can be obtained from each other by the process of centring'. As a consequence, different Bravais types of the same crystal family (cf. Section 1.3.4 ) differ in their centring mode. Thus, the Bravais types may be described by a lowercase letter designating the crystal family and an uppercase letter designating the centring mode. The relations between the point groups of the lattices and the crystal families are shown in Table 3.1.1.1. Since the hexagonal and rhombohedral Bravais types belong to the same crystal family, the rhombohedral lattice is described by hR, h indicating the family and R the centring type. This nomenclature was adopted for the 1969 reprint of International Tables for Xray Crystallography (1952) and for Structure Reports since 1975 (cf. Trotter, 1975).
In Fig. 3.1.2.1, conventional cells for the 14 threedimensional Bravais types of lattices are illustrated.

Conventional cells of the threedimensional Bravais types of lattices (for symbols see Table 3.1.2.2). 
In Tables 3.1.2.1 and 3.1.2.2, the two and threedimensional Bravais types of lattices are described in detail. For each entry, the tables contain conditions that must be fulfilled by the lattice parameters and the metric tensor. These conditions are given with respect to two different basis systems, first the conventional basis related to symmetry, second a special primitive basis (see below). In columns 2 and 3, basis vectors not required by symmetry to be of the same length are designated by different letters. Columns 4 and 5 contain the metric tensors for the two related bases. Column 6 shows the relations between the components of the two tensors.


The last columns of Tables 3.1.2.1 and 3.1.2.2 show parallel projections of the appropriate conventional unit cells. Among the different possible choices of the primitive basis, as discussed in Section 3.1.1, the special primitive basis mentioned above is obtained according to the following rules:
If a primitive basis is chosen according to these rules, basis vectors of the conventional cell have parallel facediagonal or bodydiagonal orientation with respect to the basis vectors of the primitive cell. For cubic and rhombohedral lattices, the primitive basis vectors are selected such that they are symmetryequivalent with respect to a threefold axis. In all cases, a face of the `domain of influence' is perpendicular to each basis vector of these primitive cells.
Further classifications use reduction theory. There are different approaches to the reduction of quadratic forms in mathematics. The two most important in our context are
The investigations by Gruber (cf. Section 3.1.4) have shown the common root of both crystallographic approaches. As the Niggli reduction will be discussed in detail in Sections 3.1.3 and 3.1.4, we shall discuss the Delaunay reduction here.
We start with a lattice basis . This basis is extended by a vector All scalar products are considered. The reduction is performed minimizing the sum It can be shown that this sum can be reduced by a sequence of transformations as long as one of the scalar products is still positive. If e.g. the scalar product is still positive, a transformation can be applied such that the sum of the transformed is smaller than : In the twodimensional case, holds.
If all the scalar products are less than or equal to zero, the three shortest vectors of the reduced basis are contained in the set , called the Delaunay set, which corresponds to the maximal set of faces of the Dirichlet domain (at most 14 faces).
The result of a reduction can be presented by a graphical symbol, the Selling tetrahedron. The four corners of the tetrahedron correspond to the vectors b_{1}, b_{2}, b_{3}, b_{4}, the mutual scalar products are attached to the edges. A scalar product that is zero is indicated by `0'; equal scalar products are designated by the same graphical symbol (cf. Table 3.1.2.3).

Delaunay's classification is based on Voronoi types. Voronoi distinguishes five classes of Dirichlet domains. To describe these, the following symbols are used to represent particular topological features: s is used for a hexagon and for v for a quadrangle, s^{2} indicates an edge between two hexagons and v^{2} an edge between two quadrangles, v^{4} is a vertex where four quadrangles meet and v^{3} is a vertex where three quadrangles meet. The five types are topologically characterized by: V1 (8s, 6v, 12s^{2}), V2 (4s, 8v, 4s^{2}), V3 (12v, 24v^{2}, 8v^{3}, 6v^{4}), V4 (2s, 6v, 6v^{2}) and V5 (6v, 12v^{2}, 8v^{3}). The numbers give the multiplicities of each feature.
Delaunay combined the topological description with the rotation groups of the crystallographic holohedries. He used uppercase letters for these groups (K – cubic, H – hexagonal, R – rhombohedral, Q – tetragonal, O – orthorhombic, M – monoclinic, T – triclinic) followed by a incremental number if more than one Voronoi type with the same symmetry exists. The results are presented in Table 3.1.2.3. In each row a `Symmetrische Sorte' is described.
Column 1 contains the Delaunay description followed by the Voronoi type. Beneath these, the Bravais lattice and the symbol of its holohedry are given. Next the topological features that are compatible with the symmetry axes referred to the `blickrichtungen' of the holohedry are listed. Column 2 gives the metric conditions for the occurrence of certain Voronoi types. For the monoclinic cases with centred cells (M1–M5) it is useful to introduce in addition to the vectors a, c, f = a + c special parameters (p^{2}, q^{2}, r^{2}). p designates the vector below the centring point in the projection in the net perpendicular to b. q is the shorter one of the other two vectors and r labels the remaining one (cf. Burzlaff & Zimmermann, 1985).
For practical applications, it is useful to classify the patterns of the resulting six scalar products regarding their equivalence or zero values in the form of a symbolic (Selling) tetrahedron (column 3). These classes of patterns correspond to the reduced bases. They result in 24 `Symmetrische Sorten' (Delaunay, 1933) that fix the Voronoi types and the holohedries, and simultaneously lead directly to the conventional crystallographic cells by fixed transformations (cf. Patterson & Love, 1957; Burzlaff & Zimmermann, 1993).
Column 4 contains projections of the Dirichlet domain along the symmetry directions indicated by the topological/symmetry symbol in column 1. Column 5 shows the relation between the Dirichlet domain and the conventional cell. Column 6 contains the transformation matrix from the reduced basis to the conventional basis. (Note: In the monoclinic centred case it leads to the I centring.)
In some cases, different Selling patterns are given for one `Symmetrische Sorte'. This procedure avoids a final reduction step (cf. Patterson & Love, 1957) and simplifies the computational treatment significantly. The number of `Symmetrische Sorten', and thus the number of transformations which have to be applied, is smaller than the number of lattice characters according to Niggli. Note that the introduction of reduced bases using shortest lattice vectors causes complications in more than three dimensions (cf. Schwarzenberger, 1980).
Let the basis B = (b_{1}, b_{2}, b_{3}) given by the scalar productsor by b_{1} = 2.449 (), b_{2} = b_{3} = 2.828 () (in arbitrary units), β_{23} = 60° (cos β_{23} = ½), β_{13} = 73.22° (), β_{12} = 64.34° ().
The aim is to find a standardized basis of shortest lattice vectors using Delaunay reduction. This example, given by B. Gruber (cf. Burzlaff & Zimmermann, 1985), shows the standardization problems remaining after the reduction.
The general reduction step can be described using Selling four flats. The corners are designated by the vectors a, b, c, d = −a − b − c. The edges are marked by the scalar products among these vectors. If positive scalar products can be found, choose the largest: (indicated as ab in Fig. 3.1.2.2a). The reduction transformation is: a_{D} = a, b_{D} = −b, c_{D} = c + b, d_{D} = d + b (see Fig. 3.1.2.2a). In this example, this results in the Selling four flat shown in Fig. 3.1.2.2(b). The next step, shown in Fig. 3.1.2.2(c), uses the (maximal) positive scalar product for further reduction. Finally, using b_{2} + b_{3} + b_{4} = −b_{1} we get the result shown in Fig. 3.1.2.2(d).

Delaunay reduction of Gruber's example (cf. Section 3.1.2.4). The edges of Selling tetrahedra are labelled by the scalar products of the vectors which designate the corners of the tetrahedra. 
The complete procedure can be expressed in a table, as shown in Table 3.1.2.4. Each pair of lines contains the starting basis and its scalar products before transformation as the first line, and then the transformed scalar products and the Delaunay basis after transformation below. In our case, four transformation steps are necessary. The result isThe final Selling tetrahedron shows that the Dirichlet domain belongs to Voronoi type 1. It fulfils no symmetry condition and thus corresponds to an anorthic (triclinic) lattice.

For further standardization we consider the Delaunay setAll bases of shortest lattice vectors () can be found:Any basis of shortest lattice vectors contains . For the vectors , , and are possible. can only be chosen from these vectors such that a linear independent triplet results.
The resulting five choices are given in Table 3.1.2.5. Any case corresponds to eight combinations of signs for the three basis vectors. The principle of the `homogenous corner' (i.e., there is always a pair of opposite corners of the corresponding cell where all angles are either nonacute or all three are acute) selects one of the bases in each case, thus five different bases remain. For the final choice the surfaces of the corresponding cells are given.

The maximal surface has cell No. 1 with the metrical parametersA last possibility for the standardization is the interchange of b and c with inversion of all basis vectors. In this way the sequence of β and γ can be interchanged:
Unit cells are usually chosen according to the conventions mentioned in Section 3.1.1, so one might think that there is no need for another standard choice. This is not true, however; conventions based on symmetry do not always permit unambiguous choice of the unit cell, and unconventional descriptions of a lattice do occur. They are often chosen for good reasons or they may arise from experimental limitations such as may occur, for example, in highpressure work. So there is a need for normalized descriptions of crystal lattices.
Accordingly, the reduced basis^{1} (Eisenstein, 1851; Niggli, 1928), which is a primitive basis unique (apart from orientation) for any given lattice, is at present widely used as a means of classifying and identifying crystalline materials. A comprehensive survey of the principles, the techniques and the scope of such applications is given by Mighell (1976). The present contribution merely aims at an exposition of the basic concepts and a brief account of some applications.
The main criterion for the reduced basis is a metric one: choice of the shortest three noncoplanar lattice vectors as basis vectors. Therefore, the resulting bases are, in general, widely different from any symmetrycontrolled basis, cf. Section 3.1.1.
A primitive basis a, b, c is called a `reduced basis' if it is righthanded and if the components of the metric tensor G (cf. Section 3.1.1) satisfy the conditions shown below. The matrix (3.1.3.1) for the reduced basis is called the reduced form.
Because of lattice symmetry there can be two or more possible orientations of the reduced basis in a given lattice but, apart from orientation, the reduced basis is unique.
Any basis, reduced or not, determines a unit cell – that is, the parallelepiped of which the basis vectors are edges. In order to test whether a given basis is the reduced one, it is convenient first to find the `type' of the corresponding unit cell. The type of a cell depends on the sign of If , the cell is of type I, if it is of type II. `Type' is a property of the cell since T keeps its value when a, b or c is inverted. Geometrically speaking, such an inversion corresponds to moving the origin of the basis towards another corner of the cell. Corners with all three angles acute occur for cells of type I (one opposite pair, the remaining six corners having one acute and two obtuse angles). The other alternative, specified by main condition (ii) of Section 3.1.3.3, viz all three angles nonacute, occurs for cells of type II (one or more opposite pairs, the remaining corners having either one or two acute angles).
The conditions can all be stated analytically in terms of the components (3.1.3.1), as follows:
The geometrical interpretation in the following sections is given in order to make the above conditions more explicit rather than to replace them, since the analytical form is obviously the most suitable one for actual verification.
The main conditions^{2} express the following two requirements:
Condition (i) is by far the most essential one. It uniquely defines the lengths a, b and c, and limits the angles to the range . However, there are often different unit cells satisfying (i), cf. Gruber (1973). In order to find the reduced basis, starting from an arbitrary one given by its matrix (3.1.3.1), one can: (a) find some basis satisfying (i) and (ii) and if necessary modify it so as to fulfil the special conditions as well; (b) find all bases satisfying (i) and (ii) and test them one by one with regard to the special conditions until the reduced form is found. Method (a) relies mainly on an algorithm by Buerger (1957, 1960), cf. also Mighell (1976). Method (b) stems from a theorem and an algorithm, both derived by Delaunay (1933); the theorem states that the desired basis vectors a, b and c are among seven (or fewer) vectors – the distance vectors between parallel faces of the Voronoi domain – which follow directly from the algorithm. The method has been established and an example is given by Delaunay et al. (1973), cf. Section 3.1.2.3 where this method is described.
For a given lattice, the main condition (i) defines not only the lengths a, b, c of the reduced basis vectors but also the plane containing a and b, in the sense that departures from special conditions can be repaired by transformations which do not change this plane. An exception can occur when ; then such transformations must be supplemented by interchange(s) of b and c whenever either (3.1.3.3b) or (3.1.3.5b) is not fulfilled. All the other conditions can be conveniently illustrated by projections of part of the lattice onto the ab plane as shown in Figs. 3.1.3.1 to 3.1.3.5. Let us represent the vector lattice by a point lattice. In Fig. 3.1.3.1, the net in the ab plane (of which OBAD is a primitive mesh; , ) is shown as well as the projection (normal to that plane) of the adjoining layer which is assumed to lie above the paper. In general, just one lattice node of that layer, projected in Fig. 3.1.3.1 as P, will be closer to the origin than all others. Then the vector is according to condition (i). It should be stressed that, though the ab plane is most often (see above) correctly established by (i), the vectors a, b and c still have to be chosen so as to comply with (ii), with the special conditions, and with righthandedness. The result will depend on the position of P with respect to the net. This dependence will now be investigated.
The inner hexagon shown, which is the twodimensional Voronoi domain around O, limits the possible projected positions P of . Its short edges, normal to OD, result from (3.1.3.4b); the other edges from (3.1.3.2a). If the spacing d between ab net planes is smaller than b, the region allowed for P is moreover limited inwardly by the circle around O with radius , corresponding to the projection of points for which . The case has been dealt with, so in order to simplify the drawings we shall assume . Then, for a given value of d, each point within the abovementioned hexagonal domain, regarded as the projection of a lattice node in the next layer, completely defines a lattice based on , and . Diametrically opposite points like P and represent the same lattice in two orientations differing by a rotation of 180° in the plane of the figure. Therefore, the systematics of reduced bases can be shown completely in just half the domain. As a halving line, the normal to OA is chosen. This is an important boundary in view of condition (ii), since it separates points P for which the angle between and OA is acute from those for which it is obtuse.
Similarly, , normal to OB, separates the sharp and obtuse values of the angles . It follows that if P lies in the obtuse sector (crosshatched area) between and , the reduced cell is of type I, with basis vectors , , and . Otherwise (hatched area), we have a typeII reduced cell, with and and as shown by and .
Since type II includes the case of right angles, the borders of this region on and are inclusive. Other borderline cases are points like R and , separated by b and thus describing the same lattice. By condition (3.1.3.5c) the reduced cell for such cases is excluded from type II (except for rectangular a, b nets, cf. Fig. 3.1.3.2); so the projection of c points to R, not . Accordingly, this part of the border is inclusive for the typeI region and exclusive (at ) for the typeII region as indicated in Fig. 3.1.3.3. Similarly, (3.1.3.5d) defines which part of the border normal to OA is inclusive.
The inclusive border is seen to end where it crosses OA, OB or OD. This is prescribed by the conditions (3.1.3.3d), (3.1.3.3c) and (3.1.3.5f), respectively. The explanation is given in Fig. 3.1.3.1 for (3.1.3.3c): The points Q and represent the same lattice because (diametrically equivalent to Q as shown before) is separated from by the vector b. Hence, the point M halfway between O and B is a twofold rotation point just like O. For a primitive orthogonal a, b net, only type II occurs according to (3.1.3.5c) and (3.1.3.5d), cf. Fig. 3.1.3.2. A centred orthogonal a, b net of elongated character (shortest net vector in a symmetry direction, cf. Section 3.1.3.5) is depicted in Fig. 3.1.3.4. It yields typeI cells except when [condition (3.1.3.5c)]. Moreover, (3.1.3.3c) eliminates part of the typeI region as compared to Fig. 3.1.3.3. Finally, a centred net with compressed character (shortest two net vectors equal in length) requires criteria allowing unambiguous designation of a and b. These are conditions (3.1.3.3a) and (3.1.3.5a), cf. Fig. 3.1.3.5. The simplicity of these bisecting conditions, similar to those for the case mentioned initially, is apparent from that figure when compared with Fig. 3.1.3.3. This compressed type of centred orthogonal a, b net is limited by the case of a hexagonal net (where it merges with the elongated type, Fig. 3.1.3.4) and by the centred quadratic net (where it merges with the primitive orthogonal net, Fig. 3.1.3.2). In the limit of the hexagonal net, the triangle Ohh in Figs. 3.1.3.4 and 3.1.3.5 is all that remains, it is of type I except for the point O. For the quadratic net, only the typeII region in Fig. 3.1.3.5, then a triangle with all edges inclusive, is left. It corresponds to the triangle Oqq in Fig. 3.1.3.2.
Apart from being unique, the reduced cell has the further advantage of allowing a much finer differentiation between types of lattices than is given by the Bravais types. For twodimensional lattices, this is apparent already in the last section where the centred orthogonal class is subdivided into nets with elongated character and those with compressed character, depending on whether the shortest net vector is, or is not, a symmetry direction. It is impossible to perform a continuous deformation – within the centred orthogonal type – of an elongated net into a compressed one, since one has to pass through either a hexagonal or a quadratic net.
In three dimensions, lattices are of the same character if, first, a continuous deformation of one into the other is possible without leaving the Bravais type. Secondly, it is required that all matrix elements of the reduced form (3.1.3.1) change continuously during such a deformation. These criteria lead to 44 different lattice characters (Niggli, 1928; Buerger, 1957). Each of them can be recognized easily from the relations between the elements of the reduced form given in Table 3.1.3.1 [adapted from Table 5.1.3.1 in International Tables for Xray Crystallography (1969), which was improved by Mighell & Rodgers (1980)]. The numbers in column 1 of this table are at the same time used as a general notation of the lattice characters themselves. We speak, for example, about the lattice character No. 7 (which is part of the Bravais type tI) etc.
^{†}The symbols for Bravais types of lattices were adopted by the International Union of Crystallography in 1985; cf. de Wolff et al. (1985). The capital letter of the symbols in this column indicates the centring type of the cell as obtained by the transformation in the last column. For this reason, the standard symbols mS and oS are not used here.
^{‡}. ^{§} plus . 
In Table 3.1.3.2, another description of lattice characters is given by grouping together all characters of a given Bravais type and by indicating for each character the corresponding interval of values of a suitable parameter p, expressed in the usual parameters of a conventional cell. In systems where no generally accepted convention exists, the choice of this cell has been made for convenience in the last column of this table.
^{†}The symbols for Bravais types of lattices were adopted by the International Union of Crystallography in 1985; cf. de Wolff et al. (1985).
^{‡}These conventions refer to the cells obtained by the transformations of Table 3.1.3.1. They have been chosen for convenience in this table. ^{§}. ^{¶}. ^{††}Setting with unique axis b; ; for both P and I cells, or for C cells. ^{‡‡}This number specifies the centred net among the three orthogonal nets parallel to the twofold axis and passing through (1) the shortest, (2) the second shortest, and (3) the third shortest lattice vector perpendicular to the axis. For example, `2, 3' means that either net (2) or net (3) is the centred one. 
The subdistinctions `centred net = 1, 2 or 3' for the monoclinic centred type are closely related to the description in other conventions. For instance, they correspond to C, A or Icentred cells, respectively, if b is the unique axis and a and c are the shortest vectors perpendicular to b; note that in Table 3.1.3.2 only C and I, not A, cells are listed. From the multiple entries in Table 3.1.3.2 for this type, it follows that the description in terms of b/a is not exhaustive; the distinctions depend upon rather intricate relations (cf. Mighell et al., 1975; Mighell & Rodgers, 1980).
No attempt has been made in Table 3.1.3.2 to specify whether the end points of p intervals are inclusive or not. For practical purposes, they can always be taken to be noninclusive. Indeed, the end points correspond either to a different Bravais type or to a purely geometric singularity without physical significance. If p is very close to an interval limit of the latter kind, one should be aware of the fact that different measurements of such a lattice may yield different characters, with totally differing aspects of the reduced form.
Classification. The reduced basis can be used to derive the Bravaislattice type and the conventional cell parameters, starting from an arbitrary description of the lattice. For this purpose, the reduced form is first derived from the given description, e.g. by means of the algorithm of Křivý & Gruber (1976). Subsequently it is compared with the reduced forms (Table 3.1.3.1) for the 44 lattice characters and transformed to the appropriate conventional cell. Thus the reduced cell is helpful as an accessory in classifications based on conventional cells.
Alternatively, the parameters of the reduced form itself (either of the direct lattice or of the reciprocal lattice) can be used as a basis for determinative classification.
Comparison of lattices. Two lattices, defined by their reduced cells, can be compared on a rigorous basis to find out whether they are identical lattices or are related by one cell being a subcell of the other (Santoro et al., 1980).
Further properties of lattices are discussed in Section 3.1.4.
P. M. de Wolff wishes to thank Dr B. Gruber (Prague) and Dr A. Santoro (Washington) for reading the manuscript for Section 3.1.3 and for suggesting several improvements as well as pointing out errors, especially in Tables 3.1.3.1 and 3.1.3.2.
In Section 3.1.3.2, a `reduced basis' of a lattice is defined which permits a unique representation of this lattice. It was introduced into crystallography by Niggli (1928) and incorporated into International Tables for Xray Crystallography (1969), Vol. I. Originating from algebra (Eisenstein, 1851), a reduced basis is defined in a rather complicated manner [conditions (3.1.3.2a) to (3.1.3.5f) in Section 3.1.3.2] and lacks any geometrical meaning. A cell spanned by a reduced basis is called the Niggli cell.
However, unique primitive cells may be introduced also in other ways that – unlike the Niggli cell^{3} – have significant geometrical features based mainly on extremal principles (Gruber, 1989). We shall describe some of them below.
If a (primitive) cell of the lattice L fulfils the condition on the set of all primitive cells of L, we call it a Buerger cell. This cell need not be unique with regard to its shape in the lattice. There exist lattices with 1, 2, 3, 4 and 5 (but not more) Buerger cells differing in shape. The uniqueness can be achieved by various additional conditions. In this way, we can arrive at the following four reduced cells:
Equivalent definitions can be obtained by replacing the term `surface' in (i) and (ii) by the expression or and by replacing the `deviation' in (iii) and (iv) by or A Buerger cell can agree with more than one of the definitions For example, if a lattice has only one Buerger cell, then this cell agrees with all the definitions in (3.1.4.1). However, there exist also Buerger cells that are in agreement with none of them. Thus, the definitions (3.1.4.1) do not imply a partition of Buerger cells into classes.
It appears that case (iv) coincides with the Niggli cell. This is important because this cell can now be defined by a simple geometrical property instead of a complicated system of conditions.
Further reduced cells can be obtained by applying the definitions (3.1.4.1) to the reciprocal lattice. Then, to a Buerger cell in the reciprocal lattice, there corresponds a primitive cell with absolute minimum surface^{6} in the direct lattice.
The reduced cells according to the definitions (3.1.4.1) can be recognized by means of a table and found in the lattice by means of algorithms. Detailed mutual relationships between them have been ascertained.
In his thorough analysis of lattice characters, de Wolff (1988) remarks that so far they have not been defined as clearly as the Bravais types and that an exact general definition does not exist. Gruber (1992) tried to base such a definition on topological concepts.
The crucial notion is the decomposition of a set M of points of the ndimensional Euclidean space into equivalence classes called components of the set M. They can be defined as follows: Two points X, Y of the set M belong to the same component if they can be connected by a continuous path which lies entirely in the set M (Fig. 3.1.4.1). This partition of the set M into components is unique and is determined solely by the set M.
Now let us return to lattices. To any lattice L there is attached a point in called the Niggli point of L. It is the point provided that the vectors a, b, c describe the Niggli cell of L and fulfil the conditions (3.1.3.2a) to (3.1.3.5f) of Section 3.1.3.2. If is a set of lattices then the set of Niggli points of all lattices of is called the Niggli image of .
Thus we can speak about the Niggli image of a Bravais type . This Niggli image is a part of and so can be partitioned into components. This division of Niggli points induces back a division of lattices of the Bravais type . It turns out that this division is identical with the division of into lattice characters as introduced in Section 3.1.3.5. This fact, used conversely, can be considered an exact definition of the lattice characters: Two lattices of Bravais type are said to be of the same lattice character if their Niggli points lie in the same component of the Niggli image of .
We can, of course, also speak about Niggli images of particular lattice characters. According to their definition, these images are connected sets. However, much more can be stated about them: these sets are even convex (Fig. 3.1.4.2). This means that any two points of the Niggli image of a lattice character can be connected by a straight segment lying totally in this Niggli image. From this property, it follows that the lattice characters may be defined also in the following equivalent way:
We say that two lattices of the same Bravais type belong to the same lattice character if one of them can be deformed into the other in such a way that the Niggli point of the deformed lattice moves linearly from the initial to the final position while the Bravais type of the lattice remains unchanged.
Unlike convexity, nothing can be said about whether the Niggli images of lattice characters are open sets (with regard to their dimension) or not. Both cases occur.
The lattice character of a lattice L can also be recognized [instead of by means of Table 3.1.3.1 or by Tables 1 and 3 in Gruber (1992)] by perpendicular projection of the c vector onto the ab plane provided the vectors a, b, c describe the Niggli cell of L and fulfil the conditions (3.1.3.2a) to (3.1.3.5f) in Section 3.1.3.2 (de Wolff & Gruber, 1991). See also Figs. 3.1.3.1 to 3.1.3.5.
The 44 lattice characters form a subdivision of the 14 Bravais types. There is another commonly known subdivision of the Bravais types, namely the 24 Delaunay sorts (Symmetrische Sorten) (Delaunay, 1933; International Tables for Xray Crystallography, 1952, Vol. I; cf. Section 3.1.2.3). However, the two divisions, being based on quite different principles, are incompatible: the 44 lattice characters do not form a subdivision of the 24 Delaunay sorts.
A natural problem arises to construct a division of lattices which would be a subdivision of both the lattice characters and the Delaunay sorts. However, we do not admit a purely mechanical intersection of both these divisions; we insist that their common subdivision be crystallographically meaningful.
Such a division was proposed by Gruber (1997a). It uses the fact that the Niggli points of all lattices lie in two fivedimensional polyhedra, say and . The underlying idea, originating from H. Wondratschek, is based on the distribution of Niggli points among the vertices, edges, faces, three and fourdimensional hyperfaces, and the interior of and . This leads to a natural division of Niggli points and further to a division of lattices. This division has 67 classes, but is not suitable for crystallography because it does not constitute a subdivision of the Bravais types.
A modification of the idea is necessary. It consists of representing a lattice L by several points (instead of by one Niggli point) and the addition of two minor conditions. One of them concerns the diagonals of the Niggli cell and the other the bases of L which describe the Niggli cell.
Though these conditions are of little importance in themselves, they lead to a very useful notion, viz the division of all lattices into 127 classes which is a subdivision of both the lattice characters and the Delaunay sorts. The equivalence classes of this division are called genera. They form, in a certain sense, building blocks of both lattice characters and Delaunay sorts and show their mutual relationship.
The distribution of genera along the Bravais types is the following (the number of genera is given in parentheses): cP (1), cI (1), cF (1), tP (2), tI (5), oP (1), oC (8), oI (7), oF (3), hP (3), hR (4), mP (5), mC (43), aP (43). Thus, genera seem to be especially suitable for a finer classification of lattices of low symmetry.
The genus of a given lattice L can be determined – provided that the Niggli point of L is known – by means of a table containing explicit descriptions of all genera. These descriptions are formed by open linear systems of inequalities. Consequently, the ranges of conventional parameters of genera are open unlike those concerning the lattice characters.
Genera are denoted by symbols derived from the geometrical shape of and . They can be visualized in the threedimensional cross sections of these bodies. This gives a fairly good illustration of the relationships between genera.
However, the most important feature of genera seems to be the fact that lattices of the same genus agree in a surprisingly great number of crystallographically significant properties, such as the number of Buerger cells, the densest directions and planes, the symmetry of these planes etc. Even the formulae for the conventional cells are the same. The genus appears to be a remarkably strong bond between lattices.
Conventional cells are dealt with in Section 3.1.1. They are illustrated in Fig. 3.1.2.1 and described in Table 3.1.2.2. This description, however, is not exhaustive enough for determining the Bravais type. In mathematical terms, the conditions in Table 3.1.2.2 are necessary but not sufficient. For example, the Ccentred cell with has the typical shape of a conventional cell of an mC lattice. But the lattice generated by the Ccentred cell (3.1.4.3) is actually hR with the conventional rhombohedral basis vectors
It is a natural goal to establish a system of conditions for the conventional cells which would be not only necessary but also sufficient. This is done in Table 3.1.4.1. In order to make the conditions as simple as possible, the usual mC description of the monoclinic centred lattices is replaced by the mI description. The relation between the two descriptions is simple: The exact meaning of Table 3.1.4.1 is as follows: Suppose that a Bravais type different from aP is given and that its symbol appears in column 1 in the ith entry of Table 3.1.4.1. Then a lattice L is of this Bravais type if and only if there exists a cell (a, b, c) in L such that

For most entries the conditions contain one or more signs of type < or . If one of these signs is replaced by the equality sign, a Bravais type of higher symmetry is obtained. These limiting cases are listed in column 4. A particular situation occurs for the Bravais type mI. The conditions given for this type in the first two lines of column 3 exclude the limiting cases oI, oC and oF but not hR. The latter case is excluded if none of the four pairs of equalities listed in column 4 is satisfied.
In the present section a cell of an oP, oI or oF lattice is considered conventional if it satisfies not only the conditions given in column 2 of Table 3.1.2.2 but also a < b < c. Similarly, the additional requirement a < b is made for oC and the additional requirements a < c and β > 90° for mP and mI. Column 5 gives a conventional basis (a′, b′, c′) for the limiting case expressed in terms of the conventional basis (a, b, c) for the original Bravais type. The basis is chosen such that handedness is conserved, i.e. all bases considered in this section may be regarded as righthanded. Lattices of the same type obtained from a given original Bravais type by a different limit condition differ in the shape of their conventional cell. For example, both limit conditions for the original type oP lead to lattices of type tP with axial ratios c′/a′ > 1 and < 1, respectively, as shown in column 5.
The following examples illustrate the meaning of the information on limiting cases given in Table 3.1.4.1.
The limiting cases given in Table 3.1.4.1 are illustrated in Fig. 3.1.4.3.

The Bravaislattice type of the threedimensional lattice at the upper end of a line is a limiting case of the type at the lower end. 
Figures similar to Fig. 3.1.4.3 were first published by Hosoya (1979) and, independently, by Klemm (1982). The additions made to this section in this present edition are based on Grimmer (2015).
Conventional cells for the five Bravais types of twodimensional lattices are described and illustrated in Table 3.1.2.1. The conditions given in column 2 of this table are necessary but not always sufficient. Consider the Bravais type whose symbol appears in Table 3.1.4.2 in the ith entry of column 1. A twodimensional lattice L is of this Bravais type if and only if there exists a cell (a, b) with centring mode indicated by the second letter of the Bravaistype symbol and which satisfies the conditions given in the ith entry of column 2.

The conditions in the last three entries of column 2 contain one or more signs of type < or . If one of these signs is replaced by the equality sign, a Bravais type of higher symmetry is obtained. These limiting cases are listed in column 3 of Table 3.1.4.2. Column 4 gives a conventional basis for the limiting case expressed in terms of the conventional basis for the original Bravais type.
Consider, for example, the original Bravais type mp. If a primitive cell satisfies −2b cos γ = a < b and γ > 90°, the lattice will be of type oc with conventional basis (a′, b′) = (a, 2b + a) and cell parameters satisfying .
The limiting cases given in Table 3.1.4.2 are illustrated in Fig. 3.1.4.4.
Lattice characters were defined in Section 3.1.4.2 by dividing the Niggli image of a certain Bravais type into components. Doing the same – instead of with the Niggli points – with the parameters of conventional cells^{7} of lattices of the Bravais type we obtain a division of the range^{8} of these parameters into components. This leads to a further division of lattices of the Bravais type into equivalence classes. We call these classes – in analogy to the Niggli characters – conventional characters. There are 22 of them.
Two lattices of the same Bravais type belong to the same conventional character if and only if one lattice can be deformed into the other in such a way that the conventional parameters of the deformed lattice change continuously from the initial to the final position without change of the Bravais type. The word `continuously' cannot be replaced by the stronger term `linearly' because the range of conventional parameters of the monoclinic centred lattices is not convex.
Conventional characters form a superdivision of the lattice characters. Therefore, no special notation of conventional characters need be invented: we write them simply as sets of lattice characters which constitute the conventional character. Denoting the lattice characters by integral numbers from 1 to 44 (according to the convention in Section 3.1.3.5), we obtain for the conventional characters symbols like or .
Conventional characters are described in Table 3.1.4.3.

A sublattice of an ndimensional lattice L is a proper subset of L which itself is a lattice of the same dimension as L. A sublattice of L causes a decomposition of the set L into, say, i mutually congruent sublattices, itself being one of them (Fig. 3.1.4.5). The number i is called the index of the sublattice and indicates how many times is `diluted' with respect to L.
Sublattices are defined in a natural way in those lattices that have centred conventional cells, being generated by the vertices of these cells (`decentring'). They are primitive and belong to the same crystal family as the given lattice. Thus, in the cI, cF, tI, oI, oF, oC, mC and hR^{9} lattices, we can meet sublattices of indices 2, 4, 2, 2, 4, 2, 2 and 3, respectively.
Theoretically (though hardly in crystallographic practice), the Bravais type of centred lattices can also be determined by testing all their sublattices with the suspected index and finding in any of these sublattices the Niggli cell.
All sublattices of index i of an ndimensional lattice L can be constructed by a procedure suggested by Cassels (1971). If is a primitive basis of the lattice L then primitive bases of all sublattices of index i of the lattice L can be found by the relations where the matrix fulfils The number of these matrices is equal to the number of decompositions of an ndimensional lattice L into sublattices of index i. To determine this number, it is not necessary to construct explicitly the matrices fulfilling (3.1.4.4). The following formulae (Gruber, 1997b) can be used:
For example, for and i = 2, 3, 4 and 6, we obtain for the values 7, 13, 35 and 91, respectively.
In all considerations so far, the symmetry of the lattice L was irrelevant. We took L simply as a set of points and its sublattices as its subsets. [Thus, for illustrating sublattices, the `triclinic' lattices are most apt; cf. `derivative lattices' in Chapter 13.2 in the 5th (2002) edition of this volume.]
However, this is not exactly the crystallographic point of view. If, for example, the mesh of the lattice L in Fig. 3.1.4.5 were a square, the sublattices in cases (a) and (b) would have the same symmetry (though being different subsets of L) and therefore would be considered by crystallographers as one case only. The number would be reduced. From this aspect, the problem is treated in Chapter 13.1 in the 5th (2002) edition of this volume in grouptheoretical terms which are more suitable for this purpose than the settheory language used here. See also Section 2.1.4 of International Tables for Crystallography Volume A1 (2010).
References
Bravais, A. (1866). Etudes Cristallographiques. Paris.Buerger, M. J. (1957). Reduced cells. Z. Kristallogr. 109, 42–60.
Buerger, M. J. (1960). Note on reduced cells. Z. Kristallogr. 113, 52–56.
Burckhardt, J. (1966). Die Bewegungsgruppen der Kristallographie, 2nd ed., pp. 82–89. Basel: Birkhäuser.
Burzlaff, H. & Zimmermann, H. (1977). Symmetrielehre. Part I of the series Kristallographie, pp. 96–135. Stuttgart: Thieme.
Burzlaff, H. & Zimmermann, H. (1985). On the metrical properties of lattices. Z. Kristallogr. 170, 247–262.
Burzlaff, H. & Zimmermann, H. (1993). Kristallsymmetrie–Kristallstruktur, pp. 90–105. Erlangen: R. Merkel.
Cassels, J. W. S. (1971). An Introduction to the Geometry of Numbers, p. 13. Berlin: Springer.
Delaunay, B. N. (1933). Neuere Darstellung der geometrischen Kristallographie. Z. Kristallogr. 84, 109–149.
Delaunay, B. N., Galiulin, R. V., Dolbilin, N. P., Zalgaller, V. A. & Stogrin, K. I. (1973). On three successive minima of a threedimensional lattice (in Russian). Dokl. Akad. Nauk SSSR, 209, 309–313.
Donnay, J. D. H. (1943). Rules for the conventional orientation of crystals. Am. Mineral. 28, 313–328, 470.
Donnay, J. D. H. & Ondik, H. M. (1973). Editors. Crystal Data, Vol. 2, 3rd ed. Introduction, p. 2. Washington: National Bureau of Standards.
Eisenstein, G. (1851). Tabelle der reducierten positiven quadratischen Formen nebst den Resultaten neuer Forschungen über diese Formen, insbesondere Berücksichtigung auf ihre tabellarische Berechung. J. Math. (Crelle), 41, 141–190.
Grimmer, H. (2015). Partial order among the 14 Bravais types of lattices: basics and applications. Acta Cryst. A71, 143–149.
Gruber, B. (1973). The relationship between reduced cells in a general Bravais lattice. Acta Cryst. A29, 433–440.
Gruber, B. (1978). Comments on Bravais lattices. Research report, Charles University, Prague, Czech Republic. (Details can be obtained from the author on request.)
Gruber, B. (1989). Reduced cells based on extremal principles. Acta Cryst. A45, 123–131.
Gruber, B. (1992). Topological approach to the Niggli lattice characters. Acta Cryst. A48, 461–470.
Gruber, B. (1997a). Classification of lattices: a new step. Acta Cryst. A53, 505–521.
Gruber, B. (1997b). Alternative formulae for the number of sublattices. Acta Cryst. A53, 807–808.
Hosoya, M. (1979). A new grouptheoretical derivation of the Bravais lattices. J. Phys. Soc. Jpn, 46, 1691–1694 and 1732.
International Tables for Crystallography (2002). Vol. A, 5th ed., edited by Th. Hahn. Dordrecht: Kluwer.
International Tables for Crystallography (2010). Vol. A1, 2nd ed., edited by H. Wondratschek & U. Müller. Chichester: Wiley.
International Tables for Xray Crystallography (1952). Vol. I, edited by N. F. M. Henry & K. Lonsdale, pp. 530–535. Birmingham: Kynoch Press.
International Tables for Xray Crystallography (1969). Vol. I, 3rd ed., edited by N. F. M. Henry & K. Lonsdale, pp. 530–535. Birmingham: Kynoch Press.
Klemm, M. (1982). Symmetrien von Ornamenten und Kristallen. Berlin: SpringerVerlag.
Křivý, I. & Gruber, B. (1976). A unified algorithm for determining the reduced (Niggli) cell. Acta Cryst. A32, 297–298.
Mighell, A. D. (1976). The reduced cell: its use in the identification of crystalline materials. J. Appl. Cryst. 9, 491–498.
Mighell, A. D. & Rodgers, J. R. (1980). Lattice symmetry determination. Acta Cryst. A36, 321–326.
Mighell, A. D., Santoro, A. & Donnay, J. D. H. (1975). Addenda to International Tables for Xray Crystallography. Acta Cryst. B31, 2942.
Minkowski, H. (1897). Allgemeine Lehrsätze über die konvexen Polyeder. In Gesammelte Abhandlungen. Leipzig, 1911. [Reprinted: Chelsea, New York (1967).]
Neubüser, J., Wondratschek, H. & Bülow, R. (1971). On crystallography in higher dimensions. I. General definitions. Acta Cryst. A27, 517–520.
Niggli, P. (1928). Kristallographische und strukturtheoretische Grundbegriffe. Handbuch der Experimentalphysik, Vol. 7, Part 1. Leipzig: Akademische Verlagsgesellschaft.
Patterson, A. L. & Love, W. E. (1957). Remarks on the Delaunay reduction. Acta Cryst. 10, 111–116.
Santoro, A., Mighell, A. D. & Rodgers, J. R. (1980). The determination of the relationship between derivative lattices. Acta Cryst. A36, 796–800.
Schwarzenberger, R. L. E. (1980). Ndimensional Crystallography. San Francisco: Pitman.
Selling, E. (1874). Über binäre und ternäre quadratische Formen. Crelles J. Reine Angew. Math. 77, 143ff.
Trotter, J. (1975). Editor. Structure Reports. 60year Structure Index 1913–1973. A. Metals and Inorganic Compounds. Utrecht: Bohn, Scheltema & Holkema. (Now available from Springer, Heidelberg, Germany.)
Wolff, P. M. de (1988). Definition of Niggli's lattice characters. Comput. Math. Appl. 16, 487–492.
Wolff, P. M. de, Belov, N. V., Bertaut, E. F., Buerger, M. J., Donnay, J. D. H., Fischer, W., Hahn, Th., Koptsik, V. A., Mackay, A. L., Wondratschek, H., Wilson, A. J. C. & Abrahams, S. C. (1985). Nomenclature for crystal families, Bravaislattice types and arithmetic classes. Report of the International Union of Crystallography Ad hoc Committee on the Nomenclature of Symmetry. Acta Cryst. A41, 278–280.
Wolff, P. M. de & Gruber, B. (1991). Niggli lattice characters: definition and graphical representation. Acta Cryst. A47, 29–36.
Wondratschek, H., Bülow, R. & Neubüser, J. (1971). On crystallography in higher dimensions. III. Results in R4. Acta Cryst. A27, 523–535.