 1. Introduction
 2. The different algebraic approaches of simple and multiple twinning
 3. A brief introduction to groupoids and operators
 4. Geometric and algebraic considerations on multiple twinning
 5. The Σ3ξ semigroup of multiple twinning
 6. Composition of the Σ3n operators
 7. Application for the identification of Σ3n grain boundaries
 8. Conclusions
 A1. Operators viewed as types of paths in a graph
 A2. Operators viewed as types of arrows in a groupoid
 References
 1. Introduction
 2. The different algebraic approaches of simple and multiple twinning
 3. A brief introduction to groupoids and operators
 4. Geometric and algebraic considerations on multiple twinning
 5. The Σ3ξ semigroup of multiple twinning
 6. Composition of the Σ3n operators
 7. Application for the identification of Σ3n grain boundaries
 8. Conclusions
 A1. Operators viewed as types of paths in a graph
 A2. Operators viewed as types of arrows in a groupoid
 References
research papers
Multiple Σ3^{n} grain boundaries
in cubic crystals: geometric/algebraic study and its application for the identification of the^{a}CEAGrenoble DRT/LITEN/DTH, 17 rue des Martyrs, 38054 Grenoble, France
^{*}Correspondence email: cyril.cayron@cea.fr
Multiple Σ3^{n} operators are the different types of operations (expressed by sets of equivalent operations). A general formula gives the number of variants and the number of Σ3^{n} operators for any order. Different substructures of this (free group, semigroup) can be equivalently introduced to encode the operations with strings. For any coding substructure, the operators are expressed by sets of equivalent strings. The composition of two operators is determined without any matrix calculation by string concatenations. It is multivalued due to the structure. The composition table of the operators is used to identify the Σ3^{n} grain boundaries and to reconstruct the twin related domains in the electron backscattered diffraction maps.
in cubic crystals is represented geometrically by a threedimensional fractal and algebraically by a In this the variant crystals are the objects, the misorientations between the variants are the operations, and theKeywords: electron backscatter diffraction (EBSD); fractal; groupoid; multiple twinning; twin related domain (TRD).
1. Introduction
`A twin is a complex crystalline edifice built up of two or more homogeneous parts of the same crystal species that are in contact and oriented with respect to each other according to well defined laws' (Friedel, 1904). The different origins of the twins (growth, recrystallization, mechanical deformation) are detailed by Hahn & Klapper (2003). In this paper, only the Σ3 twins in cubic materials will be studied. These twins, also called in mineralogy sphalerite twins, spinel twins or diamond twins, belong to the class of `twins by reticular (Friedel, 1904), i.e. there is a partial but exact coincidence between the lattices of each individual crystal. Σ3 means that this coincidence occurs only for one third of the lattices. More generally, two identical but misoriented cubic lattices have some points in coincidence that constitute a coincidence site (CSL) if and only if they are linked by a transformation matrix T of the form
where a_{ij} are integers and Σ is the ratio of the unit volume of the CSL referred to the unit volume of the crystal (Grimmer et al., 1974; Grimmer, 1976). Very often in metallurgy, metals with low stackingfault energy form twins by annealing and recrystallization (Kronberg & Wilson, 1949; Kopezky et al., 1991). In this case, a crystal, which we will call the primary crystal, can form twins (twins of first generation), which can themselves form twins (twins of second generation), and so on. Each crystal in this assembly is linked to another by a transformation matrix T with an associated Σ = 3^{n} with n ∈ . These crystals are connected by a chain of Σ3 twins (i.e. by Σ3^{n} operators) and form a microstructural entity usually referred to as a twinrelated domain (TRD) (Reed & Kumar, 2006).
Grain design engineering is an idea introduced by Watanabe (1985). It suggests that microstructures with a high fraction of `special' grain boundaries (which can be obtained by optimizing the elaboration process or the thermomechanical treatments) have better mechanical properties, such as improved corrosion resistance, creep resistance or weldability. Since the special Σ3 grain boundaries are considered to be the `strongest' ones, many engineers are trying to create microstructures that have a high density of Σ3 grain boundaries and large TRDs (Kumar et al., 2000). These multiply twinned materials can be characterized using electron backscatter diffraction (EBSD^{1}) in a scanning electron microscope (SEM) (for examples, see Randle & Brown, 1989; Kumar et al., 2000; Gertsman & Henager, 2003). Although the Σ3^{n} grain boundaries are easy to identify for n ≤ 4, there is no method that can automatically identify them for higher orders. Indeed, the distribution of the orientations of multiply twinned crystals is very dense and nearly isotropic for n ≥ 5, and consequently it is very difficult to distinguish a random misorientation from a special Σ3^{n} [this has been shown by Wilbrandt (1980) and will be discussed in detail later]. A similar problem has been encountered for phasetransformed materials during the identification of the operators and the reconstruction of parent grains from the EBSD data obtained from the daughter grains. A solution has been proposed by Cayron et al. (2006) based on composition tables introduced in Cayron (2006). However, a corresponds to only half a cycle and we need to generalize the theory to cycledtransformed materials. This paper is a geometric/algebraic study on the particular type of series of cycles of transformations known as multiple twinning.^{2} The theoretical results allow the identification of the Σ3^{n} grain boundaries and the reconstruction of the TRDs encountered in some metallurgical problems.
In §2, the approach of Reed et al. (2004) on multiple in metallurgy is discussed. A simple introduction to groupoids is given in §3 so as to facilitate the understanding of the further sections. In §4, multiple is represented geometrically by a threedimensional fractal and algebraically by a It is shown that the Σ3^{ω} free group introduced by Reed et al. (2004) is a possible substructure of this Another equivalent but not isomorphic substructure, the Σ3^{ξ} semigroup, is introduced in §5. In §6, the Σ3^{n} operators are encoded by sets of equivalent strings, and a general method to determine their composition is proposed. We prove that the composition is multivalued. The composition table (called composition table) is given for orders up to n = 4. Finally, in §7, we study some engineering cases (local crystallographic environment of voids or hillocks in copper films, reconstruction of the TRDs in narrow copper lines) in order to show how this table can be used to identify the Σ3^{n} grain boundaries in some EBSD maps.
To begin, we must explain some notations. The G of a crystal will be considered as the group of matrices representing its orientational symmetries. G is the cardinality of the group G (i.e. the number of matrices). If H is a of G, the expression gH means a left of matrices based on the H, it is the set {gh,h ∈ H}. The expression GTG, where T is a matrix, is the set {g_{i}Tg_{j},(g_{i},g_{j}) ∈ G^{2}}.
2. The different algebraic approaches of simple and multiple twinning
Theoretically, the first crystallographic studies on textures generated by multiple ; Wilbrandt, 1980; Gottstein, 1984). Many authors briefly mention that the algebraic structure associated with multiple is a group. However, this group is rarely defined completely and its properties are not always demonstrated. Its definition appears to vary in different publications. When no detail is given, it can be assumed that that group is O(3) (the group of orthogonal matrices), but it could be also the constituted by all the matrices verifying equation (1), or a of this last group defined by imposing the condition Σ = 3^{n}. However, these groups are too large and do not represent the true nature of multiple In fact, in these groups two equivalent transformation matrices, corresponding to the same misorientation between two crystals but differing due to a different choice of bases in those crystals, would be treated as two distinct elements whereas it would be more appropriate to consider them as the same element.
date back to the 1940s (Kronberg & Wilson, 19492.1. The approach of Reed et al. (2004) to multiple twinning
An impressive study has recently been published by Reed et al. (2004) on how multiply twinned structures, and more generally the ΣX^{m}ΣY^{n} structures with X and Y integers, can be constructed from algebraic manipulations on quaternions, simplified by a string representation and illustrated using network graphs. This theoretical work has been recently summarized and applied to simulate multiply twinned microstructures (Reed & Kumar, 2006). Since we will often refer to this work, we will give a brief description of the part of their approach that deals with multiple The misorientation from a crystal 1 to a homophase crystal 2 can be expressed by a set of equivalent matrices GR_{12}G, where R_{12} = R_{1}^{1}R_{2} is a rotation from crystal 1 to crystal 2 and G is the of the cubic crystals. This set is called a `subtype' and the order of the crystals in the pair (1,2) is important. The misorientation between two crystals 1 and 2 is expressed by a set of equivalent matrices GR_{12}G ∪ GR_{21}G, with R_{21} = R_{12}^{1}. This set is called a `type' and the order of the crystals in the pair (1, 2) is not important. The `types' define matrices that are `cubically' equivalent.^{3} In their paper, Reed et al. (2004) have used the `types' and the corresponding sets of equivalent quaternions. For example, Σ3 is a `type' and the set contains the quaternions of shape [0111], [0112] and [3111]. From the set of equivalent quaternions, the authors have separated four `cosets' which contains the quaternions [0111], [01], [01] and [01], and correspond to the 180° rotations with [111], [1], [1] and [1] axes, respectively. Each `coset' was then called a, b, c and d (in Reed & Kumar, 2006), and each Σ3^{n} operation was expressed by a string constituted of these four letters. The strings can be composed using simple concatenation and by taking into consideration a rule that eliminates the pairs of equal consecutive letters (for example abbcd = acd). All the operations can be represented by a graph. With this representation, the set of the Σ3^{n} operations form a free group^{4} called Σ3^{ω}. The work of Reed et al. (2004) brings a new understanding to multiple and introduces a rule on the Σ numbers that can help metallurgists to analyse structures with Σ3^{n} grain boundaries. However, many questions can be raised. The decomposition of the set of equivalent quaternions into four cosets is not clearly explained. It is intuitive (because the [111], [1], [1] and [1] axes are equivalent), but what are the algebraic justifications for this decomposition? Are the cosets left or right? What is the on which they are based? The authors assume that a representative can be `arbitrarily' chosen in the cosets, and they have built the group Σ3^{ω}, not with the entire cosets but with the four quaternions a = [0111], b = [01], c = [01] and d = [01]. What could be the structure if other representatives were considered? Would we obtain the same group with the same elimination rule? There are also other limitations discussed by the authors, such as `without cubic symmetry, the natural mapping between integer quaternions and CSL rotations is lost'. Is it possible to introduce another approach without quaternions (which could therefore be applied to noncubic materials)? Moreover, because the four elements a, b, c, d generate an infinity of new operations, the group Σ3^{ω} is infinite. Why is it not possible to build a finite algebraic structure to describe finite cases such as the one of a crystal and its four twinned variants? A last but not least question is also raised: we know that the composition of two Σ3 operators produces either a Σ1 operator or a Σ9 operator. However, in a group the composition is a `classical' mathematical application (the composition of two elements gives only one element), so a group structure cannot explain the multivalued aspect of the composition of the Σ3^{n} operators. What could be the algebraic structure describing the multiple and its multivalued composition? We will try to answer these questions in this paper.
2.2. A brief overview on simple twinning
The work of Reed et al. (2004) is mainly based on metallurgical tools (such as the CSL rotations). The crystallographic developments of applied in other fields of material science can be used advantageously to complete their approach. The colour group introduced by Shubnikov & Koptsik (1974) (see also Senechal, 1983) is now integrated in the modern theories of Crystallographers working in mineralogy (Wadhawan, 1997; Hahn & Klapper, 2003) and those working in physics of ferroelectric domains (Janovec, 1976) have made a synthesis of their respective approaches. This synthesis uses mathematical tools based on modern group theory such as orbits, stabilisers, partitioning etc. (Hahn et al., 1999; Janovec et al., 2003). Some crystallographers interested in grain boundaries are following the work of Pond & Vlachavas (1983) and are trying to integrate the CSL rotations in that synthesis (Grimmer & Nespolo, 2006).
Let us briefly explain the principle of G_{0} the of crystal 0 and T a We call G_{1} the of crystal 1 which is the twin of crystal 0 by the operation T. If the matrices that constitute G_{1} are expressed in the same base as those of G_{0}, the two groups are linked by G_{1} = TG_{0}T^{−1}. The two crystals have some symmetries in common that constitute the intersection group H = G_{0} ∩ G_{1}. Moreover, owing to the symmetries of the crystal 0, more than one twin crystal might be created and each element g of G_{0} that does not belong to H creates a new variant. Thus the group G_{0} can be partitioned into left cosets that represent the distinct variants:
partitioning in the case of We callwith g_{0} = e the neutral element (i.e. the identity matrix). The number of variants is given by the Lagrange formula N = G_{0}/H and their orientations are given by the sets g_{i}HT. Now, we can explain the idea of Reed et al. (2004), the `cosets' of their decomposition are in fact the sets of type g_{i}HT (which are not strictly speaking cosets because only g_{i}H are cosets).
The set of cosets in the decomposition (2) represents the assembly of twinned variants. This is sometimes called `the reduced composite group'. However, this name may be confusing. One must distinguish the group G_{0} of crystal 0 that has generated the set of variants from the set of variants itself (i.e. the set of cosets) given by
In general, G_{0}/H does not have a group structure. It is a group if and only if H is a of G_{0}. If this condition is fulfilled, G_{0}/H is a group and each of this group can be represented by one matrix arbitrarily chosen in each For example, H is a when there are only two cosets in the set (3). However, we stress here that the condition of normality of H is not fulfilled in the case of Σ3 twinning as discussed in Cayron (2006). Consequently, although one matrix (or one quaternion) can be arbitrarily chosen in each for numerical calculations (Reed et al., 2004), a method based on arbitrary choices of representatives cannot be used to justify the algebraic structure of multiple twinning.
The misorientations from a variant represented by the g_{i}H to a variant represented by the g_{j}H are isomorphic to the double cosets Hg_{ij}H, where g_{ij} = g_{i}^{1}g_{j} (Janovec et al., 2003; Cayron, 2006). Therefore, the distinct types of misorientations between ordered pairs of variants are given by the partition of G_{0} into double cosets,
These types of misorientations are also the orbits of the action of G on the sets of the ordered pairs of variants (Janovec, 1972). Double cosets are not limited to crystallography; they are also widely used in physics and chemistry^{5} (Ruch & Klein, 1983). Since double cosets can be viewed as types of actions that act on the variants, we call them operators. Their set is written
The primes in are introduced to distinguish the elements of (5) from the elements g_{i} of (3). The number of operators, N^{0}, is given by the Burnside formula or it can be obtained by a class equation (Cayron, 2006). In general, it is possible to distinguish the operator transforming the variant i into the variant j from the operator transforming the variant j into the variant i because in general Hg_{ij}H and are two distinct double cosets. The operators are then called polar. If it is not the case, i.e. Hg_{ij}H = , the operators are called ambivalent (Janovec & Přívratská, 2003). Now, it can be realized that the `subtypes' (see §2.1) correspond to the operators, and that the `types' correspond to an `artificially forced' union of complementary operators Hg_{ij}H ∪ (always ambivalent).
In Cayron (2006), all these ideas have been used to show that the set of variants associated with the set of operations that link them form an algebraic structure called of orientational variants. Is it possible to generalize the concept of to multiply twinned variants? Before going further, we would like to give some explanations on groupoids and a possible way to use them in crystallography.
3. A brief introduction to groupoids and operators
Groupoids are very useful because they are `the ideal tool for describing symmetries that apply only to parts of systems. Groupoids are more flexible and often more appropriate than the betterknown groups …' (Stewart, 2004). Groupoids were first introduced in mathematics by Brandt (1926) and they now play a key role in the category and homotopy theories. For an exact definition and mathematical details, the reader may refer to Brown (1987) or Weinstein (1996). Groupoids were used in material science to represent polytypic structures, also known as order–disorder structures (DornbergerSchiff & GrellNiemann, 1961; Sadanaga, 1978; Fichtner, 1986). Their practical applications however have remained mainly limited to the problem of diffraction enhancement of symmetry (Sadanaga & Ohsumi, 1979). Since the definition of groupoids given by mathematicians may be difficult to understand for nonmathematicians, we would like to give here our personal geometrical and simple vision on this algebraic structure.
The most important point to understand is the i,j) and (j,k) can be composed and the result is (i,k). This condition is classical and everyone has used it to add geometrically two vectors U and V. Each vector is written as a pair of points such that U = (P_{1}, P_{2}), V = (P_{2}, P_{3}) and the result is W = U + V = (P_{1}, P_{3}). Such geometrical construction has been forgotten in Cartesian geometry because the addition of vectors is commutative and can be simply resumed to additions of two numbers. The decomposition into pairs of objects is also possible for invertible matrices if they are expressed as transformation matrices from a base i to a base j: X = [B_{i}▹B_{j}]. Then, the composition XY can be written X = [B_{i}▹B_{j}], Y = [B_{j}▹B_{k}], and the result is Z = XY = [B_{i}▹B_{k}]. In addition, the analytical result of the product of two matrices is also a composition law as pointed out by Connes (1990):
composition law. It says that two pairs of objects (The decomposition of matrices into pairs of bases explains why the order of the matrices is important when calculating their product (i.e. XY is in general different from YX). The composition law can be imagined spatially as a `head/tail' condition and also temporally as a `before/after' condition. It can be used in quantum physics,^{6} biology, computer science and for any system that has connections such as graphs and networks (Stewart, 2004).
In these examples, it may be noticed that the ^{6}) and the operations between these objects (the vectors, the matrices, the frequencies^{6}). These operations can be represented by arrows that link the objects.^{7} In addition to its composition law, a must have the following properties: the composition between the arrows is associative and each arrow has an inverse. Groupoids are more general than groups because in the latter the objects and the arrows are two isomorphic entities that cannot be distinguished. Indeed, an element g of a group G is also an arrow referenced to the neutral element e because g.e (g is an object transformed by the arrow e) = g (g is an arrow).
law is based on the existence of two complementary entities: the objects (the points, the bases, the energiesA new idea known as `operator' was also introduced by Cayron (2006). This term has a meaning different from the term `operation'. An operator is a type of operation and can be expressed by a set of equivalent operations.^{8} Moreover, situations or figures that have partial iterative symmetries can often be represented by graphs. Since the vertices and the edges of a graph can be viewed respectively as the objects and the operations of a an operator can also be viewed as a type of path in a graph and expressed by a set of equivalent paths. In Appendix A, a noncrystallographic example is described in order to familiarize the reader with the idea of operator (as a type of path in a graph or as a type of arrow in a groupoid).
4. Geometric and algebraic considerations on multiple twinning
4.1. The of orientational variants
It has been shown that the orientational variants formed by a structural β → α and the operations that link them form a (Cayron, 2006). Geometrically, the daughter variants were identified to the objects of the and the misorientations were identified to the arrows between these objects. Algebraically, the details of the structure were obtained by unifying the external symmetries of the parent crystal G^{β} to the internal symmetries of the daughter crystals G^{α} with the help of a transformation matrix T representing the orientation relationship between one daughter crystal and its parent crystal. More precisely, the variants α_{i} were identified to the simple cosets H, where ∈ G^{β} and H is the intersection group between the parent crystal and a daughter crystal (given by H = TG^{α}T^{−1} ∩ G^{β}). The types of misorientations between the variants, i.e. the operators, were identified to the double cosets T^{−1}HHT. The arrow from the variant α_{i} to α_{j} and the arrow from the variant α_{j} to α_{k} can be composed and the result is the arrow from the variant α_{i} to the variant α_{k}, i.e. (α_{i}▹α_{j}) (α_{j}▹α_{k}) = (α_{i}▹α_{k}). Each operator is written as a set of equivalent arrows = {(α_{i}▹α_{j}), (α_{k}▹α_{l}), …}, i.e. a set of pairs of variants similarly misoriented. An operator is ambivalent if it transforms the variant α_{i} into the variant α_{j} and the variant α_{j} into the variant α_{i}. If this is not the case, it is described as polar. To compose the operator with the operator , , the composition rule imposes that the arrival variants of must be the starting variants of . This composition can be explicitly determined by writing ∋ (α_{i}▹α_{j}), ∋ (α_{j}▹α_{k}) and the resulting operators are those containing the arrows (α_{i}▹α_{k}). Since many operators may be obtained, the composition is multivalued. The composition table characterizes the crystallographic aspect of the transition; some tables were given for the Burgers transition by Cayron (2006) and for the martensitic transitions by Cayron et al. (2006).
4.2. The groupoids of simple twinning
Simple Σ3 in facecentred cubic (f.c.c.) materials may be imagined as a with G^{α} = G^{β} = G and T = T^{−1} the matrix representing the mirror symmetry through the (111) plane (see Table 1). The intersection group
contains 12 symmetry operations and in consequence the number of variants is N^{α} = G/H = 4. Let us call α^{0} the primary crystal (parent crystal), and , , and the four twins of this crystal (daughter crystals). More generally, the ith twin of the nth generation will be denoted .The five crystals are represented in Fig. 1(b) (this figure is probably closer to the actual algebraic developments of and partitioning than the classical representation of Fig. 1a). The four variants , , and are linked to the primary crystal α^{0} by a Σ3 operator, between them by a Σ9 operator and to themselves by a Σ1 operator: ∈ Σ3, () ∈ Σ9 for i ≠ j and () ∈ Σ1. Three groupoids may be defined:

(i) Γ^{(0)} is constituted by one object (α^{0}) and one arrow (α^{0}▹α^{0}) forming one operator (Σ1 = G).
(ii) Γ^{ (1)} is constituted by four objects (, , and ), 16 arrows () with (i, j) ∈ [0,3]^{2} partitioned into two operators (Σ1 and Σ9). This is a of orientational variants described in §4.1. The four variants are algebraically identified with the four cosets g_{i}H that constitute the set G/H and the two operators expressed in a basis of α^{0} are the double cosets of the set G\H/G: Σ1 = H and Σ9 = .
(iii) Γ^{(0+1)} = Γ^{(0)} ∪ Γ^{(1)}, which is a union of groupoids is constituted by 5 objects, 25 arrows partitioned into 3 operators (Σ1, Σ3 and Σ9). Its composition table is reported in Fig. 2. It may be checked in this table that the composition of two Σ3 can be either a Σ1 or a Σ9 operator. One may add that the result is Σ1 with a probability of 1/4 and is Σ9 with a probability of 3/4. Only arguments based on calculations of energies can modify significantly these crystallographic probabilities (but in this study, we will only consider crystallographic arguments).
4.3. The groupoids of multiple twinning
By considering simple β = α, multiple Σ3^{n} may now be imagined as a series of phase transitions β → α → β → α → β etc. In Cayron (2006), we raised the following questions: is there a general formula to calculate the number of variants and the number of operators of the nth generation? Do these numbers increase to infinity with n? We do not know the general solution to these questions but we will answer them in the special case of multiple twinning.
as a withThe approach of the previous section can be generalized, the variants of generation n and the operations that link them form a Γ^{(n)}. This can be associated with the groupoids of the previous generations Γ^{(i)} with i < n to form a denoted Γ^{(0+1+…+n)}. This last and its subgroupoids form a structure similar to a Russian doll. Its algebraic details remain to be fully determined; such a study implies the generalization of the use of cosets and double cosets to multiple cosets linked by a transformation matrix.^{9} However, we will see in the following that some basic geometrical considerations are actually sufficient to determine the operators and their composition table.
4.4. Threedimensional fractal representations
We may imagine all the . This fractal is a more complex version than the threedimensional Kepler fractal in which the tetrahedra are only translated but not rotated. The representation of Fig. 3 is a convenient way to illustrate the orientations of all the multiply twinned crystals on the same drawing. It is particularly illustrative for in 3m crystals (such as sphalerite). It may be noticed that, owing to the absence of centrosymmetricity, the [111] and [] directions are not equivalent (compare Figs. 3a and b). For m3m crystals, such as f.c.c. metals, the tetrahedra can be substituted by cubes; the generated fractal is then illustrated in Fig. 4. This fractal is constituted by interpenetrated cubes, the twinned cubes of the (n + 1)th generation are positioned at the corners of the nthgeneration cubes. By construction, the whole fractal has the same symmetries as for the primary crystal. For example, it may be checked that the cubic fractal viewed in 〈111〉 and 〈100〉 directions (Figs. 4a and b) exhibits the twodimensional 3m and 4mm symmetries, respectively.
variants in three dimensions: (i) by representing the primary crystal with a tetrahedron constituted by its four {111} planes, (ii) by creating its four variants by applying the {111} mirror symmetries, and (iii) by repeating this process. The topology makes this approach impossible for orders higher than three (it is the well known problem of tetrahedra packing). However, all the variants can be created if one decreases the size of the tetrahedra by a factor of two at each generation of the process. The result is the threedimensional fractal illustrated in Fig. 3From these figures, it appears that the number of distinct variants at the nth generation is given by = 4.3^{n}, for n ≥ 1 (see also Wilbrandt, 1980; Gottstein, 1984). We have seen that the assembly of grains twinned to the nth generation constitutes the Γ^{(0+1+…+n)} and can be represented by a fractal (stopped at the nth generation). Such assembly has its own CSL, which will be denoted CSL^{n}. It is the intersection of the lattices of all these crystals. Therefore, the CSL^{n} has the same symmetry elements as for the primary crystal and it can be referenced in the primary crystal basis with a matrix of type aE, where E is the 3 × 3 identity matrix and a ∈ . Moreover, the CSL^{n} can also be expressed with integer coordinates in the reference bases of all the twinned crystals, which means that the CSL^{n} matrix multiplied by any transformation matrix given in equation (1) with Σ = 3^{n} should be equal to an integer matrix. Since the a_{ij} coefficients in equation (1) are coprime (they have no common divisor except 1), such a condition leads to
It follows that the volume of the CSL^{n} is Σ^{multi} = 3^{3n}. This result could also probably be derived from the general formula suggested by Gertsman (2001b).
4.5. Macro/microscopic examples of threedimensional fractal shapes
We recall that the fractal representation is just a convenient way that will help us to visualize the symmetries and to simplify the calculations. However, we may wonder if such shapes can exist in nature. Indeed, with perfect isotropic growth conditions, the macroscopic shape of an assembly of multiply twinned crystals could be close to Fig. 3 for 3m structures or to Fig. 4 for m3m structures. Even if isotropic conditions are rarely found in mineralogy, multiple twins of diamond and sphalerite crystals can sometimes look like Fig. 3(b) – the reader is invited to look at the photographs reported by Palache (1932). The star polyhedral gold nanoparticles recently discovered by Burt et al. (2005) also exhibit shapes close to Fig. 3 (with n = 2). Another case is probably the fractal structure of a dislocationfree bicrystal silicon ribbon studied by Cheng (1994). He reported angles of reentrant corners (141 and 109.5°) that correspond respectively to some rotation angles of the Σ9 operator (180 − 141 ≃ 38.94°) and of the Σ3 operator (180 − 109.5 = 70.5° = angle between two {111} planes). An EBSD study of this ribbon could be interesting to confirm that the orientations of the crystals are of type Σ3^{n}. Fractal structures are also obtained by phase transformations very similar to the transformation. The hyperbranched structures of CdTe or CdSe nanocrystals are constituted of branched tetrapods (Milliron et al., 2004) resulting from the alternating transitions between the cubic sphalerite phase and the hexagonal wurtzite phase: sphalerite transforms into four wurtzite branches in the 〈111〉 directions (as in the case), and each wurtzite branch transforms into two sphalerite branches in the two +c and −c directions.
5. The Σ3^{ξ} semigroup of multiple twinning
The whole threedimensional fractal represents the whole Γ^{∞} = Γ^{(0+1+…+n)} with n = ∞. What is the relation between the free group Σ3^{ω} introduced by Reed et al. (2004) and Γ^{∞}? In the group Σ3^{ω}, the four strings that begin with the letters a, b, c and d correspond to the four branches of the fractal. Each string of the free group Σ3^{ω} encodes a path on the fractal. It must be remembered that the four letters represent 180° rotation matrices that were chosen in the sets HT, g_{1}HT, g_{2}HT and g_{3}HT. The relative simplicity of the Σ3^{ω} structure results from this `not so arbitrary' choice. Other choices of representatives in those sets lead to different algebraic structures that are all substructures of Γ^{∞}. In order to convince the reader, we are creating a structure denoted Σ3^{ξ}, which will be proved to be not isomorphic to Σ3^{ω}, but that can also be used to encode the Σ3^{n} operators. The representatives are chosen in the sets HT, g_{1}HT, g_{2}HT and g_{3}HT such that the faces of the tetrahedra in the developed representation of the fractal of Fig. 3 (Fig. 5a) are `harmoniously' enumerated. These matrices T_{0}, T_{1}, T_{2}, T_{3} and their corresponding geometrical meaning are reported in Table 1.
5.1. Calculation of the operators
The whole fractal and the associated Σ3^{n} operators can be constructed from the four T_{i} matrices of Table 1 by calculating the matrix products T_{i}T_{j}T_{k}…T_{l}. In all the following, these products will be written as strings
The operations are encoded by the strings and the operators are encoded by sets of equivalent strings. The calculations can be reduced to the minimum if the symmetries of the fractal (i.e. the symmetries of the primary crystal) are taken into consideration. Indeed, the fractal is constituted by four main branches on the four threefold axes of α^{0}, which are obtained by taking as the first matrix in the product (8) T_{0} for branch 0, T_{1} for branch 1, T_{2} for branch 2, and T_{3} for branch 3. Since these branches are all geometrically equivalent, all the operations can be done with only one branch. We choose branch 1, i.e. the one starting with T_{1}. These geometrical considerations explain why there is only one Σ3 operator. The first variant on this branch is . From this variant, three new variants , and can be created, and they are all equivalent due to the threefold symmetry of this branch. Therefore, to calculate the other operators, we can limit ourselves to calculate the matrix products that start with T_{1}T_{1}, i.e. the strings 11… These geometrical considerations explain why there is only one Σ9 operator. From , three new variants can be created, but two are equivalent due to the mirror symmetry on the plane (011). Therefore, there are only two Σ27 operators: one containing the string 111 (= Σ27a) and another one containing to the string 112 (= Σ27b). From this step (n = 3), each variant of generation n will generate three new variants of generation n + 1, with the exception of the one that keeps the (011) plane of α^{0} as a mirror plane. Consequently, for the orders n > 3, all the operators can be recursively generated with the help of five distinct types of operations ().
(a) If keeps having a mirror symmetry through the initial mirror plane (011), the operation () is of type T_{1}^{n} = 111…1 (n terms). Three new variants and two new operators can be created from : the first operator contains the string 111…11 (n + 1 terms) = T_{1}^{n}T_{1}, and the second one contains the string 111…12 (n + 1 terms) = T_{1}^{n}T_{2}. Both are illustrated in Fig. 6 (in the case of n = 4).
(b) If is not symmetric through the initial mirror plane (011), the operation is of type M = 11…2…i (n terms). Three new variants and three new operators can be created from : they contain the strings 11…2…ij (n + 1 terms) = MT_{j}, j ∈ {1,2,3}. If j = i, the connection is a `forward' connection; if j ≠ i, the first index h before i with h ≠ i must be determined and if j = h the connection is a `circular' one, and if j ≠ h the connection is a `zigzag' one.
These symmetry considerations allow the creation of the minimum number of variants required to compute the construction of the fractal, all the other variants are deduced by the symmetries of the primary crystal α^{0} (i.e. the G). At the nth generation, the number of distinct operators is easily deduced from this geometrical approach. Indeed, it respects the arithmetic geometric sequence N_{n + 1}^{op} = 3N_{n}^{op}  1 with N_{2}^{op} = 1. In consequence,
By construction, Σ3^{ξ}, the set of strings based on the four indices (0,1,2,3) is a semigroup.^{10} Σ3^{ξ} is not a group because the indices 1, 2 and 3 have no inverse. Of course, Σ3^{ξ} is not isomorphic to Σ3^{ω}.
5.2. Names of the operators
Once the matrices M representing the operators Σ3^{n} are determined (with their string code), the operators can be named according to the following method: (a) calculate for each matrix M the set GMG of polarly cubically equivalent matrices (see footnote 3), (b) choose in this set the rotation with the minimum angle as representative and (c) order the operators according to these minimum angles. For example, the rotations with minimum angles of 31.58 and 35.43° are associated with the operators Σ27a and Σ27b, respectively. This way of ordering is equivalent to comparing the norms of the quaternions. However, as already noticed by Reed et al. (2004), many distinct operators can have the same representative minimum angle. A solution was proposed by these authors for quaternions, however, here, since only the matrix expressions are used, we have decided to choose another ordering rule. For each rotation matrix representative of the operator (i.e. with the minimum angle), we also consider the orientation of its rotation axis, a second ordering is then realized (if necessary) by calculating the minimum scalar product between this axis and the 〈111〉 axes. Since this ordering sometimes is not enough because two distinct operators can have the same minimum rotation angle and the same angle between the rotation axis and the 〈111〉 axes, a third ordering rule is sometimes required by calculating the minimum scalar product between the rotation axis and the 〈100〉 axes. Once the operators have been ordered, they are identified with letters. Since the alphabet is not large enough for orders n > 6, it has been extended according to the rule: a,…, z, aa, ab,…, az, ba, bb,…, bz,… etc. The naming and ordering of the operators takes most of the computing time (one minute for order n = 8) because it implies matrix calculations. The ordered operators are reported in Table 2 for order n ≤ 6 (the list for higher order is available on demand). It may be noted that the lists given in some previous studies (Gottstein, 1984; Andreeva & Firsova, 1996) are not quite complete. We also would like to stress that it is possible to distinguish the complementary polar operators (see footnote 3). For example, the two Σ81a operators with a minimum angle of 38.376° and rotation axes of type 〈135〉 were distinguished; we called them Σ3^{4}+a and Σ3^{4}−a. Indeed, if we denote T_{+a}^{4} = 1112 the matrix associated with Σ3^{4}+a and T_{a}^{4} = 1122 the matrix associated with Σ3^{4}−a (given in Table 2), the reader may check (by computing) that the associated set of polarly cubically equivalent matrices forming the Σ3^{4}+a and Σ3^{4}−a operators, i.e. and , with G the m3m do not intersect: but , . The operator Σ3^{4}+a and Σ3^{4}−a are complementary polar operators.
5.3. Twodimensional graph and polefigure representations
The different operators corresponding to the Σ3^{ξ} semigroup can be represented on a graph similar to the one introduced by Reed et al. (2004) (the only slight difference is the distinction we have made in the labelling between the polar and ambivalent operators). This graph can be redrawn to obtain a twodimensional fractal graph based on Templarstyle crosses, as shown in Fig. 7 (limited here to n ≤ 5 for space reasons). In this figure, the operators are the centres of the crosses and the variants are the tips. This graph is called a Cayley graph (used by mathematicians to encode the free group based on two generators). One may observe that the types of connections between the operations such as the circular or zigzag connections also appear in this twodimensional fractal scheme.
The twinned variants can also be represented by drawing their orientations on a pole figure in one of the reference bases of the primary crystal, as illustrated for n ≤ 5 in Fig. 8 (for higher orders there are too many points and only the densities could be represented). Such figures were already presented by Gottstein (1984) but were incomplete because of some missing operators. As already calculated by Wilbrandt (1980), it is very difficult to distinguish a random misorientation from a Σ3^{n} operator for orders n higher than 5. Some special patterns can also be noticed in these pole figures (such as the circles). These come from operators that have very close minimum rotation angles (such as the Σ81+a, Σ81−a and Σ81b operators). As the order n increases, the number of operators with close or even exact minimum rotation angles increases and the number of singular patterns increases (as confirmed by simulations of pole figures of operators with equal rotation angles and random rotation axes, not presented here).
orders5.4. Comparison of the Σ3^{ξ} semigroup with the Σ3^{ω} group
The Σ3^{ξ} semigroup (based on the indices 0, 1, 2, 3) and the Σ3^{ω} free group (based on the letters a, b, c, d) are represented by the same graph although these two structures are not isomorphic.
In the Σ3^{ω} group, all of the letters play the same role in the strings, and they can be interchanged. Moreover, the simplification rule aa = bb = cc = dd = ø with ø the empty string (coding the identity matrix) is based on the choice of 180° rotation matrices in the four sets g_{i}HT that define the orientations of the variants with i ∈ [0,3]. This rule makes the string representation unique and consequently makes Σ3^{ω} free.
In the Σ3^{ξ} semigroup, only the indices 1, 2 and 3 are equivalent. The index 0 appears only one time in the whole Σ3^{ξ} graph (it begins the strings that codes the branch 0). In fact, the index 0 (and the associated matrix T_{0}) is `special' and cannot be treated as the three other indices. Since 0 represents a mirror symmetry, it obeys the simplification rule 00 = ø. Consequently, 000… (n times) is equal to 0 if n is odd, and to ø if n is even, whereas the strings 111…, 222… or 333… (n times) cannot be reduced. The asymmetry between the index 0 and the three others has a temporal meaning if is considered as a temporal process. Let us imagine a progressive by annealing and recrystallization from a variant of order n, the indices 1, 2 and 3 produce three new crystals of order n + 1, whereas the index 0 corresponds to a crystal of generation n − 1 that was already produced in the past. The composition with the index 0 means that there is a unique way to go back to the past, and the composition with the indices 1, 2, 3 means that there are three equivalent (locally symmetric) ways to go to the future. There is no simplification rule between the indices (1, 2, 3). The simplification is realized only between the index 0 and the three indices (1, 2, 3). What is the rule? For example, how could we simplify the string that corresponds to 112.012 = 112012? More generally, how could we simplify the string h…i.0j…k = h…i0j…k? The specific matrices T_{i} for i ∈ [1,3] that we have chosen in the sets g_{i}HT to harmoniously enumerate the faces of the tetrahedra on the twodimensional developed fractal (see §4.4) give the following rule:
This property comes from the fact that 101 = 0, 102 = 3, 103 = 2, which can be checked by calculating the matrix products (8) with the matrices given in Table 1 (the other combinations are true due to the equivalence of the 1, 2, 3 indices).
6. Composition of the Σ3^{n} operators
The idea of CSL was initially introduced to characterize the grain boundaries between two crystals. When metallurgists became interested in triple junctions, a method to compose the CSL rotations and to determine the CSL of an assembly of grains was developed. Most of the studies were restricted to finding a rule for the composition of the Σ numbers that appear in expression (1), and few studies treated the composition of the operators.
6.1. Composition of the Σ numbers^{11}
It was believed for a long time that the Σ numbers in the CSL matrix expressions (1) are numbers that can be multiplied without precaution. It was believed for example that the three Σ numbers which determine the respective misorientations between three crystals (indexed by 1, 2, 3) follow the rule Σ_{13} = Σ_{12}Σ_{23}, where Σ_{ij} is the Σ value of the misorientation matrix between the crystal i and the crystal j. This rule was puzzling because it does not respect the symmetry of the problem, i.e. the three crystals do not play similar roles. Actually, it was proved to be wrong. The correct Σ composition rule was proposed by Miyazawa et al. (1996), with a demonstration given by Gertsman (2001a). It is derived from the following relationship:
where β_{123} is the greatest common odd divisor of the quaternion produced by the multiplication of the two quaternions describing the two generating CSL misorientations.^{12} This property is general; therefore, we also have
By multiplying equations (11) and (12), and simplifying the result by using the equality Σ_{23} = Σ_{32} (because the inverse of the matrix in equation (1) is its transpose), it follows that Σ_{23} = Σ_{32} = β_{123} β_{132}. Similarly, by using equations (12) and (13), it follows that Σ_{13} = Σ_{31} = β_{132} β_{213} and, by using equations (11) and (13), it follows that Σ_{21} = Σ_{12} = β_{123}β_{213}. By writing β_{213} = p_{1}, β_{123} = p_{2} and β_{132} = p_{3}, i.e. β_{ijk} = p_{j}, the three equalities can be summarized by using a simple rule:
This formula has been shown by Miyazawa et al. (1996) and Gertsman (2001a), but we have preferred to show a complete demonstration.^{12} This rule is illustrated for three crystals in Fig. 9. This approach can also be generalized to four crystals.^{13} The rule (14) indicates that two Σ numbers ΣX and ΣY can be composed if and only if they have a common integer p_{j} in their decomposition, i.e. ΣX = p_{i}p_{j} and ΣY = p_{j}p_{k} and that the result of this composition is ΣZ = p_{i}p_{k}. By denoting ΣX = Σ_{(pi}_{,pj}_{)}, ΣY = Σ_{(pj}_{,pk}_{)} and ΣZ = Σ_{(pi}_{,pk}_{)}, one can write the composition rule in the form
which is a p_{i}p_{j} and p_{j}p_{k} is not uniquely reduced to the case p_{j} = 1, the composition of two Σ numbers is a multivalued function.
composition law (it has the same form as for the hydrogen frequencies, see footnote 6). Since in general the decomposition of two Σ numbers into two products of two integersThis rule can be applied to the Σ3^{n} values. It shows that any Σ3^{m} number can be composed with another Σ3^{n} number with m ≥ n, by writing Σ3^{m} = 3^{m−i}3^{i}, Σ3^{n} = 3^{i}3^{n−i}, and the result is 3^{m+n−2i} for any i ∈ [0,n]. This rule was already obtained in Reed et al. (2004, equation 14) with a demonstration based on string representations. It may be noted that this rule concerns the Σ numbers, which are only one aspect of the Σ operators. Let us now consider the composition of the Σ3^{n} operators.
6.2. Composition of the Σ operators
As introduced in §3, the operators can be viewed as types of paths in a graph or as types of arrows in a Both representations are suitable to calculate their composition (see also Appendix A).
(i) The operators Σ3^{n} can be represented by types of arrows in the Γ^{∞}. They define a specific misorientation between the primary crystal α^{0} and a set of variants of nth generation, , equivalently oriented with reference to α^{0}. As introduced in §4.1, a Σ3^{m}x operator can be composed with a Σ3^{n}y operator by writing Σ3^{m}x = and Σ3^{n}y = and the result is the set of operators that link the variant α^{0} to the variants : Σ3^{m}xΣ3^{n}y = = = {Σ3^{q}z}. This composition is multivalued. By determining the variants associated with each operator, the composition can be easily determined without any matrix calculation. This method has already been applied to calculate the composition of the operators that link the orientational variants generated by a structural (Cayron, 2006).
(ii) The operators Σ3^{n} can be represented by types of paths in the graph of Fig. 7. The method used to calculate their composition is the same whatever the substructure of Γ^{∞} chosen for the coding (Σ3^{ω} or Σ3^{ξ}). It is based on the fact that each string in Σ3^{ω} (or Σ3^{ξ}) is equivalent to other strings of Σ3^{ω} (or Σ3^{ξ}) due to the global symmetry. The operators are elements of the quotient structure Σ3^{ω} (or Σ3^{ξ}), where (or ) is the equivalence relation on the strings. The composition of two operators Σ3^{m}x and Σ3^{n}y, both written as sets of equivalent strings, is then easily obtained: (a) by choosing one string in each of the two lists, and concatenating the two strings (respecting the simplification rule of the structure), (b) by identifying the resulting string with an operator (which supposes that all the operators have been previously encoded up to the order m + n), and (c) by repeating the process for all the strings of the two operators. In other words, if Σ3^{m}x = {s_{1},…, s_{i},…} and Σ3^{m}y = {t_{1},…, t_{j},…}, we chose Σ3^{m}x ∋ s_{i} and Σ3^{n}y ∋ t_{j}, then s_{i}t_{j} ∈ Σ3^{q}z, and by repeating the process Σ3^{m}xΣ3^{n}y = {Σ3^{q}z}. The composition is multivalued. This method is very effective due to the highly symmetric character of the graph. We can give some examples with the two encoding structures: the Σ3^{ω} group and the Σ3^{ξ} semigroup.
6.3. Calculation with the free group Σ3^{ω}
The equivalence of the four fractal branches imposes that the letters a, b, c, d used in the free group Σ3^{ω} are equivalent. These letters can be permuted in the strings. For example, the string aca is equivalent to the string dbd by the permutation (a,b,c,d) → (d,c,b,a). Both strings belong to the same operator. Each operator is encoded by a set of equivalent strings. For example, the operator Σ3 = {a,b,c,d} and the operator Σ27a = {aba, aca, ada, bab, bcb, bdb, cac, cbc, cdc, dad, dbd, dcd}. The composition of the operators is obtained by concatenation and by applying the simplification rule ii = ø for i ∈ {a,b,c,d}. It gives Σ27aΣ3 = {ab, ac, ad, abab, acab, adab, abac, acac, adac, abad, acad, adad, …} = {Σ9, Σ81+a, Σ81d}.
6.4. Calculation with the semigroup Σ3^{ξ}
The threefold symmetry of each fractal branch imposes that the indices 1, 2, 3 in the semigroup Σ3^{ξ} are equivalent and can therefore be permuted in the strings. Moreover, owing to the equivalence of the four branches of the fractal, each string of kind ijk…l is equivalent to a string of kind 0jk…l. Here again, an operator is a set of equivalent strings. For example, the operator Σ3 = {0, 1, 2, 3} and the operator Σ27a = {111, 222, 333, 211, 311, 122, 322, 133, 233, 011, 022, 033}. The composition of the operators is obtained by concatenation and by applying the simplification rule (10). It gives Σ27a Σ3 = {11, 1111, 1112,…} = {Σ9, Σ81+a, Σ81d}. One may observe that the result is the same as that obtained with the Σ3^{ω} group.
The Σ3^{m}xΣ3^{n}y composition table for m ≤ 4 and n ≤ 4 can be determined using the Σ3^{ξ} coding in a few seconds using a modern desktop computer, and is reported in Table 3 (the tables for higher orders are available on demand). The composition is multivalued due to the structure of Γ^{∞}. The table is asymmetric because of the noncommutativity of the operators. It can be forced to be symmetric by ignoring the signs of the polar operators, but this would lead to lost information. We will now explain the practical importance of such a table in metallurgy.

7. Application for the identification of Σ3^{n} grain boundaries
Many defects in metals and alloys are formed in grain boundaries. The study of their local crystallographic environment can bring new understanding of their formation. Are the defects in twinned materials situated in random grain boundaries or in the special Σ3^{n} grain boundaries? The response is not always obvious because it is difficult to distinguish a random misorientation from a Σ3^{n} operator with high order n. Indeed, the Σ3^{n} operators are numerous and nearly homogeneously distributed in space for order n ≥ 5 (see Fig. 8). The identification of the Σ3^{n} grain boundaries is also a key point used to reconstruct the twinrelated domains. As introduced in §1, the TRD size is an important microstructural parameter and many engineers try to improve the mechanical properties by optimizing the elaboration processes in order to produce structures with large TRDs. The determination of the TRDs by EBSD could be a useful aid for these engineering developments. Very often, the TRDs can be easily identified by following the connected paths (i.e. chains) of Σ3 boundaries between the grains. However, such a method is not always possible. Indeed, in some architectured materials with low dimensionality, the Σ3 chains that link the grains of the TRDs are not at the sample surface but situated under the surface and their locations make their direct identification impossible with the EBSD technique (which is a surface technique). We give some engineering examples to show how the composition Table 3 helps to solve these metallurgical problems. The EBSD maps have been acquired on a LEO1530 SEM equipped with a Nordlys II CCD camera and have been analysed using the Channel5 software (HKL Technology).
7.1. Local environment of a void on a copper line
In microelectronic devices, the reduction of the width of the copper interconnection lines and the use of new barrier and capping layers have led to some new reliability problems. The stress concentrations during the elaboration processes sometimes lead to the formation of voids that can grow and completely damage the lines, this type of defect is called stressinduced voiding (SIV) (Børgesen et al., 1992; Shao et al., 2006). Some relations exist between the global texture and the SIV (Nucci, 1997; Sekiguchi et al., 2003), but the coupling mechanisms between the stresses, the atom migration and the local crystallographic environment remain poorly understood. Local EBSD analyses could help in the understanding of these mechanisms.
In Fig. 10, a stressinduced void has been localized in a copper line. It is situated inside a TRD (here clearly identifiable by the Σ3 chains between the grains) in a boundary between four grains (denoted 1, 2, 3 and 4). This TRD has been reconstructed by ignoring the Σ3 grain boundaries, i.e. the same colour has been attributed to the grains separated by a Σ3 grain boundary. The misorientations between these grains are R_{21} = (28.4°, [2]), R_{23} = (59.8°, [1]), R_{34} = (35.9°, [20]), R_{41} = (38.4°, [0]), R_{13} = (48.9°, [4]) and R_{24} = (38.7°, [41]). Three of them are easy to index: R_{23} = Σ3, R_{34} = Σ27b and R_{41} = Σ9, but the three others correspond to higher orders and are more difficult to identify. We determine the maximum possible order by counting the number of Σ3 in the shorter Σ3 chain that links two grains. Then, we identify some possible solutions by looking at Table 2 (rotation angles and axes). Three solutions are possible for R_{24} = (Σ81+a, Σ81−a or Σ81b), two for R_{13} = (Σ3^{5}+h or Σ3^{5}−h), and four for R_{12} = (Σ3^{6}+f, Σ3^{6}−f, Σ3^{6}+g or Σ3^{6}−g). Moreover, R_{21} = R_{24}R_{41} = (Σ81+aΣ9, Σ81−aΣ9 or Σ81bΣ9), and if one looks at the results of these compositions in Table 3 and compares them with the possible solutions already identified from the EBSD map (Σ3^{6}+f, Σ3^{6}−f, Σ3^{6}+g or Σ3^{6}−g), one may check that the only solution is R_{24} = Σ81+a and R_{21} = Σ3^{6}+g. This result could also have been obtained by considering R_{21} = R_{23}R_{31} = (Σ3Σ3^{5}+h or Σ3Σ3^{5}−h) = ({Σ3^{6}+l, Σ3^{6}+b, Σ3^{6}e, Σ3^{4}c} or {Σ3^{6}+g, Σ3^{6}c, Σ3^{6}−x, Σ3^{4}b}) (not presented in Table 3 for space reasons), which leads to the same unique solution R_{21} = Σ3^{6}+g. This example is very interesting because it proves that it is sometimes possible to unambiguously identify the Σ3^{n} grain boundaries for orders n ≥ 6 and that the distinction between direct and inverse polar operators is important for the identification method.
7.2. Local environment of a hillock on a copper film
Hillocks are defects that may appear in the interconnection lines of electronic devices during the elaboration process or by et al. (2002) believe that these are likely to be new nucleated grains, whereas Gladkikh et al. (1995) believe that they result from the growth of a neighbouring grain. Let us now consider the hillock on a copper film shown in the EBSD map in Fig. 11. The TRDs were reconstructed by neglecting only the Σ3 and Σ9 special boundaries. At first glance, the hillock appears as a new nucleated TRD. Indeed, there is no Σ3 chain between it and any grain of the three TRDs. However, if we consider the Σ3^{n} operators at higher orders, the hillock seems to be linked to the left TRD by two misorientations close to Σ81 forming a triple junction R_{12} = Σ81+a, R_{23} = Σ9 and R_{13} = Σ81d. Are these misorientations close to the Σ3^{n} operators `by accident' and in fact `random'? A way to be more confident is to check the coherency of the triple junction, i.e. to check that their composition is in agreement with the theoretical composition Table 3. The verification is done because R_{12}R_{23} = Σ81+aΣ9 = {Σ3^{2}, Σ3^{4}+a, Σ3^{4}d, Σ3^{6}+a, Σ3^{6}+g, Σ3^{6}−i, Σ3^{6}+l, Σ3^{6}n, Σ3^{6}p, Σ3^{6}+s, Σ3^{6}+t, Σ3^{6}+u} ∋ Σ81d = R_{13}. This verification reinforces the probability that the hillock is in fact a multiply twinned branch of the left TRD, and its formation should imply a growth mechanism (with twinning) without nucleation. A deeper statistical study is required to quantify these probabilities as a function of the tolerance angles. The calculations could be based on the generation of triplets of randomly oriented crystals following a method introduced in Cayron et al. (2006).
damage. Wei7.3. Application to the reconstruction of TRDs in narrow copper lines
The Σ3 twins have in general an electrical resistivity one decade lower than that of the conventional highangle grain boundaries [and the least resistive Σ3 boundaries are those with {111} boundary planes, see Sutton & Balluffi (1995)]. Therefore, some engineering teams increase the size of the TRDs in the interconnection Cu lines to reduce their resistivity.^{14} In parallel, some EBSD characterization studies try to reconstruct the TRDs in order to correlate their mean size to the electric measurements. However, this reconstruction is usually performed by neglecting only the Σ3 boundaries (Mirpuri & Szpunar, 2004), which gives undervalued results for narrow lines. Indeed, when the lines are narrow (<1 µm), they often have a `bamboolike' structure (the grains have the same width as the lines), as shown in Fig. 12. Then, although there is always a Σ3 chain between two grains of a TRD, this chain is not always situated at the surface of the sample and becomes invisible in the EBSD maps. When this situation occurs, these grains seem to be separated by a Σ3^{n} boundary with n ≥ 2 in EBSD, but one must remember that they are in fact connected by a Σ3 chain of grains located under the surface which acts as a low resistivity path between these two grains. Therefore, all the `reasonable' orders n of the Σ3^{n} boundaries should be considered to reconstruct satisfactorily the TRDs. And considering the Σ9 in addition to the Σ3 boundaries is far from enough. On the copper lines represented in Fig. 12, some TRDs have been reconstructed by neglecting only the Σ3 and Σ9 boundaries. We have identified many grain boundaries separating these partial TRDs that are of type Σ3^{n} with n ≥ 3 and that verify Table 3. One frontier is presented in the square on the bottom left of the figure. It is constituted of Σ3^{n} boundaries: R_{23} = Σ3, R_{31} = Σ81b and R_{21} = Σ3^{5}g. Such a junction is coherent with Table 3 because it respects R_{23}R_{31} = Σ3Σ81b = {Σ3^{3}b, Σ3^{5}+e, Σ3^{5}g, Σ3^{5}−h} ∋ Σ3^{5}g = R_{21}. Therefore, the two TRDs in the square of Fig. 12 are in fact only one TRD. In a first analysis, for narrow copper lines with a `bamboolike' structure, we estimate that the TRD mean size calculated by neglecting only the Σ3 boundaries (and not the Σ3^{n} ones with n ≥ 2) is at least 50% undervalued.
Once a TRD is reconstructed, it may be checked that its corresponding pole figure is in agreement with the simulations of Fig. 8. In some cases, some missing dots can bring useful information about a variant selection mechanism during the recrystallization. For instance, the experimental pole figure of a TRD reconstructed in a copper film and oriented in the [111] direction of the primary crystal is reported in Fig. 13(a); its comparison to the theoretical pole Fig. 13(b) proves that the order of this TRD is n = 2 and that one main branch of the fractal is missing [the fractal is constituted of only three branches, such as the ones visible in Fig. 3(a)]. More thorough analysis would be required to know if the fourth branch is missing or if it is situated below the surface.
8. Conclusions
The idea of a
has been introduced. Three types of elements have been described: the objects, the operations (also called arrows) between these objects and the operators that are types of operations (they are written as sets of equivalent operations).An assembly constituted of one crystal with its four twinned variants can be represented by a Γ^{(0+1)}. More generally, an assembly of multiply twinned crystals linked by Σ3^{n} operators with n ∈ can be represented geometrically by a threedimensional fractal and algebraically by the Γ^{∞} = Γ^{(0+1+…+n)} with n → ∞. The algebraic details of Γ^{∞} were not studied but symmetry considerations on the threedimensional fractal have allowed us to determine some of its properties. For example, the general formulae giving the number of variants and the number of operators as functions of the order n were established. The Σ3^{ω} free group introduced by Reed et al. (2004) is a substructure of Γ^{∞}. Other substructures can be used. For example, we have introduced the Σ3^{ξ} semigroup that leads to a different coding (with a different simplification rule), but to a twodimensional fractal graph similar to the one that could be obtained with the Σ3^{ω} free group. Whatever the substructure we use for the coding (Σ3^{ω} or Σ3^{ξ}), the Σ3^{n} operators can be written as sets of equivalent strings. The composition of two operators can then be easily determined without any matrix calculation by concatenating all the couples of strings chosen in their respective set and by applying the simplification rule of the substructure. The composition of operators is multivalued. This property can be understood by taking into consideration that the general structure of multiple is a and not simply a group. The composition table has been reported for orders n ≤ 4 (and was determined at higher orders).
Some metallurgical examples were given showing how this table could be used in EBSD for a better identification of the local crystallographic environment of some defects in multiply twinned materials or for improving the reconstruction of the TRDs. We have stressed that the distinction between polar and ambivalent Σ3^{n} operators is important in the identification method. The approach we have followed is general and can be used to compute an automatic recognition of the Σ3^{n} grain boundaries and an automatic reconstruction of the TRDs.
The present study can be applied to treat multiple ). This research will require the help of mathematicians. To conclude, we would like to encourage crystallographers interested in phase transitions, quasicrystals or other problems involving partial symmetries to consider groupoids as a very useful algebraic tool that advantageously enlarges the idea of groups.
in noncubic materials because it is not based on quaternions. However, the general theory treating any series of cycles of phase transitions remains to be established. The answer is probably to be found in algebraic structures more elaborated than groupoids such as the cohomology of groupoids (Connes, 1990APPENDIX A
In this Appendix, we present a simple noncrystallographic geometrical case, with local and global symmetries, in order to clarify the idea of `operator' and its link with the groupoids. Let us imagine a ball moving on a flat surface in a structure constituted by isosceles triangles that have vertical mirror symmetry (Fig. 14). How can we encode the different movements of the ball on such a structure?
A1. Operators viewed as types of paths in a graph
One may notice that the ball has five possibilities at each vertex: left or right while going to the bottom (L or R), left or right while going to the top (L^{−1}, R^{−1}), or coming to rest (denoted ∅). This classification of possibilities is due to the local symmetries of the structure. Of course, it can be created a free group G^{∞} constituted by the letters L, R, L^{−1} and R^{−1} and all the infinite combinations of these letters.^{15} The corresponding infinite graph would be similar to Fig. 14(a), imagined to be repeated an infinity of times. Any trajectory of the ball is represented by a string of the free group G^{∞}. But there are two problems with such a representation: (a) such a group is infinite whereas Fig. 14(a) is finite, and (b) in such a graph the local and global symmetries are not represented. Indeed, one may assume that different trajectories are of the same type due to the local symmetries of the structure. From Fig. 14(a), we can effectively notice that two strings are equivalent by
The rule (16) is the algebraic expression of the global vertical mirror symmetry. Conditions (17) and (18) are the algebraic expressions of the local vertical mirror symmetries.^{16} These rules allow the creation of an equivalence relation on the different trajectories of the ball. The distinct types of trajectories are given by the elements of the quotient set G^{∞}/. There is no reason for G^{∞}/ to be a group, and in fact this structure appears to be quite complex. We propose in the following a method to define its elements and their compositions.
Owing to the local vertical mirror symmetry, the actions L and R are equivalent; there is no way to predict that the ball will move to the left or to the right. One may then accept that the action `moving down' on the structure of Fig. 14 is not a classical application, but a bivalued function that we will denote O_{1}^{1}(x) = {L,R}, for any position x of the ball on the structure. Similarly, the action `moving up' is denoted O_{1}^{1}^{1} = {L^{−1},R^{−1}}. The operator `coming to rest' is O_{0}^{1} = ∅. These three operators will be called operators of first generation. For the second generation, the operators are O_{0}^{2} = O_{0}^{1} = {LL^{−1}, RR^{−1}, R^{−1}R, L^{−1}L} = ∅, O_{1}^{2} = {LL, RR}, O_{2}^{2} = {LR, RL}, O_{3}^{2} = O_{3}^{2}^{1} = {L^{−1}R, R^{−1}L, LR^{−1}, RL^{−1}}, O_{1}^{2}^{1} = {L^{−1}L^{−1}, R^{−1}R^{−1}} and O_{2}^{2}^{1} = { L^{−1}R^{−1}, R^{−1}L^{−1}}. For the third generation, the new operators are O_{1}^{3} = {LLL, RRR}, O_{2}^{3} = {LRR, RLR, LRL, RLL, RRL, LLR}, O_{3}^{3} = {LR^{−1}L, RL^{−1}R, R^{−1}LL, LLR^{−1}, L^{−1}RR, RRL^{−1}} and their inverses (which are all distinct). These operators are represented in Fig. 14(b). More generally, one can form the operators of order n, O_{j}^{n}, by forming all the strings with n letters in the set {L, R, L^{−1}, R^{−1}} and finding the strings that are equivalent by the conditions (16), (17) and (18). The operators are the elements of G^{∞}/. Two operators O_{i}^{m} and O_{j}^{n} can also be composed: (i) by choosing on the left a string of O_{i}^{m} and on the right a string of O_{j}^{n} and concatenating them; (ii) by identifying the resulting string to an operator of order ≤m+n; and (iii) by repeating this process for all the couples of strings in (O_{i}^{m}, O_{j}^{n}). For example, O_{1}^{1}O_{1}^{1} = {LL, RR, RL, LR} = {O_{1}^{2},O_{2}^{2}}, O_{1}^{1}^{1}O_{1}^{1} = {∅, L^{−1}R, R^{−1}L} = {O_{0}^{2},O_{3}^{2}}, O_{1}^{1}^{1}O_{1}^{2} = {L, L^{−1}RR, R^{−1}LL, R} = {O_{1}^{1},O_{3}^{3}}. From these examples, the composition of operators (i.e. types of trajectories, i.e. elements of G^{∞}/) appears to be multivalued. Some readers may be shocked by the use of a multivalued composition; a way to accept it is to realize that such a composition naturally results from an underlying structure.
A2. Operators viewed as types of arrows in a groupoid
In the previous paragraph, we have voluntarily ignored the positions x on which the operations were applied (denoted as 0 to 9 in Fig. 14a). A pair of positions, denoted (x▹y), can be viewed as an arrow from x to y. The arrows form a pair The composition law is (x▹y)(y▹z) = (x▹z) and each arrow has an inverse given by (x▹y)^{−1} = (y▹x). The operators appear as types of arrows. For example, O_{1}^{1} = {(0▹1), (0▹2), (1▹3), (1▹4), (2▹4), (2▹5), (3▹6), (3▹7), (4▹7), (4▹8), (5▹8), (5▹9)}. The operator O_{1}^{1}^{1} is constituted by the inverse arrows, and O_{0}^{1} by the arrows of type (i▹i) for i ∈ [0,9]. It can also be noticed that O_{1}^{2} = {(0▹3), (0▹5), (1▹8), (2▹7), (1▹6), (2▹9)} and O_{2}^{2} = {(0▹4), (1▹7), (2▹8)}. Here, the different arrows constituting the operators are geometrically obvious. Generally, they can be found by expressing the local symmetries. In the present example, one could use the vertical mirror symmetry that is the permutation (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) → (0, 2, 1, 5, 4, 3, 9, 8, 7, 6) and the translations that put in correspondence some points of the structure, for example the translation (0▹1) expressed by the application (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) → (1, 3, 4, 6, 7, 8, ø, ø, ø, ø), where ø means `no image'. Two operators O_{i}^{m} and O_{j}^{n} can be composed: (i) by choosing on the left one arrow of type (x▹y) in O_{i}^{m} and on the right one arrow of type (y▹z) in O_{j}^{n}; (ii) by identifying the resulting arrow (x▹z) with an operator; and (iii) by repeating this process for all the couples of strings in (O_{i}^{m},O_{j}^{n}). For example, O_{1}^{1}O_{1}^{1} = {(0▹1)(1▹3) = (0▹3), (0▹1)(1▹4) = (0▹4) etc.} = {O_{1}^{2},O_{2}^{2}}. One can also calculate the composition O_{i}^{m1}O_{j}^{n} by choosing a reference position (for example y = 0). Then we determine all the arrows of type (x▹z) by choosing one arrow of type (0▹x)^{−1} = (x▹0) in O_{i}^{m1} on the left and one arrow of type (0▹z) in O_{j}^{n} on the right. This method has the advantage of representing the objects, the operators and their composition in the same table. The geometrical structure of Fig. 14 can then be algebraically written in a unique composition table (Fig. 15), which can be viewed as a generalization of the composition table of groups.
In this example, we have seen that, due to the local symmetries, there exist some types of paths or arrows that we have called operators. These operators can be written as sets of equivalent strings in a graph or as sets of equivalent arrows in a were suppressed or if they were changed by equilateral triangles.
They can be composed by string concatenation (in a graph) or by respecting the composition law between the arrows (in a groupoid). Whatever we choose as the method, this composition is multivalued. Composition tables can be calculated. Graphs and strings are very effective for high symmetric problems; groupoids and arrows are less effective but more general and can be applied to less symmetric problems. For example, it would be the same formalism if some isosceles triangles in Fig. 14Footnotes
^{1}The reader may refer to Schwartz et al. (2000) for an overview of the EBSD technique.
^{2}Multiple can be imagined as repeated transformations (see §4).
^{3}The notion of `cubical equivalence' was introduced by Grimmer (1974) who studied the matrix and quaternion expressions of the misorientation between two cubic crystals. However, as already pointed out by Reed et al. (2004), it is in general possible to distinguish the misorientation from crystal 1 to crystal 2 and the misorientation from crystal 2 to crystal 1. The two subtypes are then complementary polar subtypes (see §2.2). Thus, the subtypes contain more information than the types and, in this paper, we will use the notion of subtype. We will say that two matrices T_{x} and T_{y} are `polarly cubically equivalent' if and only if they belong to the same subtype, i.e. they form the same set of matrices GT_{x}G = GT_{y}G, with G the of the cubic crystals (sometimes denoted Σ1).
^{4}If S is a set, the expressions with and are called the strings (or words) of S. A string is said to be reduced if it does not contain two adjacent terms of the form s_{i}^{1}s_{i}^{1} or s_{i}^{1}s_{i}^{1}. A free group F is a group generated by a set S in which the distinct elements are represented by distinct reduced strings in S.
^{5}One can understand the simple cosets as types of dangling bonds and double cosets as types of bonds between pairs of atoms.
^{6}Connes (1990) makes a clear parallel between the matrix mechanics of Heisenberg in quantum physics and the composition law of the spectral frequencies of hydrogen given by = , where is the frequency of the spectral line between the energy levels E_{i} and E_{j}.
^{7}In this paper, we will use equivalently the terms `operation' and `arrow'.
^{8}For example, a pair of points (P_{i}, P_{j}) is an arrow. In the Euclidean space, there is infinity of points (P_{i}, P_{j}) similarly placed in their pairs; these pairs form an equivalence class called vector, V = {(P_{i}, P_{j})}. A vector is an operator and one can imagine its action on the points by P_{i}V = P_{j}.
^{9}The orientations of four crystals of first generation are given in reference to the orientation of the primary crystal α^{0}: the orientation of is given by HT, the orientation of by g_{1}HT, by g_{2}HT and by g_{3}HT. Each becomes the parent crystal of the variants of second generation . The orientations of these variants in reference to the primary crystal α^{0} are given by the set of matrices g_{i}HTg_{j}HT. More generally, the orientations of the twinned crystals at any order n are given by the sets of type g_{i}HTg_{j}HTg_{k}HT… (n times) with (i, j, k, …) ∈ [0,3]^{n}.
^{10}A semigroup is an algebraic structure consisting of a set closed under the associative A group is a semigroup in which there is a neutral element and all the elements have an inverse.
^{11}This is a general theoretical approach; the application to the particular case of Σ3^{n} CSL numbers is given at the end of the section.
^{12}β_{123} was denoted simply β by Gertsman (2001a), but this notation is not accurate because it is assumed that this number is the same for all the Σ combinations, whereas in general β_{123} ≠ β_{132} ≠ β_{213}.
^{13}For four crystals, one can write Σ_{ij} = Σ_{ji} = p_{i}p_{j} for (i,j) ∈ {1,2,3}^{2}, Σ_{ij} = Σ_{ji} = q_{i}q_{j} for (i,j) ∈ {1,2,4}^{2}, Σ_{ij} = Σ_{ji} = r_{i}r_{j} for (i,j) ∈ {1,3,4}^{2} and Σ_{ij} = Σ_{ji} = s_{i}s_{j} for (i,j) ∈ {2,3,4}^{2}, which could be illustrated on a tetrahedron with schemes similar to that of Fig. 9 for its four faces.
^{14}For example, it is possible to elaborate nanotwinned copper foils with ultrahigh strength and low electrical resistivity (Lu et al., 2004).
^{15}If Fig. 14 is imagined as a ball falling on the structure, the gravity field imposes a temporal arrow on the process, then the reverse actions are not allowed (the ball is always moving down) and we should use a free semigroup structure.
^{16}If L^{−1} and R^{−1} are imagined as the reverse actions of L and R obtained by a time inversion, condition (18) becomes more subtle: the left and the right directions are exchanged when the time is reversed.
Acknowledgements
We acknowledge P. DumontGirard (ST Microelectronics) for providing the Cu films, and L. Arnaud and J. F. Guillaumond (CEALETI) for the samples with the Cu lines. The fractals have been computed in Python language and represented in three dimensions thanks to the engine Soya. Both are freeware available on the Internet. We also acknowledge S. Zapata and D. Cooper (CEALETI) for helping with the English language. This study was partially supported by the French government programmes Stressnet and Cristal.
References
Andreeva, A. V. & Firsova, A. A. (1996). Mater. Sci. Forum, 207–209, 189–192. CrossRef CAS Google Scholar
Børgesen, P., Lee, J. K., Gleixner, R. & Li, C. Y. (1992). Appl. Phys. Lett. 60, 1706–1708. Google Scholar
Brandt, W. (1926). Math. Ann. 96, 360–366. CrossRef Google Scholar
Brown, R. (1987). Bull. London Math. Soc. 19, 113–134. CrossRef Google Scholar
Burt, J. L., Elechiguerra, J. L., ReyesGasga J., MontejanoCarrizales, J. M. & JoseYacaman, M. (2005). J. Cryst. Growth, 285, 681–691. Google Scholar
Cayron, C. (2006). Acta Cryst. A62, 21–40. Web of Science CrossRef CAS IUCr Journals Google Scholar
Cayron, C., Artaud, B. & Briottet, L. (2006). Mater. Charact. 57, 386–401. Web of Science CrossRef CAS Google Scholar
Cheng, Y. (1994). J. Phys. D: Appl. Phys. 27, 1938–1945. Google Scholar
Connes, A. (1990). Géométrie Non Commutative, pp. 9–22. Inter Editions, Paris. Google Scholar
DornbergerSchiff, K. & GrellNiemann, H. (1961). Acta Cryst. 14, 167–177. CrossRef IUCr Journals Web of Science Google Scholar
Fichtner, K. (1986). Comput. Maths Applic. 12B, 751–762. CrossRef Google Scholar
Friedel, G. (1904). Étude sur les Groupements Cristallins. Extrait du Bullettin de la Société de l'Industrie Minérale, Quatrième Série, Tomes III e IV. SaintÉtienne: Société de l'Imprimerie Thèolier J. Thomas et C. Google Scholar
Gertsman, V. Y. (2001a). Acta Cryst. A57, 369–377. Web of Science CrossRef CAS IUCr Journals Google Scholar
Gertsman, V. Y. (2001b). Acta Cryst. A57, 649–655. Web of Science CrossRef CAS IUCr Journals Google Scholar
Gertsman, V. Y. & Henager, C. H. Jr (2003). Interface Sci. 11, 403–415. CrossRef CAS Google Scholar
Gladkikh, A., Lereah, Y., Glickman, E., Karpovski, M., Palevski, A. & Schubert, J. (1995). Appl. Phys. Lett. 66, 1214–1215. CrossRef CAS Google Scholar
Gottstein, G. (1984). Acta Metall. 32, 1117–1138. CrossRef CAS Web of Science Google Scholar
Grimmer, H. (1974). Acta Cryst. A30, 685–688. CrossRef IUCr Journals Web of Science Google Scholar
Grimmer, H. (1976). Acta Cryst. A32, 783–785. CrossRef Web of Science IUCr Journals Google Scholar
Grimmer, H., Bollmann, W. & Warrington, D. H. (1974). Acta Cryst. A30, 197–207. CrossRef IUCr Journals Web of Science Google Scholar
Grimmer, H. & Nespolo, M. (2006). Z. Kristallogr. 221, 28–50. Web of Science CrossRef CAS Google Scholar
Hahn, Th., Janovec, V. & Klapper, H. (1999). Ferroelectrics, 222, 11–21. Web of Science CrossRef Google Scholar
Hahn, Th. & Klapper, H. (2003). Twinning of Crystals. International Tables for Crystallography, Vol. D, edited by A. Authier, pp. 393–448. Dordrecht: Kluwer Academic Publishers. Google Scholar
Janovec, V. (1972). Czech. J. Phys. B, 22, 974–994. CrossRef CAS Web of Science Google Scholar
Janovec, V. (1976). Ferroelectrics, 12, 43–53. CrossRef Google Scholar
Janovec, V., Hahn, Th. & Klapper H. (2003). International Tables for Crystallography, Vol. D, edited by A. Authier, Section 3.2, pp. 377–391. Dordrecht: Kluwer Academic Publishers. Google Scholar
Janovec, V. & Přívratská, J. (2003). International Tables for Crystallography, Vol. D, edited by A. Authier, Section 3.4, pp. 349–505. Dordrecht: Kluwer Academic Publishers. Google Scholar
Kopezky, Ch. V., Andreeva, A. V. & Sukhomlin, G. D. (1991). Acta Metall. Mater. 39, 1603–1615. CrossRef Google Scholar
Kronberg, M. L. & Wilson, F. H. (1949). Trans. Am. Inst. Min. Metall. Eng. 185, 501. Google Scholar
Kumar, M., King, W. E. & Schwartz, A. J. (2000). Acta Mater. 48, 2081–2091. Web of Science CrossRef CAS Google Scholar
Lu, L., Shen Y., Chen, X., Qian, L. & Lu, K. (2004). Science, 304, 422–426. Google Scholar
Milliron, D. J., Hughes, S., Cui, Y., Manna L., Li, J., Wang, L. W. & Alivisatos, A. P. (2004). Nature (London), 430, 190–195. Google Scholar
Mirpuri, K. & Szpunar, J. (2004). Micron, 34, 575–587. CrossRef Google Scholar
Miyazawa, K., Iwasaki, Y., Ito, K. & Ishida, Y. (1996). Acta Cryst. A52, 787–796. CrossRef CAS Web of Science IUCr Journals Google Scholar
Nucci, J. A. (1997). Appl. Phys. Lett. 70, 1242–1244. CrossRef CAS Google Scholar
Palache, C. (1932). American Mineralogist, 17, 360–361. See also http://www.minsocam.org/msa/collectors_corner/arc/twindia.htm . Google Scholar
Pond, R. C. & Vlachavas, D. S. (1983). Proc. R. Soc. London Ser. A, 386, 95–143. CrossRef CAS Google Scholar
Randle, V. & Brown, A. (1989). Philos. Mag. A59, 1075–1089. CrossRef Google Scholar
Reed, B. W. & Kumar, M. (2006). Scr. Mater. 54, 1029–1033. Web of Science CrossRef CAS Google Scholar
Reed, B. W., Minich, R. W., Rudd, R. E. & Kumar, M. (2004). Acta Cryst. A60, 263–277. Web of Science CrossRef CAS IUCr Journals Google Scholar
Ruch, E. & Klein, D. J. (1983). Theor. Chim. Acta, 63, 447–472. CrossRef CAS Google Scholar
Sadanaga, R. (1978). Recent Prog. Nat. Sci. Jpn, 3, 143–151. Google Scholar
Sadanaga, R. & Ohsumi, K. (1979). Acta Cryst. A35, 115–122. CrossRef CAS IUCr Journals Web of Science Google Scholar
Schwartz, A. J., Kumar, M. & Brent, L. A. (2000). Electron Backscatter Diffraction in Materials Science. New York: Kluwer Academic/Plenum Publishers. Google Scholar
Sekiguchi, A., Koike, J. & Maruyama, K. (2003). Appl. Phys. Lett. 83, 1962–1964. CrossRef CAS Google Scholar
Senechal, M. (1983). Acta Cryst. A39, 505–511. CrossRef CAS Web of Science IUCr Journals Google Scholar
Shao, W., Gan, Z. H., Mhasisalkar, S. G., Chen, Z. & Li, H. (2006). Thin Solid Films, 504, 298–301. CrossRef CAS Google Scholar
Shubnikov, A. V. & Koptsik, V. A. (1974). Symmetry in Science and Art. New York: Plenum Press. Google Scholar
Stewart, I. (2004). Nature (London), 427, 601–604. CrossRef PubMed CAS Google Scholar
Sutton, A. P. & Balluffi, R. W. (1995). Interfaces in Crystalline Materials, pp. 684–688. Oxford University Press. Google Scholar
Wadhawan, V. K. (1997). Acta Cryst. A53, 546–555. CrossRef CAS Web of Science IUCr Journals Google Scholar
Watanabe, T. (1985). J. Phys. C4, 555–566. Google Scholar
Wei, H. L., Huang, H., Woo, C. H., Zheng, R. K, Wen, G. H. & Zhang, X. X. (2002). Appl. Phys. Lett. 80, 2290–2292. CrossRef CAS Google Scholar
Weinstein, A. (1996). Notices Am. Math. Soc. 43, 744–752. See also http://en.wikipedia.org/wiki/Groupoid . Google Scholar
Wilbrandt, P. J. (1980). Phys. Status Solidi A, 61, 411–418. CrossRef CAS Google Scholar
This is an openaccess article distributed under the terms of the Creative Commons Attribution (CCBY) Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and source are cited.