|
Reflection Groups
In group theory and geometry, a reflection group is a discrete group which is generated by a set of reflections of a finite-dimensional Euclidean space. The symmetry group of a regular polytope or of a tiling of the Euclidean space by congruent copies of a regular polytope is necessarily a reflection group. Reflection groups also include Weyl groups and crystallographic Coxeter groups. While the orthogonal group is generated by reflections (by the Cartan–Dieudonné theorem), it is a continuous group (indeed, Lie group), not a discrete group, and is generally considered separately. Definition Let ''E'' be a finite-dimensional Euclidean space. A finite reflection group is a subgroup of the general linear group of ''E'' which is generated by a set of orthogonal reflections across hyperplanes passing through the origin. An affine reflection group is a discrete subgroup of the affine group of ''E'' that is generated by a set of ''affine reflections'' of ''E'' (without the requir ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also cen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Group
In mathematics, a dihedral group is the group (mathematics), group of symmetry, symmetries of a regular polygon, which includes rotational symmetry, rotations and reflection symmetry, reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the n-gon, -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition The word "dihedral" comes from "di-" and "-hedron". The latter comes from the Greek word hédra, which means "face of a geometrical solid". Overall it thus refers to the two faces of a polygon. Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetry, rotational symmetries and n reflection symmetry, reflection symmetries. Usually, we take n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isometry Group
In mathematics, the isometry group of a metric space is the set of all bijective isometries (that is, bijective, distance-preserving maps) from the metric space onto itself, with the function composition as group operation. Its identity element is the identity function. The elements of the isometry group are sometimes called motions of the space. Every isometry group of a metric space is a subgroup of isometries. It represents in most cases a possible set of symmetries of objects/figures in the space, or functions defined on the space. See symmetry group. A discrete isometry group is an isometry group such that for every point of the space the set of images of the point under the isometries is a discrete set. In pseudo-Euclidean space the metric is replaced with an isotropic quadratic form; transformations preserving this form are sometimes called "isometries", and the collection of them is then said to form an isometry group of the pseudo-Euclidean space. Examples * The is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shear Mapping
In plane geometry, a shear mapping is an affine transformation that displaces each point in a fixed direction by an amount proportional to its signed distance function, signed distance from a given straight line, line parallel (geometry), parallel to that direction. This type of mapping is also called shear transformation, transvection, or just shearing. The transformations can be applied with a shear matrix or transvection, an elementary matrix that represents the Elementary row operations#Row-addition transformations, addition of a multiple of one row or column to another. Such a matrix (mathematics), matrix may be derived by taking the identity matrix and replacing one of the zero elements with a non-zero value. An example is the linear map that takes any point with Cartesian coordinates, coordinates (x,y) to the point (x + 2y,y). In this case, the displacement is horizontal by a factor of 2 where the fixed line is the -axis, and the signed distance is the -coordinate. Not ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rotation
Rotation or rotational/rotary motion is the circular movement of an object around a central line, known as an ''axis of rotation''. A plane figure can rotate in either a clockwise or counterclockwise sense around a perpendicular axis intersecting anywhere inside or outside the figure at a ''center of rotation''. A solid figure has an infinite number of possible axes and angles of rotation, including chaotic rotation (between arbitrary orientation (geometry), orientations), in contrast to rotation around a fixed axis, rotation around a axis. The special case of a rotation with an internal axis passing through the body's own center of mass is known as a spin (or ''autorotation''). In that case, the surface intersection of the internal ''spin axis'' can be called a ''pole''; for example, Earth's rotation defines the geographical poles. A rotation around an axis completely external to the moving body is called a revolution (or ''orbit''), e.g. Earth's orbit around the Sun. The en ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fundamental Domain
Given a topological space and a group acting on it, the images of a single point under the group action form an orbit of the action. A fundamental domain or fundamental region is a subset of the space which contains exactly one point from each of these orbits. It serves as a geometric realization for the abstract set of representatives of the orbits. There are many ways to choose a fundamental domain. Typically, a fundamental domain is required to be a connected subset with some restrictions on its boundary, for example, smooth or polyhedral. The images of a chosen fundamental domain under the group action then tile the space. One general construction of fundamental domains uses Voronoi cells. Hints at a general definition Given an action of a group ''G'' on a topological space ''X'' by homeomorphisms, a fundamental domain for this action is a set ''D'' of representatives for the orbits. It is usually required to be a reasonably nice set topologically, in one of several ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Presentation
In mathematics, a presentation is one method of specifying a group. A presentation of a group ''G'' comprises a set ''S'' of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set ''R'' of relations among those generators. We then say ''G'' has presentation :\langle S \mid R\rangle. Informally, ''G'' has the above presentation if it is the "freest group" generated by ''S'' subject only to the relations ''R''. Formally, the group ''G'' is said to have the above presentation if it is isomorphic to the quotient of a free group on ''S'' by the normal subgroup generated by the relations ''R''. As a simple example, the cyclic group of order ''n'' has the presentation :\langle a \mid a^n = 1\rangle, where 1 is the group identity. This may be written equivalently as :\langle a \mid a^n\rangle, thanks to the convention that terms that do not include an equals sign are taken to be equal to the group identity. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ADE Classification
In mathematics, the ADE classification (originally ''A-D-E'' classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in . The complete list of simply laced Dynkin diagrams comprises :A_n, \, D_n, \, E_6, \, E_7, \, E_8. Here "simply laced" means that there are no multiple edges, which corresponds to all simple roots in the root system forming angles of \pi/2 = 90^\circ (no edge between the vertices) or 2\pi/3 = 120^\circ (single edge between the vertices). These are two of the four families of Dynkin diagrams (omitting B_n and C_n), and three of the five exceptional Dynkin diagrams (omitting F_4 and G_2). This list is non-redundant if one takes n \geq 4 for D_n. If one extends the families to include redundant terms, one obtains the exceptional isomorphisms :D_3 \cong A_3, E_4 \cong A_4, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
