Movatterモバイル変換


[0]ホーム

URL:


Next Article in Journal
Possible Physical Mechanisms in the Galaxy to Cause Homochiral Biomaterials for Life
Next Article in Special Issue
Behind the Looking-Glass: A Review on Human Symmetry Perception
Previous Article in Journal
Symmetry, Symmetry Breaking and Topology
Previous Article in Special Issue
Symmetric Matrix Fields in the Finite Element Method
error_outline You can accessthe new MDPI.com website here. Explore and share your feedback with us.close
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Section
Special Issue
Volume
Issue
Number
Page
 
Logical OperatorOperator
Search Text
Search Type
 
add_circle_outline
remove_circle_outline
 
 
Journals
Symmetry
Volume 2
Issue 3
10.3390/sym2031423
Font Type:
ArialGeorgiaVerdana
Font Size:
AaAaAa
Line Spacing:
Column Width:
Background:
Article

Orientational Sampling Schemes Based on Four Dimensional Polytopes

School of Chemistry, University of Southampton, University Road, Southampton SO17 1BJ, UK
*
Author to whom correspondence should be addressed.
Symmetry2010,2(3), 1423-1449;https://doi.org/10.3390/sym2031423
Submission received: 4 February 2010 /Revised: 27 May 2010 /Accepted: 30 June 2010 /Published: 7 July 2010
(This article belongs to the Special IssueFeature Papers: Symmetry Concepts and Applications)

Abstract

