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 (or reflecting hyperplanes). It describes a kaleidoscopic construction: each graph "node" represents a mirror (domain facet) and the label attached to a branch encodes the dihedral angle order between two mirrors (on a domain ridge), that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees. An unlabeled branch implicitly represents order-3 (60 degrees), and each pair of nodes that is not connected by a branch at all (such as non-adjacent nodes) represents a pair of mirrors at order-2 (90 degrees). Each diagram represents a Coxeter group, and Coxeter groups are classified by their associated diagrams. Dynkin diagrams are closely related objects, which differ from Coxeter diagrams in two respects: firstly, branches labeled "4" or greater are directed, while Coxeter diagrams are undirected; secondly, Dynkin diagrams must satisfy an additional (crystallographic) restriction, namely that the only allowed branch labels are 2, 3, 4, and 6. Dynkin diagrams correspond to and are used to classify root systems and therefore semisimple Lie algebras. Branches of a Coxeter–Dynkin diagram are labeled with a rational number p, representing a dihedral angle of 180°/p. When p = 2 the angle is 90° and the mirrors have no interaction, so the branch can be omitted from the diagram. If a branch is unlabeled, it is assumed to have p = 3, representing an angle of 60°. Two parallel mirrors have a branch marked with "∞". In principle, n mirrors can be represented by a complete graph in which all n(n − 1) / 2 branches are drawn. In practice, nearly all interesting configurations of mirrors include a number of right angles, so the corresponding branches are omitted. Diagrams can be labeled by their graph structure. The first forms studied by Ludwig Schläfli are the orthoschemes which have linear graphs that generate regular polytopes and regular honeycombs.

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 concepts (100)

Related courses (5)

Related lectures (50)

MATH-335: Coxeter groups

Study groups generated by reflections

MATH-111(e): Linear Algebra

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.

MATH-212: Analyse numérique et optimisation

L'étudiant apprendra à résoudre numériquement divers problèmes mathématiques. Les propriétés théoriques de ces méthodes seront discutées.

Wythoff construction

In geometry, a Wythoff construction, named after mathematician Willem Abraham Wythoff, is a method for constructing a uniform polyhedron or plane tiling. It is often referred to as Wythoff's kaleidoscopic construction. The method is based on the idea of tiling a sphere, with spherical triangles – see Schwarz triangles. This construction arranges three mirrors at the sides of a triangle, like in a kaleidoscope. However, different from a kaleidoscope, the mirrors are not parallel, but intersect at a single point.

Wythoff symbol

In geometry, the Wythoff symbol is a notation representing a Wythoff construction of a uniform polyhedron or plane tiling within a Schwarz triangle. It was first used by Coxeter, Longuet-Higgins and Miller in their enumeration of the uniform polyhedra. Later the Coxeter diagram was developed to mark uniform polytopes and honeycombs in n-dimensional space within a fundamental simplex. A Wythoff symbol consists of three numbers and a vertical bar.

Coxeter–Dynkin diagram

Elastic Membrane Boundary Problem 2D MATH-212: Analyse numérique et optimisation

Covers the elastic membrane boundary problem in 2D, exploring mathematical formulation and solution methods.

Coxeter Groups: Simple Reflections and Conjugacy MATH-335: Coxeter groups

Explores the theorem that an element sending all simple roots to simple roots is the identity in Coxeter groups.

McKay Graphs of Finite Subgroups of SU(2)MATH-335: Coxeter groups

Explores McKay graphs for finite subgroups of SU(2) and the corresponding Coxeter graphs.