|
Point Group
In geometry, a point group is a group (mathematics), mathematical group of symmetry operations (isometry, isometries in a Euclidean space) that have a Fixed point (mathematics), fixed point in common. The Origin (mathematics), coordinate origin of the Euclidean space is conventionally taken to be a fixed point, and every point group in dimension ''d'' is then a subgroup of the orthogonal group O(''d''). Point groups are used to describe the Symmetry (geometry), symmetries of geometric figures and physical objects such as molecular symmetry, molecules. Each point group can be Group representation, represented as sets of orthogonal matrix, orthogonal matrices ''M'' that transform point ''x'' into point ''y'' according to . Each element of a point group is either a Rotation (mathematics), rotation (determinant of ), or it is a Reflection (mathematics), reflection or improper rotation (determinant of ). The geometric symmetries of crystals are described by space groups, which allow T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flag Of Hong Kong
The Regional Flag of the Hong Kong Special Administrative Region of the People's Republic of China depicts a white stylised five-petal Hong Kong orchid tree (''Bauhinia × blakeana'') flower in the centre of a Chinese red field. Its design is enshrined in Hong Kong's Basic Law, the territory's constitutional document, and regulations regarding its use, prohibition of use, desecration, and manufacture are stated in the Regional Flag and Regional Emblem Ordinance. The original design of the flag of Hong Kong was unveiled on 4 April 1990 at the Third Session of the Seventh National People's Congress. The current design was approved on 10 August 1996 at the Fourth Plenum of the Preparatory Committee of the Hong Kong Special Administrative Region. The use of the flag is regulated by laws passed by the 58th executive meeting of the State Council held in Beijing. The flag was officially adopted and hoisted on 1 July 1997, during the handover ceremony marking the handover from t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a Scalar (mathematics), scalar-valued function (mathematics), function of the entries of a square matrix. The determinant of a matrix is commonly denoted , , or . Its value characterizes some properties of the matrix and the linear map represented, on a given basis (linear algebra), basis, by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible matrix, invertible and the corresponding linear map is an linear isomorphism, isomorphism. However, if the determinant is zero, the matrix is referred to as singular, meaning it does not have an inverse. The determinant is completely determined by the two following properties: the determinant of a product of matrices is the product of their determinants, and the determinant of a triangular matrix is the product of its diagonal entries. The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter–Dynkin Diagram
In geometry, a Harold Scott MacDonald Coxeter, Coxeter–Eugene Dynkin, Dynkin diagram (or Coxeter diagram, Coxeter graph) is a Graph (discrete mathematics), graph with numerically labeled edges (called branches) representing a Coxeter group or sometimes a uniform polytope or uniform tiling constructed from the group. A class of closely related objects is the Dynkin diagrams, which differ from Coxeter diagrams in two respects: firstly, branches labeled "" or greater are Directed graph, directed, while Coxeter diagrams are Undirected graph, undirected; secondly, Dynkin diagrams must satisfy an additional (Crystallographic restriction theorem, crystallographic) restriction, namely that the only allowed branch labels are and Dynkin diagrams correspond to and are used to classify root systems and therefore semisimple Lie algebras. Description A Coxeter group is a group that admits a presentation: \langle r_0,r_1,\dots,r_n \mid (r_i r_j)^ = 1 \rangle where the are integers that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Coxeter Group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; for example, the symmetry group of each regular polyhedron is a finite Coxeter group. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups, and finite Coxeter groups were classified in 1935. Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthogonal Group
In mathematics, the orthogonal group in dimension , denoted , is the Group (mathematics), group of isometry, distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by Function composition, composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of orthogonal matrix, orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose invertible matrix, inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact group, compact. The orthogonal group in dimension has two connected component (topology), connected components. The one that contains the identity element is a normal subgroup, called the special orthogonal group, and denoted . It consists of all orthogonal matrices of determinant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chiral
Chirality () is a property of asymmetry important in several branches of science. The word ''chirality'' is derived from the Greek language, Greek (''kheir''), "hand", a familiar chiral object. An object or a system is ''chiral'' if it is distinguishable from its mirror image; that is, it cannot be wikt:superpose, superposed (not to be confused with wikt:superimpose, superimposed) onto it. Conversely, a mirror image of an ''achiral'' object, such as a sphere, cannot be distinguished from the object. A chiral object and its mirror image are called ''enantiomorphs'' (Greek, "opposite forms") or, when referring to molecules, ''enantiomers''. A non-chiral object is called ''achiral'' (sometimes also ''amphichiral'') and can be superposed on its mirror image. The term was first used by Lord Kelvin in 1893 in the second Robert Boyle Lecture at the Oxford University Junior Scientific Club which was published in 1894: Human hands are perhaps the most recognized example of chirality ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crystallographic Point Group
In crystallography, a crystallographic point group is a three-dimensional point group whose symmetry operations are compatible with a three-dimensional crystallographic lattice. According to the crystallographic restriction it may only contain one-, two-, three-, four- and sixfold rotations or rotoinversions. This reduces the number of crystallographic point groups to 32 (from an infinity of general point groups). These 32 groups are the same as the 32 types of morphological (external) crystalline symmetries derived in 1830 by Johann Friedrich Christian Hessel from a consideration of observed crystal forms. In 1867 Axel Gadolin, who was unaware of the previous work of Hessel, found the crystallographic point groups independently using stereographic projection to represent the symmetry elements of the 32 groups. In the classification of crystals, to each space group is associated a crystallographic point group by "forgetting" the translational components of the symmetry operatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice (group)
In geometry and group theory, a lattice in the real coordinate space \mathbb^n is an infinite set of points in this space with the properties that coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point. Closure under addition and subtraction means that a lattice must be a subgroup of the additive group of the points in the space, and the requirements of minimum and maximum distance can be summarized by saying that a lattice is a Delone set. More abstractly, a lattice can be described as a free abelian group of dimension n which spans the vector space \mathbb^n. For any basis of \mathbb^n, the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice, and every lattice can be formed from a basis in this way. A lattice may be viewed as a re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Space Group
In mathematics, physics and chemistry, a space group is the symmetry group of a repeating pattern in space, usually in three dimensions. The elements of a space group (its symmetry operations) are the rigid transformations of the pattern that leave it unchanged. In three dimensions, space groups are classified into 219 distinct types, or 230 types if chiral copies are considered distinct. Space groups are discrete cocompact groups of isometries of an oriented Euclidean space in any number of dimensions. In dimensions other than 3, they are sometimes called Bieberbach groups. In crystallography, space groups are also called the crystallographic or Fedorov groups, and represent a description of the symmetry of the crystal. A definitive source regarding 3-dimensional space groups is the ''International Tables for Crystallography'' . History Space groups in 2 dimensions are the 17 wallpaper groups which have been known for several centuries, though the proof that the list ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crystallographic Restriction Theorem
The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2-fold, 3-fold, 4-fold, and 6-fold. However, quasicrystals can occur with other diffraction pattern symmetries, such as 5-fold; these were not discovered until 1982 by Dan Shechtman.Shechtman et al (1982) Crystals are modeled as discrete lattices, generated by a list of independent finite translations . Because discreteness requires that the spacings between lattice points have a lower bound, the group of rotational symmetries of the lattice at any point must be a finite group (alternatively, the point is the only system allowing for infinite rotational symmetry). The strength of the theorem is that ''not all'' finite groups are compatible with a discrete lattice; in any dimension, we will have only a finite number of compatible groups. Dimensions 2 and 3 The special cases of 2D (wallpaper groups) and 3D (space groups) are mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Translation (geometry)
In Euclidean geometry, a translation is a geometric transformation that moves every point of a figure, shape or space by the same Distance geometry, distance in a given direction (geometry), direction. A translation can also be interpreted as the addition of a constant vector space, vector to every point, or as shifting the Origin (mathematics), origin of the coordinate system. In a Euclidean space, any translation is an isometry. As a function If \mathbf is a fixed vector, known as the ''translation vector'', and \mathbf is the initial position of some object, then the translation function T_ will work as T_(\mathbf)=\mathbf+\mathbf. If T is a translation, then the image (mathematics), image of a subset A under the function (mathematics), function T is the translate of A by T . The translate of A by T_ is often written as A+\mathbf . Application in classical physics In classical physics, translational motion is movement that changes the Position (geometry), positio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Space Group
In mathematics, physics and chemistry, a space group is the symmetry group of a repeating pattern in space, usually in three dimensions. The elements of a space group (its symmetry operations) are the rigid transformations of the pattern that leave it unchanged. In three dimensions, space groups are classified into 219 distinct types, or 230 types if chiral copies are considered distinct. Space groups are discrete cocompact groups of isometries of an oriented Euclidean space in any number of dimensions. In dimensions other than 3, they are sometimes called Bieberbach groups. In crystallography, space groups are also called the crystallographic or Fedorov groups, and represent a description of the symmetry of the crystal. A definitive source regarding 3-dimensional space groups is the ''International Tables for Crystallography'' . History Space groups in 2 dimensions are the 17 wallpaper groups which have been known for several centuries, though the proof that the list ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