:
The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler angles. The spherical moments of these orientational sampling schemes are treated using group theory. The orientational sampling sets may be used in the numerical computation of solid-state nuclear magnetic resonance spectra, and in spherical tensor analysis procedures.

    1. Introduction

    In general, physical properties areanisotropic, meaning that they depend on the orientation of the object of interest in three-dimensional space, defined with respect to an external reference frame. For example, the magnetic resonance response of solid samples depends on the orientation of the molecules with respect to the applied magnetic field [1,2]. Similar considerations apply to many other physical quantities and spectroscopic properties.
    If the physical system is macroscopically isotropic (for example, a finely-divided powdered solid), all molecular orientations are encountered with equal probability. The physical response of such systems is an average over all molecular orientations.
    Suppose that a computational method exists for estimating the value of a particular macroscopic observable for a single molecular orientation. To estimate the powder response, it is necessary to average the results of such computations over a large number of distinct orientations. This is calledpowder averaging, and is a common procedure in, for example, the computation of solid-state magnetic resonance observables [3,4,5,6]. In general, the computational cost of powder averaging is proportional to the number of sampled orientations. It is clearly desirable to use an orientational sampling scheme that gives an acceptable approximation to the isotropic result using the minimum number of orientations. The problem ofoptimum orientational sampling has been a recurring feature of the solid-state nuclear magnetic resonance (NMR) literature for many years [3,4,5,6].
    In addition, there are experimental procedures that require repetition of an experiment for a set of different physical orientations of the system (or parts of the system), in order to estimate the values of anisotropic physical quantities. Physical manipulations of this kind are found, for example, in the NMR of microscopically oriented samples such as single crystals or oriented materials [1].
    There are also experiments of this type in which the sample remains fixed in space, but the orientations of the nuclear spin polarizations are manipulated using applied radio-frequency pulse sequences. For example, in the class of experiments known as spherical tensor analysis [7,8,9], the orientational space of the nuclear spins is sampled in order to derive the spherical tensor components of the quantum statistical operator describing the state of the nuclear spin ensemble. In all such experimental procedures, it is desirable that the orientation sampling scheme is as efficient as possible.

    1.1. Gaussian Spherical Quadrature

    An approach to the orientational sampling problem, using the concept ofGaussian spherical quadrature, was described by Edénet al. in 1998 [4]. This approach may be summarized as follows: Anorientational sampling schemeS consists of a finite setΩS ofNS distinct orientationsΩjS in three-dimensional space, and a setwS ofweightswjS with the propertyj=1NSwjS=1. Both sets have the same number of elementsNS. The isotropic averageQ of a physical observableQ is estimated by computingQ for each orientational sampling pointΩjS and superposing the results according to:
    QestS=j=1NSwjSQ(ΩjS)
    The performance of a sampling scheme may be characterized by itsspherical moments, which are defined as follows:
    σmmS=j=1NSwjSDmm(ΩjS)
    HereDmm(ΩjS) is an element of the Wigner matrix [10] of integer rank, evaluated at orientationΩjS. The Wigner matrices are representations of the group of the three-dimensional rotationsSO(3), with the Wigner matrices of integer rank spanning the irreducible representation ofSO(3) of dimension2+1. If the rotationΩjS is parametrized using the three Euler angles{αjS,βjS,γjS}, representing consecutive rotations about thez,y andz-axes of 3D space, all Wigner matrix elements may be written as follows:
    Dmm(ΩjS)=eimαjSdmm(βjS)eimγjS
    wheredmm(βjS) is an element of the reduced Wigner matrix and the indicesm andm span the integers in the range,,. By definition, the zero-rank spherical moment is given byσ000S=1.
    As discussed by Edénet al. [4], orientational sampling schemes may be constructed which have vanishing spherical moments over a range of ranks,i.e.
    σmmS=0for 1maxS
    Schemes of this kind often provide a good approximation for the isotropic average of an observableQ, using a sampling setS of relatively small size. Their performance is particularly good ifQ is a smooth function of orientationΩ. This is calledGaussian spherical quadrature since it describes a numerical approach to integration of a function over three-dimensional space that is analogous to Gaussian numerical integration on a line interval. The Wigner functions play the same role as orthogonal polynomials in the case of Gaussian line integration.
    In general, sampling schemes with large values ofmaxS provide a more accurate isotropic average than schemes with small values ofmaxS, but require a larger number of elementsNS for their realization. The central problem in Gaussian spherical quadrature is to achieve large values ofmaxS with as smallNS as possible.

    1.2. Two-angle Sampling and Regular Polyhedra

    In many physical situations, the observable of interestQ depends on only two of the three Euler angles defining the orientation in three-dimensional space. This situation arises, for example, in the ordinary NMR of static solids, where the rotational angle of the sample around the static magnetic field has no influence on NMR observables. This is also true for some classes of NMR experiments in rotating solids, as discussed in Reference [4].
    Consider an experiment, or computational procedure, of this type, in which the observable of interest does not depend on the third Euler angleγ. In such cases, the only relevant spherical moments of an orientational sampling scheme havem=0. The known relationships between Wigner functions of the typeDm0(Ω) and the spherical harmonicsYm(θ,ϕ) allows the relevant spherical moments to be written as follows:
    σm0S=4π2+1j=1NSwjSYm(βjS,αjS)*
    where* means complex conjugation. The problem of two-angle orientational sampling is therefore closely related to the problem of Gaussian quadrature on the surface of a sphere, using spherical harmonics as the orthogonal basis functions. The correspondence of the Euler angles{α,β} to the polar angles{θ,ϕ} of a point on the surface of a sphere is as follows:
    αϕβθ
    For small values ofmaxS, efficient two-angle sampling schemes may be constructed from the vertices of the regular three-dimensional polyhedra. As discussed below, the point symmetry groups of such polyhedra ensure that many of the spherical momentsσm0S vanish. For example, the 12 vertices of the icosahedron may be used to construct an orientational sampling set withNS=12, allwjS=1/12, and spherical momentsσm0S=0 for15. All spherical moments with odd values of vanish for this set as well. These favourable properties are well-known in nuclear magnetic resonance and have led to numerous applications [11,12].
    It is not possible to construct sampling sets withmaxS>5 from the vertices of the regular 3D polyhedra. However Lebedev and co-workers [13,14,15] have constructed schemes with large values ofmaxS by using well-chosen orientational sampling points and non-uniform weights. Alternative methods are also available, which do not have such well-defined mathematical properties, but which perform well in many circumstances, for example the REPULSION approach of Bak and Nielsen, which uses numerical optimization under a repulsive electrostatic potential to distribute many points evenly on the surface of a 3D sphere [3].

    1.3. Three-Angle Sampling and Regular 4-Polytopes

    There are numerous cases where the observable of interest depends on all three Euler angles defining the orientationΩ. Some examples from the field of solid-state nuclear magnetic resonance are discussed in Reference [4,5]. In such cases, it is important that the spherical momentsσmmS vanish for all(2+1)2 combinations ofm andm within a given rank, and not just the special components withm=0.
    As described in Reference [4], it is possible to construct three-angle orientational sampling sets with the appropriate properties by (i) taking a two-angle sampling set with the propertyσm0S=0 for1maxS, and (ii) repeating each sampling point while stepping the third angle through(maxS+1) regularly-spaced subdivisions of2π. This generates a three-angle sampling set with the desired propertyσmmS=0 for all{m,m} and1maxS. For example, an icosahedral two-angle set withNS=12 may easily be extended to a three-angle set withNS=72 andmaxS=5. The Lebedev two-angle sets may be extended in analogous fashion. The problems with this approach are (i) it is not efficient, requiring large numbers of orientational samples for modest values ofmaxS and (ii) it does not treat the Euler anglesα andγ in the same way.
    Since efficient two-angle sampling schemes may be derived from the vertices of regular polyhedra, which fall on a sphere in 3D space, it is natural to speculate that efficient three-angle sampling schemes may be derived from the vertices of regular solids in four dimensions, which fall on a sphere in 4D space. The regular 4D solids are known asregular 4-polytopes orregular polychora [16] and have been studied extensively by mathematicians, in particular Coxeter [17].
    Suppose that a 4-polytope is constructed with the vertices lying on the surface of a 4D sphere with unit radius. Each vertex may be converted into a rotation operation in 3D space by identifying it as a unit vector of the following form:
    q=cosξ2nxsinξ2nysinξ2nzsinξ2
    whereξ is the rotation angle andn=(nx,ny,nz) is the unit rotation axis in 3-space,n·n=1. Hence, uniformly distributed rotations in 3-space may be constructed from the vertices of regular 4-polytopes deducing the corresponding 3D rotation angles and rotation axes from Equation7. There is one important complication: unit vectors of the formq andq correspond to rotations differing by an angle of2π, which have the same physical effect on ordinary 3D objects, or on quantum states with integer spin. Hence, a 4-polytope which has the inversion amongst its symmetry operations gives rise to only half the number of physically distinct 3D rotations as its number of vertices. As discussed below, this property applies to all the regular 4-polytopes, with one exception.
    Suppose now that a set ofN 3D rotations is constructed from the vertices of a regular 4-polytope, and that all of the sampling weights are uniform,wjS=N1,j{1,2N}. Many of the spherical moments, defined in Equation2, are expected to vanish, through symmetry. The question is: for which ranks do all spherical moments of the formσmmS vanish? Although this question has been answered in part using the theory of spherical designs [18], it is also possible to treat this problem by relatively simple group theoretical arguments that may be more accessible to non-mathematicians. However, the application of group theory to this problem is made more difficult by the fact that the symmetry operations of the regular 4-polytopes, and the character tables of the corresponding symmetry groups, are distributed over several sources [19,20,21,22,23]. In this article we collate the symmetry operations and their characters for the regular 4-polytopes in the(2+1)2-dimensional representations spanned by the Wigner matricesD(Ω). We derive by group theory the vanishing spherical moments for 3D rotation sets derived from each of the regular 3D and 4D solids. Explicit tables of Euler angles are given, based on the vertices of the regular 4-polytopes. These results should be useful for workers in a wide range of physical sciences, especially magnetic resonance, where one such scheme is already in use [9,24].

    2. Group Theory and Symmetry Averaging

    2.1. Groups, Representations and Characters

    A minimal introduction to group theory is now given in order to establish the notation. For more details, consult the standard texts, for example [25,26,27,28].
    An abstract group{G,} is a collection of elementsG for which a particular associative operation ∘ combines any two elements to give another element in the group. A valid group must include an identity elementE such thatGE=G, and all elements must have an inverseG1 such thatGG1=E. Any subset of a group which itself satisfies the group axioms above is called a subgroup.
    Groups can be represented by matrices. Ann-dimensional linear representationΓ of a groupG assigns an invertiblen×n (real or complex) matrixMΓ(G) to each group elementG, so that the group operation ∘ corresponds to the operation of matrix multiplication:
    MΓG1G2=MΓG1·MΓG2
    A representation is said to beirreducible if it is not possible to find a basis in whichall the matrix representatives of the group elements have the same block diagonal form.
    The explicit matrix representationsMΓ(G) are dependent on the choice of the basis vectors. However, for a given representationΓ, thecharacters, defined as the traces of the matrix representations
    χΓG=TrMΓG
    are independent of the basis. Two group elementsG andG are said to belong to the sameclassC if they are related through a similarity transformation of the formG=AGA1 whereA also belongs to the groupG. All elements in the same class have the same character for all representationsΓ,i.e.
    χΓG=χCΓfor all GC

    2.2. Subgroup Averaging

    Suppose now that the groupG contains a finite subgroupg containingh(g) elements. A representationΓ of the groupG is also a representation of the subgroupg. The finite group orthogonality theorem [28] implies that the number of independent linear combinations of basis vectors spanning the representationΓ which are invariant underall of the subgroup operationsGg is given by
    aΓ(g)=hg1GgχΓG=hg1ChCgχCΓ
    wherehC(g) is the number of elements ofg that belong to the classC. The last two formulations on the right-hand side of11 are equivalent since all elements in the same class have the same character. This equation leads to the following property:
    ChC(g)χCΓ=0GgMΓG=0
    The sum of matrices in the representationΓ vanishes if the characters sum to zero over all classes ofg, taking into account the number of subgroup elementshC(g) in each class.

    2.3. Average of a Function inn-dimensional Space

    Consider now the case where the group elementsG are transformations acting on the pointsx={x1,x2xn} of then-dimensional real spaceRn,i.e.
    Gx=x
    For each group elementG, there exists a corresponding operatorG^ acting onfunctions of the coordinate vectorsf(x) to generate new functionsf(x), defined as follows:
    f(x)=G^f(x)=f(G1x)
    The definition above corresponds to anactive transformation of the objectf [28].
    Theaverage function over a finite subgroupg ofG is defined by
    fg=hg1GgG^f
    where the sum is taken over allh(g) elementsGg and the same argumentx is implied on both sides of the equation.
    Now suppose we have a set ofm functionsf1Γ,,fmΓ forming a basis for anm-dimensional representationΓ ofG. Any operatorG^ is then represented by anm×m matrixMΓ(G) acting on the set of basis functions from the right [29]:
    G^fiΓ(x)=jfjΓ(x)MjiΓG
    Equation12 gives a sufficient condition for the average of eachfiΓ function to vanish:
    ChCgχCΓ=0fiΓg=0

    2.4. Average of a Function Over the Polytope Vertices

    The average value of a functionf over a finite setP ofN0 points in then-dimensional space is defined as follows:
    fP=N01vf(xv)
    wherexv denote the coordinate vectors of the points forv1,2,N0. A groupG ofn dimensional transformations is said to act transitively on theP when for any given pair of pointsxv,xvP there is a transformationG which connects such pointsxv=Gxv [25].
    The orbit stabilizer and Lagrange theorems for finite groups [25] relate the average of a functionf overP to the average over any finite groupgP acting transitively on the set:
    N01vf(xv)=hgP1GgPf(G1x1)=hgP1GgPG^f(x1)
    The right-hand side corresponds to Equation15, evaluated at any pointx1 in the set. From Equation17, the average vanishes if the functionf is one of the basis functions of the representationΓ, and the characters of the given finite group sumgP to zero for that representation:
    ChCgPχCΓ=0fiΓP=0
    Equation20 is the central result of this section. The point symmetry group of ann-dimensional regular polytope is a finite group which acts transitively on the polytope vertices. It is a subgroup of the (infinite) orthogonal groupO(n), which is the group of all then-dimensional space transformations in with a single fixed point and which preserve distance between transformed points. Using Equation20, the averaging properties of a function over the vertices of a polytope may be deduced from the characters of the symmetry elements and the classes of its symmetry point group. This result is now applied to the spherical moments of the regular solids.

    3. Polyhedral Averaging in Three Dimensions

    Three dimensional polytopes are known as polyhedra. In this section we discuss the averaging properties of the regular polyhedra with respect to spherical harmonics. Although this topic has been treated before in Reference [11], a recapitulation is useful for framing the discussion of four-dimensional symmetries. In addition, the treatment in Reference [11] did not exploit all the available symmetries, as discussed below.

    3.1. Proper and Improper Rotations

    Theproper rotations in three dimensions may be defined in various ways. For example, the symbolRn(ξ) indicates a rotation through the angleξ about a unit rotation axisn whose direction is defined by the polar angles{θ,ϕ}. The identity operationR(0) does not need any specification of the rotation axis. Any rotation in 3D space may be decomposed into the product of three consecutive rotations around the cartesian reference axes, for example:Rn(ξ)=Rz(α)Ry(β)Rz(γ), where the rotations are applied in sequence from right to left. For a given rotationR the three Euler anglesΩR={α,β,γ} and the set{ξ,θ,ϕ} are related [10]. Specifically, the rotation angleξ is related to the Euler angles as follows:
    cosξ2=cosβ2cosα+γ2
    Theimproper rotations in three-dimensional space may be expressed in various ways. In this article, we use the set of improper rotations, denotedR˜n(ξ). Each improper rotation corresponds to a proper rotationRn(ξ) followed by an inversion through the reference frame origin (roto-inversion). By definition, the inversion operation corresponds to the improper rotationR˜(0), where the rotation axis does not need to be specified in this case.
    Two other improper rotations are often used in the literature: the reflectionσh in the planeh, and the roto-reflectionSm which is a rotation through2π/m followed by reflection in the plane perpendicular to the rotation axis. Reflections and roto-reflections correspond to improper rotations as follows:σh=R˜n(π) wheren is perpendicular to the planeh, andSm=R˜n(π+2π/m) wheren is the rotation axis defined bySm form3. ClearlyS2=R˜(0) andS1=R˜n(π).

    3.2. Representations and Characters ofO(3) Isometries

    The set of2+1 spherical harmonics of rank- is defined as follows:
    Ym(Θ,Φ)=2+14π(m)!(+m)!Pm(cosΘ)eimΦ
    where andm are integers with|m| andPm is the associated Legendre polynomial [10]. This set of functions is a basis for the(2+1)-dimensional irreducible representation of theO(3) group. The action of anyO(3) operationG on these functions defines an operatorG^ which is represented by a(2+1)×(2+1) matrixM(G):
    G^Ym(Θ,Φ)=mYm(Θ,Φ)MmmG
    In the case of a proper rotationR, the matrix representative is given by the rank- Wigner matrix:
    MR=DΩR
    In the case of an improper rotationR˜, the sign of the matrix changes for odd rank:
    MR˜=(1)DΩR
    The character of a proper rotation for the rank- representation is equal to the trace of the corresponding Wigner matrix,χD(), which depends on the rotation angleξ only [10, pp. 99–100]:
    χ()Rn(ξ)=χD()ξ
    where
    χD()ξ=sin(2+1)ξ2sinξ2
    This evaluates toχD()ξ=2+1 when the rotation angleξ is an integer multiple of2π.
    The character of an improper rotation is the same as for the corresponding proper rotation, but with a change in sign for odd values of:
    χ()R˜n(ξ)=(1)χD()ξ

    3.3. Regular Convex Polyhedra

    The five regular convex polyhedra have been known since the Greeks. Their names and properties are listed inFigure 1. This figure also provides the Schläfli symbols [17] of the form{p,q}, wherep indicates the number of edges of the regular polygonal face, andq is the number of faces meeting at one vertex. For example, the cube has Schläfli symbol{4,3}, while the regular octahedron has the Schläfli symbol{3,4}. Polyhedra with Schläfli symbols{p,q} and{q,p} are geometrical reciprocals of each other and belong to the same symmetry group, since the reciprocation operation corresponds to the mutual exchange of faces and vertices. The five Platonic solids therefore belong to only three symmetry point groups: (i)Td, represented by the tetrahedron; (ii)Oh, populated by the cube and the octahedron; and (iii)Ih, populated by the icosahedron and the dodecahedron. The symmetry point groups of the regular polyhedra are given explicitly inTable 1.

    3.4. Spherical Moments of the Regular Polyhedra

    The theorem in Equation20 may be used withTable 1 and the characters given in Equations26 and28 to deduce the vanishing spherical moments of the regular polyhedra. In general, both improper and proper rotations must be taken into account. The treatment in Reference [11] uses only the proper rotations, and gives slightly different results for the groupsOh andIh (see below).
    As a first example, consider the tetrahedron. As shown inTable 1, the tetrahedron has three symmetry classes of proper rotations, with number of elements(1,8,3) and rotation angles(0,2π/3,π) respectively. In addition, there are two symmetry classes of improper rotations, with number of elements(6,6) and rotation angles(π/2,π) respectively. The sum of characters for rank=2 is therefore given by
    ChCTdχC(2)=χD(2)0+8χD(2)2π/3+3χD(2)π+6(1)2χD(2)π/2+6(1)2χD(2)π=0
    This proves the well-known fact that a tetrahedron averages second-rank spherical harmonics to zero:
    σ2m0(Td)=0
    The point symmetry groups of the octahedron and icosahedron contain the inversion element. Each proper rotation is therefore accompanied by an improper rotation through the same angle, as shown inTable 1. It follows that all odd-rank spherical moments harmonics vanish when summed over the vertices of polyhedra with symmetriesOh andIh:
    ChCOhχC()=ChCIhχC()=0(for odd )
    and hence
    σm0(Oh)=σm0(Ih)=0(for odd )
    The treatment of Reference [11] does not predict this result, since only proper rotations were taken into account. The two analyses differ for rank=9 and all odd ranks13.
    Figure 2 summarizes the spherical rank profiles of the regular convex polyhedra up to rank=30. Note that even the most symmetrical polyhedra (the icosahedron and the dodecahedron) fail to average the rank=6 terms.
    There are 4 regular non-convex polyhedra (star-polyhedra), which all fall in the groupIh [17]. Four of them have the same vertices of the icosahedron while one has the same vertices as the dodecahedron. All have the same spherical moment characteristics as the icosahedron.

    4. Polytopic Averaging in Four Dimensions

    In this section we derive the spherical averaging properties of the regular 4-polytopes. In the discussion below, we make extensive use of quaternions [29]. As shown in Equation7, quaternions provide a correspondence between points on a unit sphere in four-dimensional space, and the group of three-dimensional rotations.

    4.1. Quaternions

    Four-dimensional real space is a vector space: any two vectors can be added or multiplied by a scalar to give another vector. Quaternions extend the vectorial structure of 4D real space by allowing themultiplication of two 4D vectorsq(1) andq(2) according to
    q1(2)q2(2)q3(2)q4(2)q1(1)q2(1)q3(1)q4(1)=q1(2)q1(1)q2(2)q2(1)q3(2)q3(1)q4(2)q4(1)q1(2)q2(1)+q2(2)q1(1)+q3(2)q4(1)q4(2)q3(1)q1(2)q3(1)q2(2)q4(1)+q3(2)q1(1)+q4(2)q2(1)q1(2)q4(1)+q2(2)q3(1)q3(2)q2(1)+q4(2)q1(1)
    The adjoint of a quaternion is denoted hereq and is defined as follows:
    q=q1q2q3q4
    and it can be verified that{q(1)q(2)}=q(2)q(1).
    The inverseq1 is defined for any non zero quaternionq as the unique quaternion that satisfies:
    qq1=q1q=1000
    It can be shown thatq1=q/||q||2 where||q||=iqi2.

    4.2. Unit Quaternions and 3D Rotations

    The set of 4D unit vectors, together with the quaternion multiplication operation ∗, forms the group of unit quaternionsQ. The adjoint of a unit quaternion is the same as its inverse:q1=q. From Equation7, a unit quaternion and its inverse represent a pair of rotations through opposite angles about the same axis.
    The group of unit quaternionsQ is homomorphic with the group of proper three-dimensional rotationsSO(3) [30]. The relationship between the product of quaternions and the product of proper 3D rotations is expressed by
    Rq(2)q(1)=Rq(2)Rq(1)
    whereR(q) is the function which associates a unit quaternionq with the corresponding 3D rotation through Equation7. Consider, for example, a rotation through the angleξ(1) about the axisn(1), followed by a rotation through the angleξ(2) about the axisn(2). The overall rotation angleξ(2,1) is given by
    cosξ(2,1)2=q1(2,1)==q1(2)q1(1)q2(2)q2(1)q3(2)q3(1)q4(2)q4(1)=cosξ(2)2cosξ(1)2n(2)·n(1)×sinξ(2)2sinξ(1)2
    from Equation7 and33.
    Using the notationD(q) to indicate the Wigner matrix of rank evaluated for the 3D rotation corresponding to the unit quaternionq, Equation36 implies:
    Dq(2)q(1)=Dq(2)·Dq(1))
    The Wigner matrices of rank form a2l+1-dimensional representation of the unit quaternion groupQ. In particularD(q1)=D(q)1 and we can use the following properties for the Wigner matrix elements [10, pp.79–80]
    Dmmq=Dmmq1=(1)mmDmmq
    The explicit correspondence between the Euler angles and the unit quaternion components is as follows:
    α+γ=2arctan(q1,q4)β=arccos12q222q32αγ=2arctan(q3,q2)
    wherearctan(x,y) is equal toarctan(y/x), determing the quadrant from the sign ofx andy. In the special casesq2=q3=0 orq1=q4=0, only the combinationsα±γ are defined, as follows:
    β=0α+γ=2arctan(q1,q4)if q2=q3=0β=παγ=2arctan(q3,q2)if q1=q4=0

    4.3. Proper and Improper Rotations

    Isometries in 4D space are classed as eitherproper (preserving the handedness of the four-dimensional axis system) orimproper (changing the handedness of the axis system). The group of all isometries with one fixed point in four dimensions is calledO(4). AnyO(4) operation may be expressed in terms of two unit quaternions, denoted hereql andqr [19], as explained below. Proper operations will be denoted byRql,qr and improper operations byR˜ql,qr respectively. The action of a proper rotationRql,qr on a point in 4D spaceq may be written as follows:
    q=Rql,qrq=qlqqr1
    The action of an improper roationR˜ql,qr is as follows:
    q=R˜ql,qrq=qlqqr1
    The inverse operations are given by
    Rql,qr1=Rql1,qr1Rql,qr1q=ql1qqr
    R˜ql,qr1=R˜qr1,ql1R˜ql,qr1q=qr1qql
    for proper and improper operations respectively.

    4.4. Representation and Characters ofO(4) Isometries

    In this section we give the explicit matrix representations of theO(4) operators and their characters in the basis of the Wigner matrices. These results will then be used to establish the spherical averaging properties of the regular 4-polytopes.
    According to Equations14,44,38 and39, a proper transformation inO(4) defines an operatorR^ql,qr which acts as follows on the Wigner matrix elements evaluated at any unit quaternionq:
    R^ql,qrDmmq=DmmRql,qr1q=Dmmql1qqr=n,nDmnql1DnnqDnmqr=n,n(1)mnDnmqlDn,nqDn,mqr=n,nDn,nq(1)mnDnmqlDnm(qr)
    Similarly according to Equations14, 45,38 and39 an improper transformation inO(4) defines an operatorR˜^ql,qr which acts as follows:
    R˜^ql,qrDmm(q)=DmmR˜ql,qr1q=Dmmqr1qql=n,nDm,nqr1DnnqDnmql=n,n(1)mnDnmqr(1)nnDnn(q)Dnm(ql)=n,n(1)m+nDnmqr(1)nnDnn(q)Dnm(ql)=n,nDnn(q)(1)m+n(1)m+nDnmqrDnm(ql)
    The action of anyO(4) operationG on the(2+1)2 Wigner functionsDmm(q), evaluated for the rotation corresponding to the unit quaternionq, defines an operatorG^ which may be represented as a(2+1)2×(2+1)2-dimensional matrixM(G):
    G^Dmm(q)=n,nDnn(q)M(G)nn,mm
    This proves that the Wigner matrices are a basis for the representation of the groupO(4). The matrix representations are given by
    M(Rql,qr)nn,mm=(1)mnDnmqlDnm(qr)
    for a proper transformationRql,qr and
    M(R˜ql,qr)nn,mm=(1)m+nDnmqlDnmqr
    for an improper transformationR˜ql,qr. In both cases the Wigner matrix elements are evaluated for rotations corresponding to the left and right quaternionsql andqr, as defined for the givenO(4) operation.
    The character of a general 4D rotations in the rank- representation is obtained by summing the matrix representations given by Equations49 and50 over the indicesm=n andm=n. For proper rotations this leads to the following result:
    χ()Rql,qr=χD()ξlχD()ξr
    whereξl andξr are the rotation angles for the pair of 3D rotations corresponding to the left and right quaternions. For improper rotations, on the other hand, we get
    χ()R˜ql,qr=χD()ξl,r
    whereξl,r is the rotational angle associated with the quaternion productq(l,r)=qlqr.

    4.5. Regular Convex 4-Polytopes

    The six regular convex polytopes are summarized inFigure 3. Each of them is represented by a Schläfli symbol of the form{p,q,r} in whichp andq determine the Schläfli symbol{p,q} for the 3-dimensional polyhedron that forms the boundary of the figure andr is the number of polyhedra meeting at one edge [17].
    Polytopes with Schläfli symbols{p,q,r} and{r,q,p} are reciprocals of each other and belong to the same symmetry group. The six regular convex 4-polytopes therefore belong to only four symmetry groups. These are (i) the groupA4 (isomorphic to the permutation group of 5 elements,S5), populated by the 5-cell (hypertetrahedron); (ii) the groupB4, populated by the mutually reciprocal 8-cell (hypercube) and 16-cell (hyperoctahedron); (iii) the groupF4, populated by the 24-cell; and (iv) the groupH4, populated by the mutually reciprocal 120-cell (hyperdodecahedron) and 600-cell (hypericosahedron).
    Table 2 reports the four symmetry groups of the six regular polytopes and their symmetry elements, given in the quaternion form. The numbers of operations in each class are provided, together with one representative operation, using the notationRql,qr for proper transformations andR˜ql,qr for improper transformations. In the case of the groupH4, the symmetry classes and representative operations are given directly in quaternion form in Reference [23]. For the other groups, the information given in the literature [20,21,22] is not directly suitable for this type of analysis. In these cases, the quaternion form of the representative operations and the class structure were obtained by using the information provided in Reference [19] with the help of the symbolic software platformMathematica [31].

    4.6. Spherical Moments of the Regular 4-Polytopes

    The spherical averaging properties of the regular 4-polytopes may be deduced by using Equation20 together with the sets of symmetry operations (Table 2), and the characters of the 4D rotations, given in Equations51 and52.
    As an example, consider the 5-cell, which has symmetry groupA4. FromTable 2, there are seven symmetry classes. The four classes of proper operations have(1,15,20,24) elements respectively. The rotational angles(ξl,ξr) to be used in Equation51 are obtained from Equation7 and have the following values:((0,0),(π,π),(2π/3,2π/3),(2π/5,6π/5)). The remaining three classes of improper operations have(10,30,20) elements respectively. The rotational anglesξl,r to be used in Equation52 are obtained from Equations7 and37 and are as follows:(2π,π,2π/3). The sum of characters for rank=1 is therefore given by
    ChC(Td)χC(1)=χD(1)(0)χD(1)(0)+15χD(1)(π)χD(1)(π)+20χD(1)(2π/3)χD(1)(2π/3)+24χD(1)(2π/5)χD(1)(6π/5)+10χD(1)(2π)+30χD(1)(π)+20χD(1)(2π/3)=0
    This proves that all first-rank spherical moments of a 5-cell are equal to zero:
    σ1mm(A4)=0
    The spherical rank profiles of the other regular polytopes may be obtained in this way for any:Figure 4 summarizes the results up to rank=30. As in the 3D case, even the 600-cell and 120-cell, which have the highest symmetry, fail to average out the rank-6 Wigner matrices.
    This figure is slightly misleading since only integer ranks are shown. Since the groupsB4,F4 andH4 possess an inversion operation,Rq1,q1 withq1=(1,0,0,0), all spherical moments of half-integer rank vanish for these groups. The groupA4, on the other hand, lacks the inversion, so the spherical moments of half-integer rank do not vanish in this case. The fact thatA4 andB4 appear to have the same rank profiles inFigure 4 is therefore due to the omission of half-integer ranks. Most applications of orientational averaging only require integer ranks, in which case the properties shown inFigure 4 are appropriate.
    There are 10 regular non-convex polytopes (star-polytopes) in four dimensions, which all fall in the groupH4 [17]. Nine of them have the same vertices as the 600-cell, while one has the same vertices as the 120-cell. All have the same spherical moment characteristics as the 600-cell.
    Under the reviewing of this paper, an anonymous referee pointed out that the pattern of empty and filled circles inFigure 4 may also be derived using the theory of spherical designs [18]. In general, 4D spherical harmonics of degreek generate a(k+1)2-dimensional representation of the groupO(4) [18]. Such a representation is equivalent to the(2+1)2-dimensional representation constructed in Equation48, withk=2. A sphericalt-design in 4 dimensions is defined as a subset of the hypersphere for which all the 4D spherical harmonics of degrees 1 tot average to 0 [18]. In other words, all the spherical moments of rank from 1 to=t/2 vanish. In Reference [18] the largest valuest of the spherical design have been derived to be 2 for the 5-cell, 3 for the 8-cell, 5 for the 24-cell, and 11 for the 600-cell, which correspond to=1,1,2,5 inFigure 4.
    The anonymous referee also pointed out that invariant theory may be used to prove that non-zero spherical moments in theH4 column inFigure 4 may appear at values corresponding to any sum of 6’s, 10’s and 15’s and for all30.

    5. Euler Angles

    In order to facilitate exploitation of these results, we provide explicit tables of Euler angles derived from the vertices of the regular 4-polytopes. Thezyz convention for the Euler angles is used throughout. All Euler angle sets are derived from 4-polytopes in their standard orientations, as defined inTable 3. Ambiguities of the form given in Equation41 were always resolved by choosing solutions withγ=0. All angles are reduced to the interval 0 to2π by a modulo-2π operation.
    Different Euler angle sets with the same spherical averaging properties may be constructed by applying an equal but arbitrary 4D isometry to all the quaternions underlying the set.
    The set of Euler angles corresponding to the 5 vertices of the 5-cell is provided inTable 4. As shown inFigure 4, all first-rank spherical moments vanish for this set of Euler angles. Since the 5-cell lacks an inversion operation, the number of orientations is the same as the number of vertices in this case.
    The sets of Euler angles corresponding to the 8 vertices of the 16-cell, and the 16 vertices of the 8-cell are provided inTable 5 andTable 6. As shown inFigure 4, all first-rank spherical moments vanish for these sets of Euler angles. The symmetry groups of both polytopes include an inversion operation, so the number of distinguishable orientations is therefore one-half the number of the vertices. Clearly the four rotations specified inTable 5 comprise the most economical way to set all first-rank spherical moments to zero.
    The set of 12 Euler angles corresponding to the 24 vertices of the 24-cell is provided inTable 7. As shown inFigure 4, all first and second-rank spherical moments vanish for this Euler angle set.
    The sets of 60 and 300 Euler angles corresponding to the vertices of the 600-cell and the 120-cell are provided inTable 8 andTable 9.Figure 4 shows that all spherical moments up to and including rank 5 vanish for these Euler angle sets. The most economical way of annihilating spherical ranks up to and including rank 5 is therefore the 60-angle set inTable 8. This rotation set was previously described in Reference [24], where it was presented without any supporting theory.
    It is worth pointing out that the 3D rotations discussed above for the 24-cell and the 600-cell have more inutitive descriptions. The set of Euler angles obtained from the vertices of the 24-cell generates exactly the 12 rotational symmetries of the tetrahedron, compareTable 7 with the last column for the groupTd inTable 1. Similarly the set of Euler angles obtained from the vertices of the 600-cell generates exactly the 60 rotational symmetries of the icosahedron, compareTable 8 with the last column for the groupIh inTable 1. The 24 rotational symmetries of the cube (Oh group) do not corresond to any regular 4-polytope. In fact they are not well distributed in the sense of particle repulsion over the hypersphere in 4D as the other polytopic cases. Regarding this last point, it has been rigorously proven that that some of the regular 4-polytopes (the 5-cell, the 16-cell and the 600-cell) minimize a full class of repulsive potentials over the 4D sphere [32].

    6. Conclusions

    We expect that these sets of rotations will be useful for the computation of orientational averages in a range of physical sciences, and in experimental procedures such as spherical tensor analysis in nuclear magnetic resonance [7,8,9]. In addition, we anticipate that where necessary, finer sampling of orientational space may be implemented by interpolating between the vertices of the polytopes, or by four-dimensional tiling and honeycomb schemes, such as those described by Coxeter [17].
    Finally, we note that highly-symmetric four-dimensional figures have been found by using a computational procedure [33] which is closely related to the REPULSION algorithm on the surface of a sphere [3]. Such methods could be adapted to generate much larger sets of evenly spaced three-dimensional rotations than those described here.

    Acknowledgements

    This research was supported by EPSRC (UK) and the Basic Technology Research Program (UK). We thank Michael Tayler for discussions. We would like to thanks the referees for constructive and insightful comments.

    References

    1. Mehring, M.High Resolution NMR in Solids, 2nd ed.;NMR-Basic Principles and Progress; Springer: Berlin, Germany, 1982; Volume 11. [Google Scholar]
    2. Levitt, M.H.Spin Dynamics. Basics of Nuclear Magnetic Resonance, 2nd ed.; Wiley: Chichester, UK, 2007. [Google Scholar]
    3. Bak, M.; Nielsen, N.C. REPULSION, A Novel Approach to Efficient Powder Averaging in Solid-State NMR.J. Magn. Reson.1997,125, 132–139. [Google Scholar] [CrossRef] [PubMed]
    4. Edén, M.; Levitt, M.H. Computation of Orientational Averages in Solid-State NMR by Gaussian Spherical Quadrature.J. Magn. Reson.1998,132, 220–239. [Google Scholar] [CrossRef] [PubMed]
    5. Edén, M. Computer simulations in solid-state NMR. III. Powder averaging.Concepts Magn. Reson.2003,18A, 24–55. [Google Scholar] [CrossRef]
    6. Stevensson, B.; Edén, M. Efficient orientational averaging by the extension of Lebedev grids via regularized octahedral symmetry expansion.J. Magn. Reson.2006,181, 162–176. [Google Scholar] [CrossRef] [PubMed]
    7. Suter, D.; Pearson, J.G. Experimental Classification of Multi-Spin Coherence under the Full Rotation Group.Chem. Phys. Lett.1988,144, 328–332. [Google Scholar] [CrossRef]
    8. Van Beek, J.D.; Carravetta, M.; Antonioli, G.C.; Levitt, M.H. Spherical tensor analysis of nuclear magnetic resonance signals.J. Chem. Phys.2005,122, 244510. [Google Scholar] [CrossRef] [PubMed]
    9. Pileio, G.; Levitt, M.H. Isotropic filtering using polyhedral phase cycles: Application to singlet state NMR.J. Magn. Reson.2008,191, 148–155. [Google Scholar] [CrossRef] [PubMed]
    10. Varshalovich, D.A.; Moskalev, A.N.; Khersonskii, V.K.Quantum theory of angular momentum; World Scientific Publishing: Teaneck, NJ, USA, 1988. [Google Scholar]
    11. Samoson, A.; Sun, B.Q.; Pines, A. New angles in motional averaging. InPulsed Magnetic Resonance: NMR, ESR, and Optics, A recognition of E. L. Hahn; Bagguley, D.M.S., Ed.; Oxford Science Publications: Oxford, UK, 1992. [Google Scholar]
    12. Emsley, J.L.; Schmidt-Rohr, K.; Pines, A. Group theory and NMR dynamics. InNMR and More: In Honour of Anatole Abragam; Goldman, M., Por, M., Eds.; Les Editions de Physique: Paris, France, 1994. [Google Scholar]
    13. Lebedev, V.I. Quadratures on a Sphere.Zh. Vychisl. Mat. mat. Fiz.1975,15, 48. [Google Scholar] [CrossRef]
    14. Lebedev, V.I. Quadratures on a Sphere.Zh. Vychisl. Mat. mat. Fiz.1976,16, 293. [Google Scholar] [CrossRef]
    15. Lebedev, V.I.; Skorokhodov, A.L. Quadrature Formulas of Orders 41, 47 and 53 for the Sphere.Russian Acad. Sci. Dokl. Math.1992,45, 587. [Google Scholar]
    16. Weissenstein, E.W. Regular Polychoron.http://mathworld.wolfram.com/RegularPolychoron.html (accessed on 6 July 2010).
    17. Coxeter, H.S.M.Regular Polytopes; Methuen: London, UK, 1948. [Google Scholar]
    18. Delsarte, P.; Goethals, J.M.; Jacob, S.J. Spherical codes and designs.Geom. Dedicata1977,6, 363–388. [Google Scholar] [CrossRef]
    19. Du Val, P.Homographies, quaternions and rotations; Oxford University Press: Oxford, UK, 1964. [Google Scholar]
    20. Frobenius, F. Über die Charaktere der symmetrischen Gruppe.Sitzungberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin1900, 516–534. [Google Scholar]
    21. Veysseyre, R.; Weigel, D.; Phan, T.; Effantin, J.M. Crystallography, geometry and physics in higher dimensions. II. Point symmetry of holohedries of the two hypercubic crystal systems in four-dimensional space.Acta Cryst. Sec. A1984,40, 331–337. [Google Scholar] [CrossRef]
    22. Kondo, T. The characters of the Weyl group of typeF4.J. Fac. Sci. Univ. Tokyo Sect. I1965,11, 145–153. [Google Scholar]
    23. Grove, L.C. The characters of the hecatonicosahedroidal group.J. Reine Angew. Math.1974,265, 160–169. [Google Scholar]
    24. Levitt, M.H. An Orientational Sampling Scheme for Magnetic Resonance based on a Four-Dimensional Polytope. InFuture Directions in Magnetic Resonance; Khetrapal, C.L., Ed.; Springer: Berlin, Germany, 2010. [Google Scholar]
    25. Armstrong, M.A.Groups and Symmetry; Sringer-Verlag: New York, NY, USA, 1988. [Google Scholar]
    26. Herstein, I.N.Topics in algebra, 2nd ed.; Xerox College Publishing: Lexington, KY, USA, 1975. [Google Scholar]
    27. Cotton, A.Chemical Applications of Group Theory, 3rd ed.; Wiley: New York, NY, USA, 1990. [Google Scholar]
    28. Hamermesh, M.Group theory and its application to physical problems; Addison-Wesley: London, UK, 1962. [Google Scholar]
    29. Altmann, S.L.Rotations, quaternions, and double groups; Oxford University Press: New York, NY, USA, 1986. [Google Scholar]
    30. Wigner, E.P.Group theory and its application to the quantum mechanics of atomic spectra; Academic Press: New York, NY, USA, 1971. [Google Scholar]
    31. Wolfram, S.Mathematica: A System for Doing Mathematics by Computer; Addison-Wesley: New York, NY, USA, 1991. [Google Scholar]
    32. Cohn, H.; Kumar, A. Universally optimal distribution of points on spheres.J. Amer. Math. Soc.2007,20, 99–148. [Google Scholar] [CrossRef]
    33. Altschuler, E.L.; Perez-Garrido, A.; Stong, R. A Novel Symmetric Four Dimensional Polytope Found Using Optimization Strategies Inspired by Thomson’s Problem of Charges on a Sphere. 2008; arXiv:physics/0601139v1. [Google Scholar]
    Symmetry 02 01423 g001 550
    Figure 1. The 3D regular convex polyhedra organised according to their symmetry group. HereN0 is the number of vertices,N1 is the number of edges andN2 is the number of faces constituting the solid.
    Figure 1. The 3D regular convex polyhedra organised according to their symmetry group. HereN0 is the number of vertices,N1 is the number of edges andN2 is the number of faces constituting the solid.
    Symmetry 02 01423 g001
    Symmetry 02 01423 g002 550
    Figure 2. Spherical rank profiles for the regular convex 3D polyhedra. Open circles indicate that all(2+1) spherical momentsσm0S of integer rank are zero for the set of orientations corresponding to the vertices of the corresponding polyhedron. Closed circles indicate that there is at least one non-zero spherical moment of rank.
    Figure 2. Spherical rank profiles for the regular convex 3D polyhedra. Open circles indicate that all(2+1) spherical momentsσm0S of integer rank are zero for the set of orientations corresponding to the vertices of the corresponding polyhedron. Closed circles indicate that there is at least one non-zero spherical moment of rank.
    Symmetry 02 01423 g002
    Symmetry 02 01423 g003 550
    Figure 3. A list of the 4D regular convex polytopes organized according to their symmetry group. HereN0 is the number of vertices,N1 is the number of edges,N2 is the number of faces andN3 is the number of three dimensional cells. The two dimensional graphs indicate the vertex connections.
    Figure 3. A list of the 4D regular convex polytopes organized according to their symmetry group. HereN0 is the number of vertices,N1 is the number of edges,N2 is the number of faces andN3 is the number of three dimensional cells. The two dimensional graphs indicate the vertex connections.
    Symmetry 02 01423 g003
    Symmetry 02 01423 g004 550
    Figure 4. Spherical rank profiles of the regular convex 4-polytopes. Open circles indicate that all(2+1)2 spherical momentsσmmS of integer rank are zero for the set of orientations derived from the vertices of the corresponding polytope. Closed circles indicate that there is at least one non-zero spherical moment of rank.
    Figure 4. Spherical rank profiles of the regular convex 4-polytopes. Open circles indicate that all(2+1)2 spherical momentsσmmS of integer rank are zero for the set of orientations derived from the vertices of the corresponding polytope. Closed circles indicate that there is at least one non-zero spherical moment of rank.
    Symmetry 02 01423 g004
    Table
    Table 1. The three symmetry point groups of the regular polyhedra.h is the number of symmetry elements in the group. The last column shows the number of elements in each class (in square parentheses), followed by a single symmetry element of the class, for a polyhedron in standard orientation. The symbolR(a,b,c)(ξ) indicates a rotation through the angleξ about the axis(a,b,c). The symbolR˜(a,b,c)(ξ) indicates the improper operation constructed by the proper rotationR(a,b,c)(ξ) followed by the inversion operation.R(0) is the identity operation andR˜(0) is the inversion operation. The symbolτ=2cos(π/5)=(5+1)/2 indicates the golden ratio.
    Table 1. The three symmetry point groups of the regular polyhedra.h is the number of symmetry elements in the group. The last column shows the number of elements in each class (in square parentheses), followed by a single symmetry element of the class, for a polyhedron in standard orientation. The symbolR(a,b,c)(ξ) indicates a rotation through the angleξ about the axis(a,b,c). The symbolR˜(a,b,c)(ξ) indicates the improper operation constructed by the proper rotationR(a,b,c)(ξ) followed by the inversion operation.R(0) is the identity operation andR˜(0) is the inversion operation. The symbolτ=2cos(π/5)=(5+1)/2 indicates the golden ratio.
    Symmetry grouphSymmetry operations
    Td24[1]R(0);[8]R(1,1,1)(2π/3);[3]R(1,0,0)(π);
    [6]R˜(1,0,0)(π/2);[6]R˜(1,1,0)(π)
    Oh48[1]R(0);[8]R(1,1,1)(2π/3);[3]R(1,0,0)(π);
    [6]R(1,0,0)(π/2);[6]R(1,1,0)(π);
    [1]R˜(0);[8]R˜(1,1,1)(2π/3);[3]R˜(1,0,0)(π);
    [6]R˜(1,0,0)(π/2);[6]R˜(1,1,0)(π);
    Ih120[1]R(0);[12]R(1,0,0)(2π/5);[12]R(1,0,0)(4π/5);
    [20]R(2,0,τ2)(2π/3);[15]R(τ,0,1)(π);
    [1]R˜(0);[12]R˜(1,0,0)(2π/5);[12]R˜(1,0,0)(4π/5);
    [20]R˜(2,0,τ2)(2π/3);[15]R˜(τ,0,1)(π);
    Table
    Table 2. The four symmetry groups of the 4D regular polytopes.h denotes the total number of symmetry elements. The last column shows the number of elements in each class (in square parentheses), followed by a single symmetry element of the class, for a polytope in standard orientation. The symmetry elements are denotedRql,qr for a proper rotation andR˜ql,qr for an improper rotation, see Equations42 and43. The quaternions{q1,q2q15} are given explicitly in the last section.
    Table 2. The four symmetry groups of the 4D regular polytopes.h denotes the total number of symmetry elements. The last column shows the number of elements in each class (in square parentheses), followed by a single symmetry element of the class, for a polytope in standard orientation. The symmetry elements are denotedRql,qr for a proper rotation andR˜ql,qr for an improper rotation, see Equations42 and43. The quaternions{q1,q2q15} are given explicitly in the last section.
    Symmetry grouphSymmetry operations
    A4120[1]Rq1,q1;[15]Rq3,q3;[20]Rq8,q8;[24]Rq11,q12
    [10]R˜q4,q4;[30]R˜q5,q5;[20]R˜q9,q10
    B4384[1]Rq1,q1;[1]Rq1,q1;[6]Rq2,q2;[12]Rq2,q1;[12]Rq2,q3;[24]Rq4,q4;
    [12]Rq6,q6;[12]Rq6,q6;[32]Rq7,q7;[32]Rq7,q7;[48]Rq6,q4;
    [4]R˜q1,q1;[4]R˜q1,q1;[24]R˜q2,q1;[12]R˜q4,q4;[12]R˜q4,q4;
    [48]R˜q6,q4;[24]R˜q6,q6;[32]R˜q7,q7;[32]R˜q7,q7
    F41152[1]Rq1,q1;[1]Rq1,q1;[12]Rq2,q1;[18]Rq2,q2;[96]Rq2,q7;
    [72]Rq4,q4;[144]Rq6,q4;[36]Rq6,q6;[36]Rq6,q6;[16]Rq7,q1;
    [16]Rq7,q1;[32]Rq7,q7;[32]Rq7,q7;[32]Rq7,q8;[32]Rq7,q8;
    [12]R˜q1,q1;[72]R˜q2,q1;[12]R˜q2,q2;[96]R˜q2,q7;[12]R˜q4,q4;
    [12]R˜q4,q4;[72]R˜q6,q4;[96]R˜q6,q5;[96]R˜q6,q5;[96]R˜q7,q1
    H414 400[1]Rq1,q1;[1]Rq1,q1;[60]Rq1,q3;[40]Rq1,q13;[40]Rq1,q13;
    [24]Rq1,q14;[24]Rq1,q14;[24]Rq1,q15;[24]Rq1,q15;[450]Rq3,q3;
    [1200]Rq3,q13;[720]Rq3,q14;[720]Rq3,q15;[400]Rq13,q13;[400]Rq13,q13;
    [480]Rq13,q14;[480]Rq13,q14;[480]Rq13,q15;[480]Rq13,q15;[144]Rq14,q14;
    [144]Rq14,q14[288]Rq14,q15;[288]Rq14,q15;[144]Rq15,q15;[144]Rq15,q15
    [60]R˜q1,q1;[60]R˜q1,q1;[1800];R˜q3,q1;[1200]R˜q13,q1;[1200]R˜q13,q1;
    [720]R˜q14,q1;[720]R˜q14,q1;[720]R˜q15,q1;[720]R˜q15,q1;
    q1=1,0,0,0;q2=0,0,0,1;q3=0,1,0,0;
    q4=0,0,12,12;q5=12,0,0,12;q6=12,12,0,0;
    q7=12,12,12,12;q8=12,12,12,12;q9=122,122,122,522;
    q10=122,122,122,522;q11=τ2,τ12,12,0;q12=τ12,τ2,12,0;
    q13=12,τ12,τ2,0;q14=τ2,12,τ12,0;q15=τ12,τ2,12,0
    Table
    Table 3. The coordinates of the six convex regular 4-polytopes vertices in standard orientation, as reported in Reference [19]. The double round parentheses(()) indicate that all even permutations of the quartet are taken. The symbolsτ andη take the valuesτ=2cos(π/5)=(5+1)/2 andη=5/4. The 600 vertices of the hyperdodecahedron are obtained by multiplying the quaternion(21/2,21/2,0,0) with all possible quaternion products of the 5 vertices of the hypertetrahedronS and the 120 vertices of the hypericosahedronI. All the polytopes are centred at the origin of the coordinate system, with the vertices lying on the hypersphere of radius 1.
    Table 3. The coordinates of the six convex regular 4-polytopes vertices in standard orientation, as reported in Reference [19]. The double round parentheses(()) indicate that all even permutations of the quartet are taken. The symbolsτ andη take the valuesτ=2cos(π/5)=(5+1)/2 andη=5/4. The 600 vertices of the hyperdodecahedron are obtained by multiplying the quaternion(21/2,21/2,0,0) with all possible quaternion products of the 5 vertices of the hypertetrahedronS and the 120 vertices of the hypericosahedronI. All the polytopes are centred at the origin of the coordinate system, with the vertices lying on the hypersphere of radius 1.
    NameVertex Coordinates
    5-cell or hypertetrahedronS={(1,0,0,0),(1/4,η,η,η),(1/4,η,η,η),
    (1/4,η,η,η),(1/4,η,η,η)}
    16-cell or hyperoctahedronV=((±1,0,0,0))
    8-cell or hypercubeW=((±1/2,±1/2,±1/2,±1/2))
    24-cellT=VW
    600-cell or hypericosahedronI=T12((±τ,±1,±τ1,0))
    120-cell or hyperdodecahedronJ=(21/2,21/2,0,0)SI
    Table
    Table 4. The set of Euler angles (in degrees) corresponding to the 5 verticesS of the 5-cell whose cartesian coordinates are given inTable 3.
    Table 4. The set of Euler angles (in degrees) corresponding to the 5 verticesS of the 5-cell whose cartesian coordinates are given inTable 3.
    αβγ
    000
    69.0948104.478159.095
    110.905104.47820.9052
    249.095104.478339.095
    290.905104.478200.905
    Table
    Table 5. The set of Euler angles (in degrees) corresponding to the 8 verticesV of the 16-cell whose cartesian coordinates are given inTable 3. The 8 vertices are reduced to 4 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    Table 5. The set of Euler angles (in degrees) corresponding to the 8 verticesV of the 16-cell whose cartesian coordinates are given inTable 3. The 8 vertices are reduced to 4 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    αβγ
    000
    01800
    18000
    1801800
    Table
    Table 6. The set of Euler angles (in degrees) corresponding to the 16 verticesW of the 8-cell whose cartesian coordinates are given inTable 3. The 16 vertices are reduced to 8 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    Table 6. The set of Euler angles (in degrees) corresponding to the 16 verticesW of the 8-cell whose cartesian coordinates are given inTable 3. The 16 vertices are reduced to 8 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    αβγ
    09090
    090270
    90900
    9090180
    1809090
    18090270
    270900
    27090180
    Table
    Table 7. The set of Euler angles (in degrees) corresponding to the 24 verticesT of the 24-cell whose cartesian coordinates are given inTable 3. The 24 vertices are reduced to 12 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    Table 7. The set of Euler angles (in degrees) corresponding to the 24 verticesT of the 24-cell whose cartesian coordinates are given inTable 3. The 24 vertices are reduced to 12 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    αβγαβγ
    00018000
    090901809090
    09027018090270
    018001801800
    90900270900
    909018027090180
    Table
    Table 8. The set of Euler angles (in degrees) corresponding to the 120 verticesI of the 600-cell whose cartesian coordinates are given inTable 3. The 120 vertices are reduced to 60 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    Table 8. The set of Euler angles (in degrees) corresponding to the 120 verticesI of the 600-cell whose cartesian coordinates are given inTable 3. The 120 vertices are reduced to 60 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    αβγαβγ
    00018000
    090901809090
    09027018090270
    018001801800
    20.905260200.905200.9056020.9052
    20.9052120159.095200.90560200.905
    20.90526020.9052200.905120159.095
    20.9052120339.095200.905120339.095
    58.28263658.2826238.2833658.2826
    58.282636238.283238.28336238.283
    58.282672121.717238.28372121.717
    58.282672301.717238.28372301.717
    58.282610858.2826238.28310858.2826
    58.2826108238.283238.283108238.283
    58.2826144121.717238.283144121.717
    58.2826144301.717238.283144301.717
    90900270900
    909018027090180
    121.71736121.717301.71736121.717
    121.71736301.717301.71736301.717
    121.7177258.2826301.7177258.2826
    121.71772238.283301.71772238.283
    121.717108121.717301.717108121.717
    121.717108301.717301.717108301.717
    121.71714458.2826301.71714458.2826
    121.717144238.283301.717144238.283
    159.09560159.095339.09560159.095
    159.09560339.095339.09560339.095
    159.09512020.9052339.09512020.9052
    159.095120200.905339.095120200.905
    Table
    Table 9. The set of Euler angles (in degrees) corresponding to the 600 verticesJ of the 120-cell whose cartesian coordinates are given inTable 3. The 600 vertices are reduced to 300 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    Table 9. The set of Euler angles (in degrees) corresponding to the 600 verticesJ of the 120-cell whose cartesian coordinates are given inTable 3. The 600 vertices are reduced to 300 sets of Euler angles because each quaternion pair{q,q} corresponds to the same geometrical 3D rotation.
    αβγαβγαβγαβγ
    09009090901809002709090
    09018090902701809018027090270
    7.2559749.117670.6909901800187.25649.117670.69092701800
    7.2559749.1176250.69195.659975.5225137.470187.25649.1176250.691275.66075.5225137.470
    7.25597130.882109.30995.659975.5225317.471187.256130.882109.309275.66075.5225317.471
    7.25597130.882289.30995.6599104.47842.5298187.256130.882289.309275.660104.47842.5298
    14.545484.5204131.11095.6599104.478222.530194.54684.5204131.110275.660104.478222.530
    14.545484.5204311.11098.300841.409698.3008194.54684.5204311.110278.30141.409698.3008
    14.545495.479648.889598.300841.4096278.301194.54695.479648.8895278.30141.4096278.301
    14.545495.4796228.89098.3008138.59081.6992194.54695.4796228.890278.301138.59081.6992
    20.905215.522520.905298.3008138.590261.699200.90515.522520.9052278.301138.590261.699
    20.905215.5225200.905105.45069.7882105.450200.90515.5225200.905285.45069.7882105.450
    20.905244.4775159.095105.45069.7882285.450200.90544.4775159.095285.45069.7882285.450
    20.905244.4775339.095105.450110.21274.5496200.90544.4775339.095285.450110.21274.5496
    20.905260110.905105.450110.212254.550200.90560110.905285.450110.212254.550
    20.905260290.905109.30949.1176172.744200.90560290.905289.30949.1176172.744
    20.905275.5225159.095109.30949.1176352.7441200.90575.5225159.095289.30949.1176352.7441
    20.905275.5225339.095109.309130.8827.25597200.90575.5225339.095289.309130.8827.25597
    20.9052104.47820.9052109.309130.882187.256200.905104.47820.9052289.309130.882187.256
    20.9052104.478200.905110.9056020.9052200.905104.478200.905290.9056020.9052
    20.905212069.0948110.90560200.905200.90512069.0948290.90560200.905
    20.9052120249.095110.905120159.095200.905120249.095290.905120159.095
    20.9052135.52220.9052110.905120339.095200.905135.52220.9052290.905120339.095
    20.9052135.522200.905121.7173631.7175200.905135.522200.905301.7173631.7175
    20.9052164.478159.095121.71736211.717200.905164.478159.095301.71736211.717
    20.9052164.478339.095121.71772148.283200.905164.478339.095301.71772148.283
    31.717536121.717121.71772328.283211.71736121.717301.71772328.283
    31.717536301.717121.71710831.7175211.71736301.717301.71710831.7175
    31.71757258.2826121.717108211.717211.7177258.2826301.717108211.717
    31.717572238.283121.717144148.283211.71772238.283301.717144148.283
    31.7175108121.717121.717144328.283211.717108121.717301.717144328.283
    31.7175108301.717131.11084.520414.5454211.717108301.717311.11084.520414.5454
    31.717514458.2826131.11084.5204194.546211.71714458.2826311.11084.5204194.546
    31.7175144238.283131.11095.4796165.455211.717144238.283311.11095.4796165.455
    35.889825.242835.8898131.11095.4796345.455215.89025.242835.8898311.11095.4796345.455
    35.889825.2428215.890137.47075.522595.6599215.89025.2428215.890317.47175.522595.6599
    35.8898154.757144.110137.47075.5225275.660215.890154.757144.110317.47175.5225275.660
    35.8898154.757324.110137.470104.47884.3401215.890154.757324.110317.471104.47884.3401
    42.529875.522584.3401137.470104.478264.340222.53075.522584.3401317.471104.478264.340
    42.529875.5225264.340144.11025.2428144.110222.53075.5225264.340324.11025.2428144.110
    42.5298104.47895.6599144.11025.2428324.110222.530104.47895.6599324.11025.2428324.110
    42.5298104.478275.660144.110154.75735.8898222.530104.478275.660324.110154.75735.8898
    48.889584.5204165.455144.110154.757215.890228.89084.5204165.455324.110154.757215.890
    48.889584.5204345.455148.2833658.2826228.89084.5204345.455328.2833658.2826
    48.889595.479614.5454148.28336238.283228.89095.479614.5454328.28336238.283
    48.889595.4796194.546148.28372121.717228.89095.4796194.546328.28372121.717
    58.282636148.283148.28372301.717238.28336148.283328.28372301.717
    58.282636328.283148.28310858.2826238.28336328.283328.28310858.2826
    58.28267231.7175148.283108238.283238.2837231.7175328.283108238.283
    58.282672211.717148.283144121.717238.28372211.717328.283144121.717
    58.2826108148.283148.283144301.717238.283108148.283328.283144301.717
    58.2826108328.283159.09515.5225159.095238.283108328.283339.09515.5225159.095
    58.282614431.7175159.09515.5225339.095238.28314431.7175339.09515.5225339.095
    58.2826144211.717159.09544.477520.9052238.283144211.717339.09544.477520.9052
    69.094860159.095159.09544.4775200.905249.09560159.095339.09544.4775200.905
    69.094860339.095159.0956069.0948249.09560339.095339.0956069.0948
    69.094812020.9052159.09560249.095249.09512020.9052339.09560249.095
    69.0948120200.905159.09575.522520.9052249.095120200.905339.09575.522520.9052
    70.690949.11767.25597159.09575.5225200.905250.69149.11767.25597339.09575.5225200.905
    70.690949.1176187.256159.095104.478159.095250.69149.1176187.256339.095104.478159.095
    70.6909130.882172.744159.095104.478339.095250.691130.882172.744339.095104.478339.095
    70.6909130.882352.7441159.095120110.905250.691130.882352.7441339.095120110.905
    74.549669.788274.5496159.095120290.905254.55069.788274.5496339.095120290.905
    74.549669.7882254.550159.095135.522159.095254.55069.7882254.550339.095135.522159.095
    74.5496110.212105.450159.095135.522339.095254.550110.212105.450339.095135.522339.095
    74.5496110.212285.450159.095164.47820.9052254.550110.212285.450339.095164.47820.9052
    81.699241.409681.6992159.095164.478200.905261.69941.409681.6992339.095164.478200.905
    81.699241.4096261.699165.45584.520448.8895261.69941.4096261.699345.45584.520448.8895
    81.6992138.59098.3008165.45584.5204228.890261.699138.59098.3008345.45584.5204228.890
    81.6992138.590278.301165.45595.4796131.110261.699138.590278.301345.45595.4796131.110
    84.340175.522542.5298165.45595.4796311.110264.34075.522542.5298345.45595.4796311.110
    84.340175.5225222.530172.74449.1176109.309264.34075.5225222.530352.744149.1176109.309
    84.3401104.478137.470172.74449.1176289.309264.340104.478137.470352.744149.1176289.309
    84.3401104.478317.471172.744130.88270.6909264.340104.478317.471352.7441130.88270.6909
    9000172.744130.882250.69127000352.7441130.882250.691

    © 2010 by the authors; licensee MDPI, Basel, Switzerland. This article is an Open Access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/.)

    Share and Cite

    MDPI and ACS Style

    Mamone, S.; Pileio, G.; Levitt, M.H. Orientational Sampling Schemes Based on Four Dimensional Polytopes.Symmetry2010,2, 1423-1449. https://doi.org/10.3390/sym2031423

    AMA Style

    Mamone S, Pileio G, Levitt MH. Orientational Sampling Schemes Based on Four Dimensional Polytopes.Symmetry. 2010; 2(3):1423-1449. https://doi.org/10.3390/sym2031423

    Chicago/Turabian Style

    Mamone, Salvatore, Giuseppe Pileio, and Malcolm H. Levitt. 2010. "Orientational Sampling Schemes Based on Four Dimensional Polytopes"Symmetry 2, no. 3: 1423-1449. https://doi.org/10.3390/sym2031423

    APA Style

    Mamone, S., Pileio, G., & Levitt, M. H. (2010). Orientational Sampling Schemes Based on Four Dimensional Polytopes.Symmetry,2(3), 1423-1449. https://doi.org/10.3390/sym2031423

    Article Metrics

    No
    No

    Article Access Statistics

    For more information on the journal statistics, clickhere.
    Multiple requests from the same IP address are counted as one view.
    Symmetry, EISSN 2073-8994, Published by MDPI
    RSSContent Alert

    Further Information

    Article Processing Charges Pay an Invoice Open Access Policy Contact MDPI Jobs at MDPI

    Guidelines

    For Authors For Reviewers For Editors For Librarians For Publishers For Societies For Conference Organizers

    MDPI Initiatives

    Sciforum MDPI Books Preprints.org Scilit SciProfiles Encyclopedia JAMS Proceedings Series

    Follow MDPI

    LinkedIn Facebook X
    MDPI

    Subscribe to receive issue release notifications and newsletters from MDPI journals

    © 1996-2026 MDPI (Basel, Switzerland) unless otherwise stated
    Terms and Conditions Privacy Policy
    We use cookies on our website to ensure you get the best experience.
    Read more about our cookieshere.
    Accept
    Back to TopTop
    [8]ページ先頭

    ©2009-2026 Movatter.jp