Reflection groupIn 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.
Complex reflection groupIn mathematics, a complex reflection group is a finite group acting on a finite-dimensional complex vector space that is generated by complex reflections: non-trivial elements that fix a complex hyperplane pointwise. Complex reflection groups arise in the study of the invariant theory of polynomial rings. In the mid-20th century, they were completely classified in work of Shephard and Todd. Special cases include the symmetric group of permutations, the dihedral groups, and more generally all finite real reflection groups (the Coxeter groups or Weyl groups, including the symmetry groups of regular polyhedra).
Distance-regular graphIn the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k, and the distance between v and w. Some authors exclude the complete graphs and disconnected graphs from this definition. Every distance-transitive graph is distance-regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group.
Weyl equationIn physics, particularly in quantum field theory, the Weyl equation is a relativistic wave equation for describing massless spin-1/2 particles called Weyl fermions. The equation is named after Hermann Weyl. The Weyl fermions are one of the three possible types of elementary fermions, the other two being the Dirac and the Majorana fermions. None of the elementary particles in the Standard Model are Weyl fermions. Previous to the confirmation of the neutrino oscillations, it was considered possible that the neutrino might be a Weyl fermion (it is now expected to be either a Dirac or a Majorana fermion).
Weyl semimetalWeyl fermions are massless chiral fermions embodying the mathematical concept of a Weyl spinor. Weyl spinors in turn play an important role in quantum field theory and the Standard Model, where they are a building block for fermions in quantum field theory. Weyl spinors are a solution to the Dirac equation derived by Hermann Weyl, called the Weyl equation. For example, one-half of a charged Dirac fermion of a definite chirality is a Weyl fermion. Weyl fermions may be realized as emergent quasiparticles in a low-energy condensed matter system.
Lattice (order)A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection.
Lattice (group)In geometry and group theory, a lattice in the real coordinate space 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.
RotationRotation or rotational motion is the circular movement of an object around a central line, known as 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 orientations), in contrast to rotation around a axis.
RNA polymerase IIIIn eukaryote cells, RNA polymerase III (also called Pol III) is a protein that transcribes DNA to synthesize 5S ribosomal RNA, tRNA and other small RNAs. The genes transcribed by RNA Pol III fall in the category of "housekeeping" genes whose expression is required in all cell types and most environmental conditions. Therefore, the regulation of Pol III transcription is primarily tied to the regulation of cell growth and the cell cycle, and thus requires fewer regulatory proteins than RNA polymerase II.
Rotation formalisms in three dimensionsIn geometry, various formalisms exist to express a rotation in three dimensions as a mathematical transformation. In physics, this concept is applied to classical mechanics where rotational (or angular) kinematics is the science of quantitative description of a purely rotational motion. The orientation of an object at a given instant is described with the same tools, as it is defined as an imaginary rotation from a reference placement in space, rather than an actually observed rotation from a previous placement in space.
Crystallographic point groupIn crystallography, a crystallographic point group is a set of symmetry operations, corresponding to one of the point groups in three dimensions, such that each operation (perhaps followed by a translation) would leave the structure of a crystal unchanged i.e. the same kinds of atoms would be placed in similar positions as before the transformation.
Complete latticeIn mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.
