# Category: Coxeter groups

Affine symmetric group
The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensiona
Coxeter complex
In mathematics, the Coxeter complex, named after H. S. M. Coxeter, is a geometrical structure (a simplicial complex) associated to a Coxeter group. Coxeter complexes are the basic objects that allow t
H4 (mathematics)
No description available.
Reflection group
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
Coxeter matroid
In mathematics, Coxeter matroids are generalization of matroids depending on a choice of a Coxeter group W and a parabolic subgroup P. Ordinary matroids correspond to the case when P is a maximal para
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 grou
Longest element of a Coxeter group
In mathematics, the longest element of a Coxeter group is the unique element of maximal length in a finite Coxeter group with respect to the chosen generating set consisting of simple reflections. It
Triangle group
In mathematics, a triangle group is a group that can be realized geometrically by sequences of reflections across the sides of a triangle. The triangle can be an ordinary Euclidean triangle, a triangl
Bruhat order
In mathematics, the Bruhat order (also called strong order or strong Bruhat order or Chevalley order or Bruhat–Chevalley order or Chevalley–Bruhat order) is a partial order on the elements of a Coxete
Antiprism
In geometry, an n-gonal antiprism or n-antiprism is a polyhedron composed of two parallel direct copies (not mirror images) of an n-sided polygon, connected by an alternating band of 2n triangles. The
Coxeter–Dynkin diagram
In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing the spatial relations between a collection of mirrors
Coxeter element
In mathematics, the Coxeter number h is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter.