Concept

Complex reflection group

In 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). A (complex) reflection r (sometimes also called pseudo reflection or unitary reflection) of a finite-dimensional complex vector space V is an element of finite order that fixes a complex hyperplane pointwise, that is, the fixed-space has codimension 1. A (finite) complex reflection group is a finite subgroup of that is generated by reflections. Any real reflection group becomes a complex reflection group if we extend the scalars from R to C. In particular, all finite Coxeter groups or Weyl groups give examples of complex reflection groups. A complex reflection group W is irreducible if the only W-invariant proper subspace of the corresponding vector space is the origin. In this case, the dimension of the vector space is called the rank of W. The Coxeter number of an irreducible complex reflection group W of rank is defined as where denotes the set of reflections and denotes the set of reflecting hyperplanes. In the case of real reflection groups, this definition reduces to the usual definition of the Coxeter number for finite Coxeter systems. Any complex reflection group is a product of irreducible complex reflection groups, acting on the sum of the corresponding vector spaces. So it is sufficient to classify the irreducible complex reflection groups. The irreducible complex reflection groups were classified by .

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (7)
Related concepts (7)
Coxeter notation
In geometry, Coxeter notation (also Coxeter symbol) is a system of classifying symmetry groups, describing the angles between fundamental reflections of a Coxeter group in a bracketed notation expressing the structure of a Coxeter-Dynkin diagram, with modifiers to indicate certain subgroups. The notation is named after H. S. M. Coxeter, and has been more comprehensively defined by Norman Johnson. For Coxeter groups, defined by pure reflections, there is a direct correspondence between the bracket notation and Coxeter-Dynkin diagram.
1 22 polytope
DISPLAYTITLE:1 22 polytope In 6-dimensional geometry, the 122 polytope is a uniform polytope, constructed from the E6 group. It was first published in E. L. Elte's 1912 listing of semiregular polytopes, named as V72 (for its 72 vertices). Its Coxeter symbol is 122, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 1-node sequence. There are two rectifications of the 122, constructed by positions points on the elements of 122. The rectified 122 is constructed by points at the mid-edges of the 122.
4 21 polytope
DISPLAYTITLE:4 21 polytope In 8-dimensional geometry, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 8-ic semi-regular figure. Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 4-node sequences, . The rectified 421 is constructed by points at the mid-edges of the 421. The birectified 421 is constructed by points at the triangle face centers of the 421.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.