Utente:Grasso Luigi/sandbox4/Diagramma di Coxeter-Dynkin

Coxeter–Dynkin diagrams for the fundamental finite Coxeter groups

Coxeter–Dynkin diagrams for the fundamental affine Coxeter groups

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.

Descrizione

Branches of a Coxeter–Dynkin diagram are labeled with a rational number p, representing a dihedral angle of 180°/p. When Template:Math 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 Template:Math, 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(Template:Math 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. Plagioschemes are simplices represented by branching graphs, and cycloschemes are simplices represented by cyclic graphs.

Matrice di Schläfli

Every Coxeter diagram has a corresponding Schläfli matrix (so named after Ludwig Schläfli), with matrix elements Template:Math where p is the branch order between the pairs of mirrors. As a matrix of cosines, it is also called a Gramian matrix after Jørgen Pedersen Gram. All Coxeter group Schläfli matrices are symmetric because their root vectors are normalized. It is related closely to the Cartan matrix, used in the similar but directed graph Dynkin diagrams in the limited cases of p = 2,3,4, and 6, which are not symmetric in general.

The determinant of the Schläfli matrix, called the Schläflian, and its sign determines whether the group is finite (positive), affine (zero), indefinite (negative). This rule is called Schläfli's Criterion.Template:Failed verification

The eigenvalues of the Schläfli matrix determines whether a Coxeter group is of finite type (all positive), affine type (all non-negative, at least one is zero), or indefinite type (otherwise). The indefinite type is sometimes further subdivided, e.g. into hyperbolic and other Coxeter groups. However, there are multiple non-equivalent definitions for hyperbolic Coxeter groups. We use the following definition: A Coxeter group with connected diagram is hyperbolic if it is neither of finite nor affine type, but every proper connected subdiagram is of finite or affine type. A hyperbolic Coxeter group is compact if all subgroups are finite (i.e. have positive determinants), and paracompact if all its subgroups are finite or affine (i.e. have nonnegative determinants).

Finite and affine groups are also called elliptical and parabolic respectively. Hyperbolic groups are also called Lannér, after F. Lannér who enumerated the compact hyperbolic groups in 1950, and Koszul (or quasi-Lannér) for the paracompact groups.

Rango 2

For rank 2, the type of a Coxeter group is fully determined by the determinant of the Schläfli matrix, as it is simply the product of the eigenvalues: Finite type (positive determinant), affine type (zero determinant) or hyperbolic (negative determinant). Coxeter uses an equivalent bracket notation which lists sequences of branch orders as a substitute for the node-branch graphic diagrams. Rational solutions [p/q], Template:CDD, also exist, with gcd(p,q)=1, which define overlapping fundamental domains. For example, 3/2, 4/3, 5/2, 5/3, 5/4, and 6/5.

Type	Finite					Affine	Hyperbolic
Geometry					...
Coxeter	Template:CDD [ ]	Template:CDD [2]	Template:CDD [3]	Template:CDD [4]	Template:CDD [p]	Template:CDD [∞]	Template:CDD [∞]	Template:CDD [iπ/λ]
Order	2	4	6	8	2p	∞
Mirror lines are colored to correspond to Coxeter diagram nodes. Fundamental domains are alternately colored.

Rank 2 Coxeter group diagrams
Order p	Group	Coxeter diagram		Schläfli matrix
				$\left[{\begin{matrix}2&a_{12}\\a_{21}&2\end{matrix}}\right]$	Determinant (4-a21*a12)
Finite (Determinant>0)
2	I2(2) = A1xA1	Template:CDD	[2]	$\left[{\begin{smallmatrix}2&0\\0&2\end{smallmatrix}}\right]$	4
3	I2(3) = A2	Template:CDD	[3]	$\left[{\begin{smallmatrix}2&-1\\-1&2\end{smallmatrix}}\right]$	3
3/2		Template:CDD	[3/2]	$\left[{\begin{smallmatrix}2&1\\1&2\end{smallmatrix}}\right]$
4	I2(4) = B2	Template:CDD	[4]	$\left[{\begin{smallmatrix}2&-{\sqrt {2}}\\-{\sqrt {2}}&2\end{smallmatrix}}\right]$	2
4/3		Template:CDD	[4/3]	$\left[{\begin{smallmatrix}2&{\sqrt {2}}\\{\sqrt {2}}&2\end{smallmatrix}}\right]$
5	I2(5) = H2	Template:CDD	[5]	$\left[{\begin{smallmatrix}2&-\phi \\-\phi &2\end{smallmatrix}}\right]$	$(5-{\sqrt {5}})/2$ ~1.38196601125
5/4		Template:CDD	[5/4]	$\left[{\begin{smallmatrix}2&\phi \\\phi &2\end{smallmatrix}}\right]$
5/2		Template:CDD	[5/2]	$\left[{\begin{smallmatrix}2&1-\phi \\1-\phi &2\end{smallmatrix}}\right]$	$(5+{\sqrt {5}})/2$ ~3.61803398875
5/3		Template:CDD	[5/3]	$\left[{\begin{smallmatrix}2&\phi -1\\\phi -1&2\end{smallmatrix}}\right]$
6	I2(6) = G2	Template:CDD	[6]	$\left[{\begin{smallmatrix}2&-{\sqrt {3}}\\-{\sqrt {3}}&2\end{smallmatrix}}\right]$	1
6/5		Template:CDD	[6/5]	$\left[{\begin{smallmatrix}2&{\sqrt {3}}\\{\sqrt {3}}&2\end{smallmatrix}}\right]$
8	I2(8)	Template:CDD	[8]	$\left[{\begin{smallmatrix}2&-{\sqrt {2+{\sqrt {2}}}}\\-{\sqrt {2+{\sqrt {2}}}}&2\end{smallmatrix}}\right]$	$2-{\sqrt {2}}$ ~0.58578643763
10	I2(10)	Template:CDD	[10]	$\left[{\begin{smallmatrix}2&-{\sqrt {(5+{\sqrt {5}})/2}}\\-{\sqrt {(5+{\sqrt {5}})/2}}&2\end{smallmatrix}}\right]$	$(3-{\sqrt {5}})/2$ ~0.38196601125
12	I2(12)	Template:CDD	[12]	$\left[{\begin{smallmatrix}2&-{\sqrt {2+{\sqrt {3}}}}\\-{\sqrt {2+{\sqrt {3}}}}&2\end{smallmatrix}}\right]$	$2-{\sqrt {3}}$ ~0.26794919243
p	I2(p)	Template:CDD	[p]	$\left[{\begin{smallmatrix}2&-2\cos(\pi /p)\\-2\cos(\pi /p)&2\end{smallmatrix}}\right]$	$4\sin ^{2}(\pi /p)$
Affine (Determinant=0)
∞	I2(∞) = ${\tilde {I}}_{1}$ = ${\tilde {A}}_{1}$	Template:CDD	[∞]	$\left[{\begin{smallmatrix}2&-2\\-2&2\end{smallmatrix}}\right]$	0
Hyperbolic (Determinant≤0)
∞		Template:CDD	[∞]	$\left[{\begin{smallmatrix}2&-2\\-2&2\end{smallmatrix}}\right]$	0
∞		Template:CDD	[iπ/λ]	$\left[{\begin{smallmatrix}2&-2\cosh(2\lambda )\\-2\cosh(2\lambda )&2\end{smallmatrix}}\right]$	$-4\sinh ^{2}(2\lambda )\leq 0$

Geometric visualizations

The Coxeter–Dynkin diagram can be seen as a graphic description of the fundamental domain of mirrors. A mirror represents a hyperplane within a given dimensional spherical or Euclidean or hyperbolic space. (In 2D spaces, a mirror is a line, and in 3D a mirror is a plane).

These visualizations show the fundamental domains for 2D and 3D Euclidean groups, and 2D spherical groups. For each the Coxeter diagram can be deduced by identifying the hyperplane mirrors and labelling their connectivity, ignoring 90-degree dihedral angles (order 2).

Coxeter groups in the Euclidean plane with equivalent diagrams. Reflections are labeled as graph nodes R1, R2, etc. and are colored by their reflection order. Reflections at 90 degrees are inactive and therefore suppressed from the diagram. Parallel mirrors are connected by an ∞ labeled branch. The prismatic group ${\tilde {I}}_{1}$x${\tilde {I}}_{1}$ is shown as a doubling of the ${\tilde {C}}_{2}$, but can also be created as rectangular domains from doubling the ${\tilde {G}}_{2}$ triangles. The ${\tilde {A}}_{2}$ is a doubling of the ${\tilde {G}}_{2}$ triangle.
Many Coxeter groups in the hyperbolic plane can be extended from the Euclidean cases as a series of hyperbolic solutions.
Coxeter groups in 3-space with diagrams. Mirrors (triangle faces) are labeled by opposite vertex 0..3. Branches are colored by their reflection order. ${\tilde {C}}_{3}$ fills 1/48 of the cube. ${\tilde {B}}_{3}$ fills 1/24 of the cube. ${\tilde {A}}_{3}$ fills 1/12 of the cube.	Coxeter groups in the sphere with equivalent diagrams. One fundamental domain is outlined in yellow. Domain vertices (and graph branches) are colored by their reflection order.

Gruppi di Coxeter finiti

See also polytope families for a table of end-node uniform polytopes associated with these groups.

• Three different symbols are given for the same groups – as a letter/number, as a bracketed set of numbers, and as the Coxeter diagram.
• The bifurcated D_n group is a half or alternated version of the C_n group.
• The bifurcated D_n and E_n groups are also labeled by a superscript form [3^a,b,c] where a,b,c are the numbers of segments in each of the three branches.

Connected finite Coxeter–Dynkin diagrams (ranks 1 to 9)

Rank	Simple Lie groups			Exceptional Lie groups
	${A}_{1+}$	${B}_{2+}$	${D}_{2+}$	${E}_{3-8}$	${F}_{3-4}$	${G}_{2}$	${H}_{2-4}$	${I}_{2}(p)$
1	A1 = [ ]
2	A2 = [3]	B2 = [4]	D2 = A1A1			G2 = [6]	H2 = [5]	I2[p]
3	A3 = [32]	B3 = [3,4]	D3 = A3	E3 = A2A1	F3 = B3		H3
4	A4 = [33]	B4 = [32,4]	D4 = [31,1,1]	E4 = A4	F4		H4
5	A5 = [34]	B5 = [33,4]	D5 = [32,1,1]	E5 = D5
6	A6=[35] Template:CDD	B6=[34,4] Template:CDD	D6=[33,1,1] Template:CDD	E6 = [32,2,1] Template:CDD
7	A7 = [36] Template:CDD	B7 = [35,4] Template:CDD	D7 = [34,1,1] Template:CDD	E7 = [33,2,1] Template:CDD
8	A8 = [37] Template:CDD	B8 = [36,4] Template:CDD	D8 = [35,1,1] Template:CDD	E8 = [34,2,1] Template:CDD
9	A9 = [38] Template:CDD	B9 = [37,4] Template:CDD	D9 = [36,1,1] Template:CDD
10+	..	..	..	..

Applicazione con politopi uniformi

In constructing uniform polytopes, nodes are marked as active by a ring if a generator point is off the mirror, creating a new edge between a generator point and its mirror image. An unringed node represents an inactive mirror that generates no new points. A ring with no node is called a hole.

Two orthogonal mirrors can be used to generate a square, Template:CDD, seen here with a red generator point and 3 virtual copies across the mirrors. The generator has to be off both mirrors in this orthogonal case to generate an interior. The ring markup presumes active rings have generators equal distance from all mirrors, while a rectangle can also represent a nonuniform solution.

Coxeter–Dynkin diagrams can explicitly enumerate nearly all classes of uniform polytope and uniform tessellations. Every uniform polytope with pure reflective symmetry (all but a few special cases have pure reflectional symmetry) can be represented by a Coxeter–Dynkin diagram with permutations of markups. Each uniform polytope can be generated using such mirrors and a single generator point: mirror images create new points as reflections, then polytope edges can be defined between points and a mirror image point. Faces are generated by the repeated reflection of an edge eventually wrapping around to the original generator; the final shape, as well as any higher-dimensional facets, are likewise created by the face being reflected to enclose an area.

To specify the generating vertex, one or more nodes are marked with rings, meaning that the vertex is not on the mirror(s) represented by the ringed node(s). (If two or more mirrors are marked, the vertex is equidistant from them.) A mirror is active (creates reflections) only with respect to points not on it. A diagram needs at least one active node to represent a polytope. An unconnected diagram (subgroups separated by order-2 branches, or orthogonal mirrors) requires at least one active node in each subgraph.

All regular polytopes, represented by Schläfli symbol {Template:Math}, can have their fundamental domains represented by a set of n mirrors with a related Coxeter–Dynkin diagram of a line of nodes and branches labeled by Template:Math with the first node ringed.

Uniform polytopes with one ring correspond to generator points at the corners of the fundamental domain simplex. Two rings correspond to the edges of simplex and have a degree of freedom, with only the midpoint as the uniform solution for equal edge lengths. In general k-ring generator points are on (k-1)-faces of the simplex, and if all the nodes are ringed, the generator point is in the interior of the simplex.

The special case of uniform polytopes with non-reflectional symmetry is represented by a secondary markup where the central dot of a ringed node is removed (called a hole). These shapes are alternations of polytopes with reflective symmetry, implying that every other vertex is deleted. The resulting polytope will have a subsymmetry of the original Coxeter group. A truncated alternation is called a snub.

• A single node represents a single mirror. This is called group A₁. If ringed this creates a line segment perpendicular to the mirror, represented as {}.
• Two unattached nodes represent two perpendicular mirrors. If both nodes are ringed, a rectangle can be created, or a square if the point is at equal distance from both mirrors.
• Two nodes attached by an order-n branch can create an n-gon if the point is on one mirror, and a 2n-gon if the point is off both mirrors. This forms the I₁(n) group.
• Two parallel mirrors can represent an infinite polygon I₁(∞) group, also called Ĩ₁.
• Three mirrors in a triangle form images seen in a traditional kaleidoscope and can be represented by three nodes connected in a triangle. Repeating examples will have branches labeled as (3 3 3), (2 4 4), (2 3 6), although the last two can be drawn as a line (with the 2 branches ignored). These will generate uniform tilings.
• Three mirrors can generate uniform polyhedra; including rational numbers gives the set of Schwarz triangles.
• Three mirrors with one perpendicular to the other two can form the uniform prisms.

There are 7 reflective uniform constructions within a general triangle, based on 7 topological generator positions within the fundamental domain. Every active mirror generates an edge, with two active mirrors have generators on the domain sides and three active mirrors has the generator in the interior. One or two degrees of freedom can be solved for a unique position for equal edge lengths of the resulting polyhedron or tiling.

Example 7 generators on octahedral symmetry, fundamental domain triangle (4 3 2), with 8th snub generation as an alternation

The duals of the uniform polytopes are sometimes marked up with a perpendicular slash replacing ringed nodes, and a slash-hole for hole nodes of the snubs. For example, Template:CDD represents a rectangle (as two active orthogonal mirrors), and Template:CDD represents its dual polygon, the rhombus.

Example polyhedra and tilings

For example, the B₃ Coxeter group has a diagram: Template:CDD. This is also called octahedral symmetry.

There are 7 convex uniform polyhedra that can be constructed from this symmetry group and 3 from its alternation subsymmetries, each with a uniquely marked up Coxeter–Dynkin diagram. The Wythoff symbol represents a special case of the Coxeter diagram for rank 3 graphs, with all 3 branch orders named, rather than suppressing the order 2 branches. The Wythoff symbol is able to handle the snub form, but not general alternations without all nodes ringed. Template:Octahedral truncations

The same constructions can be made on disjointed (orthogonal) Coxeter groups like the uniform prisms, and can be seen more clearly as tilings of dihedrons and hosohedra on the sphere, like this [6]×[] or [6,2] family: Template:Hexagonal dihedral truncations

In comparison, the [6,3], Template:CDD family produces a parallel set of 7 uniform tilings of the Euclidean plane, and their dual tilings. There are again 3 alternations and some half symmetry version. Template:Hexagonal tiling table

In the hyperbolic plane [7,3], Template:CDD family produces a parallel set of uniform tilings, and their dual tilings. There is only 1 alternation (snub) since all branch orders are odd. Many other hyperbolic families of uniform tilings can be seen at uniform tilings in hyperbolic plane.

Gruppi Coxeter affini

Families of convex uniform Euclidean tessellations are defined by the affine Coxeter groups. These groups are identical to the finite groups with the inclusion of one added node. In letter names they are given the same letter with a "~" above the letter. The index refers to the finite group, so the rank is the index plus 1. (Ernst Witt symbols for the affine groups are given as also)

1. ${\tilde {A}}_{n-1}$: diagrams of this type are cycles. (Also P_n)
2. ${\tilde {C}}_{n-1}$ is associated with the hypercube regular tessellation {Template:Math} family. (Also R_n)
3. ${\tilde {B}}_{n-1}$ related to C by one removed mirror. (Also S_n)
4. ${\tilde {D}}_{n-1}$ related to C by two removed mirrors. (Also Q_n)
5. ${\tilde {E}}_{6}$, ${\tilde {E}}_{7}$, ${\tilde {E}}_{8}$. (Also T₇, T₈, T₉)
6. ${\tilde {F}}_{4}$ forms the {3,4,3,3} regular tessellation. (Also U₅)
7. ${\tilde {G}}_{2}$ forms 30-60-90 triangle fundamental domains. (Also V₃)
8. ${\tilde {I}}_{1}$ is two parallel mirrors. (${}={\tilde {A}}_{1}={\tilde {C}}_{1}$) (Also W₂)

Composite groups can also be defined as orthogonal projects. The most common use ${\tilde {A}}_{1}$, like ${\tilde {A}}_{1}^{2}$, Template:CDD represents square or rectangular checker board domains in the Euclidean plane. And ${\tilde {A}}_{1}{\tilde {G}}_{2}$ Template:CDD represents triangular prism fundamental domains in Euclidean 3-space.

Affine Coxeter graphs up to (2 to 10 nodes)

Rank	${\tilde {A}}_{1+}$ (P2+)	${\tilde {B}}_{3+}$ (S4+)	${\tilde {C}}_{1+}$ (R2+)	${\tilde {D}}_{4+}$ (Q5+)	${\tilde {E}}_{n}(T_{n+1})/{\tilde {F}}_{4}(U_{5})/{\tilde {G}}_{2}\,(V_{3})$
2	${\tilde {A}}_{1}$=[∞] Template:CDD		${\tilde {C}}_{1}$=[∞] Template:CDD
3	${\tilde {A}}_{2}$=[3[3]] * Template:CDD		${\tilde {C}}_{2}$=[4,4] * Template:CDD		${\tilde {G}}_{2}$=[6,3] * Template:CDD
4	${\tilde {A}}_{3}$=[3[4]] * Template:CDD	${\tilde {B}}_{3}$=[4,31,1] * Template:CDD	${\tilde {C}}_{3}$=[4,3,4] * Template:CDD	${\tilde {D}}_{3}$=[31,1,3−1,31,1] Template:CDD = ${\tilde {A}}_{3}$
5	${\tilde {A}}_{4}$=[3[5]] * Template:CDD	${\tilde {B}}_{4}$=[4,3,31,1] * Template:CDD	${\tilde {C}}_{4}$=[4,32,4] * Template:CDD	${\tilde {D}}_{4}$=[31,1,1,1] * Template:CDD	${\tilde {F}}_{4}$=[3,4,3,3] * Template:CDD
6	${\tilde {A}}_{5}$=[3[6]] * Template:CDD	${\tilde {B}}_{5}$=[4,32,31,1] * Template:CDD	${\tilde {C}}_{5}$=[4,33,4] * Template:CDD	${\tilde {D}}_{5}$=[31,1,3,31,1] * Template:CDD
7	${\tilde {A}}_{6}$=[3[7]] * Template:CDD	${\tilde {B}}_{6}$=[4,33,31,1] Template:CDD	${\tilde {C}}_{6}$=[4,34,4] Template:CDD	${\tilde {D}}_{6}$=[31,1,32,31,1] Template:CDD	${\tilde {E}}_{6}$=[32,2,2] Template:CDD
8	${\tilde {A}}_{7}$=[3[8]] * Template:CDD	${\tilde {B}}_{7}$=[4,34,31,1] * Template:CDD	${\tilde {C}}_{7}$=[4,35,4] Template:CDD	${\tilde {D}}_{7}$=[31,1,33,31,1] * Template:CDD	${\tilde {E}}_{7}$=[33,3,1] * Template:CDD
9	${\tilde {A}}_{8}$=[3[9]] * Template:CDD	${\tilde {B}}_{8}$=[4,35,31,1] Template:CDD	${\tilde {C}}_{8}$=[4,36,4] Template:CDD	${\tilde {D}}_{8}$=[31,1,34,31,1] Template:CDD	${\tilde {E}}_{8}$=[35,2,1] * Template:CDD
10	${\tilde {A}}_{9}$=[3[10]] * Template:CDD	${\tilde {B}}_{9}$=[4,36,31,1] Template:CDD	${\tilde {C}}_{9}$=[4,37,4] Template:CDD	${\tilde {D}}_{9}$=[31,1,35,31,1] Template:CDD
11	...	...	...	...

Gruppi Coxeter iperbolici

There are many infinite hyperbolic Coxeter groups. Hyperbolic groups are categorized as compact or not, with compact groups having bounded fundamental domains. Compact simplex hyperbolic groups (Lannér simplices) exist as rank 3 to 5. Paracompact simplex groups (Koszul simplices) exist up to rank 10. Hypercompact (Vinberg polytopes) groups have been explored but not been fully determined. In 2006, Allcock proved that there are infinitely many compact Vinberg polytopes for dimension up to 6, and infinitely many finite-volume Vinberg polytopes for dimension up to 19, so a complete enumeration is not possible. All of these fundamental reflective domains, both simplices and non-simplices, are often called Coxeter polytopes or sometimes less accurately Coxeter polyhedra.

Hyperbolic groups in H²

Poincaré disk model of fundamental domain triangles

Example right triangles [p,q]
[3,7]	[3,8]	[3,9]	[3,∞]
[4,5]	[4,6]	[4,7]	[4,8]	[∞,4]
[5,5]	[5,6]	[5,7]	[6,6]	[∞,∞]
Example general triangles [(p,q,r)]
[(3,3,4)]	[(3,3,5)]	[(3,3,6)]	[(3,3,7)]	[(3,3,∞)]
[(3,4,4)]	[(3,6,6)]	[(3,∞,∞)]	[(6,6,6)]	[(∞,∞,∞)]

Two-dimensional hyperbolic triangle groups exist as rank 3 Coxeter diagrams, defined by triangle (p q r) for:

${\frac {1}{p}}+{\frac {1}{q}}+{\frac {1}{r}}<1.$

There are infinitely many compact triangular hyperbolic Coxeter groups, including linear and triangle graphs. The linear graphs exist for right triangles (with r = 2).

Compact hyperbolic Coxeter groups

Linear	Cyclic
∞ [p,q], Template:CDD: 2(p+q)<pq Template:CDD Template:CDD Template:CDD ... Template:CDD Template:CDD ... Template:CDD Template:CDD ...	∞ [(p,q,r)], Template:CDD: p+q+r>9 Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD Template:CDD ...

Paracompact Coxeter groups of rank 3 exist as limits to the compact ones.

Linear graphs	Cyclic graphs
[p,∞] Template:CDD [∞,∞] Template:CDD	[(p,q,∞)] Template:CDD [(p,∞,∞)] Template:CDD [(∞,∞,∞)] Template:CDD

Gruppo del triangolo aritmetico

The hyperbolic triangle groups that are also arithmetic groups form a finite subset. By computer search the complete list was determined by Kisao Takeuchi in his 1977 paper Arithmetic triangle groups. There are 85 total, 76 compact and 9 paracompact.

Right triangles (p q 2)	General triangles (p q r)
Compact groups: (76) Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Paracompact right triangles: (4) Template:CDD, Template:CDD, Template:CDD, Template:CDD	General triangles: (39) Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Paracompact general triangles: (5) Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD
(2 3 7), (2 3 8), (2 3 9), (2 3 10), (2 3 11), (2 3 12), (2 3 14), (2 3 16), (2 3 18), (2 3 24), (2 3 30) (2 4 5), (2 4 6), (2 4 7), (2 4 8), (2 4 10), (2 4 12), (2 4 18), (2 5 5), (2 5 6), (2 5 8), (2 5 10), (2 5 20), (2 5 30) (2 6 6), (2 6 8), (2 6 12) (2 7 7), (2 7 14), (2 8 8), (2 8 16), (2 9 18) (2 10 10) (2 12 12) (2 12 24), (2 15 30), (2 18 18) (2 3 ∞) (2,4 ∞) (2,6 ∞) (2 ∞ ∞)	(3 3 4), (3 3 5), (3 3 6), (3 3 7), (3 3 8), (3 3 9), (3 3 12), (3 3 15) (3 4 4), (3 4 6), (3 4 12), (3 5 5), (3 6 6), (3 6 18), (3 8 8), (3 8 24), (3 10 30), (3 12 12) (4 4 4), (4 4 5), (4 4 6), (4 4 9), (4 5 5), (4 6 6), (4 8 8), (4 16 16) (5 5 5), (5 5 10), (5 5 15), (5 10 10) (6 6 6), (6 12 12), (6 24 24) (7 7 7) (8 8 8) (9 9 9) (9 18 18) (12 12 12) (15 15 15) (3,3 ∞) (3 ∞ ∞) (4,4 ∞) (6 6 ∞) (∞ ∞ ∞)

Hyperbolic Coxeter polygons above triangles

Fundamental domains of quadrilateral groups

Template:CDD or Template:CDD [∞,3,∞] [iπ/λ1,3,iπ/λ2] (*3222)	Template:CDD or Template:CDD [((3,∞,3)),∞] [((3,iπ/λ1,3)),iπ/λ2] (*3322)	Template:CDD or Template:CDD [(3,∞)[2]] [(3,iπ/λ1,3,iπ/λ2)] (*3232)	Template:CDD or Template:CDD [(4,∞)[2]] [(4,iπ/λ1,4,iπ/λ2)] (*4242)	Template:CDD (*3333)
Domains with ideal vertices
Template:CDD [iπ/λ1,∞,iπ/λ2] (*∞222)	Template:CDD (*∞∞22)	Template:CDD [(iπ/λ1,∞,iπ/λ2,∞)] (*2∞2∞)	Template:CDD (*∞∞∞∞)	Template:CDD (*4444)

Other H² hyperbolic kaleidoscopes can be constructed from higher order polygons. Like triangle groups these kaleidoscopes can be identified by a cyclic sequence of mirror intersection orders around the fundamental domain, as (a b c d ...), or equivalently in orbifold notation as *abcd.... Coxeter–Dynkin diagrams for these polygonal kaleidoscopes can be seen as a degenerate (n-1)-simplex fundamental domains, with a cyclic of branches order a,b,c... and the remaining n*(n-3)/2 branches are labeled as infinite (∞) representing the non-intersecting mirrors. The only nonhyperbolic example is Euclidean symmetry four mirrors in a square or rectangle as Template:CDD, [∞,2,∞] (orbifold *2222). Another branch representation for non-intersecting mirrors by Vinberg gives infinite branches as dotted or dashed lines, so this diagram can be shown as Template:CDD, with the four order-2 branches suppressed around the perimeter.

For example, a quadrilateral domain (a b c d) will have two infinite order branches connecting ultraparallel mirrors. The smallest hyperbolic example is Template:CDD, [∞,3,∞] or [iπ/λ₁,3,iπ/λ₂] (orbifold *3222), where (λ₁,λ₂) are the distance between the ultraparallel mirrors. The alternate expression is Template:CDD, with three order-2 branches suppressed around the perimeter. Similarly (2 3 2 3) (orbifold *3232) can be represented as Template:CDD and (3 3 3 3), (orbifold *3333) can be represented as a complete graph Template:CDD.

The highest quadrilateral domain (∞ ∞ ∞ ∞) is an infinite square, represented by a complete tetrahedral graph with 4 perimeter branches as ideal vertices and two diagonal branches as infinity (shown as dotted lines) for ultraparallel mirrors: Template:CDD.

Compact (Lannér simplex groups)

Compact hyperbolic groups are called Lannér groups after Folke Lannér who first studied them in 1950. They only exist as rank 4 and 5 graphs. Coxeter studied the linear hyperbolic coxeter groups in his 1954 paper Regular Honeycombs in hyperbolic space, which included two rational solutions in hyperbolic 4-space: [5/2,5,3,3] = Template:CDD and [5,5/2,5,3] = Template:CDD.

Ranghi 4–5

The fundamental domain of either of the two bifurcating groups, [5,3^1,1] and [5,3,3^1,1], is double that of a corresponding linear group, [5,3,4] and [5,3,3,4] respectively. Letter names are given by Johnson as extended Witt symbols.

Compact hyperbolic Coxeter groups

Dimension Hd	Rank	Total count	Linear	Bifurcating	Cyclic
H3	4	9	Template:Center ${\overline {BH}}_{3}$ = [4,3,5]: Template:CDD ${\overline {K}}_{3}$ = [5,3,5]: Template:CDD ${\overline {J}}_{3}$ = [3,5,3]: Template:CDD	${\overline {DH}}_{3}$ = [5,31,1]: Template:CDD	${\widehat {AB}}_{3}$ = [(33,4)]: Template:CDD  ${\widehat {AH}}_{3}$ = [(33,5)]: Template:CDD  ${\widehat {BB}}_{3}$ = [(3,4)[2]]: Template:CDD ${\widehat {BH}}_{3}$ = [(3,4,3,5)]: Template:CDD ${\widehat {HH}}_{3}$ = [(3,5)[2]]: Template:CDD
H4	5	5	Template:Center ${\overline {H}}_{4}$ = [33,5]: Template:CDD ${\overline {BH}}_{4}$ = [4,3,3,5]: Template:CDD ${\overline {K}}_{4}$ = [5,3,3,5]: Template:CDD	${\overline {DH}}_{4}$ = [5,3,31,1]: Template:CDD	${\widehat {AF}}_{4}$ = [(34,4)]: Template:CDD

Paracompact (Koszul simplex groups)

An example order-3 apeirogonal tiling, {∞,3} with one green apeirogon and its circumscribed horocycle

Paracompact (also called noncompact) hyperbolic Coxeter groups contain affine subgroups and have asymptotic simplex fundamental domains. The highest paracompact hyperbolic Coxeter group is rank 10. These groups are named after French mathematician Jean-Louis Koszul. They are also called quasi-Lannér groups extending the compact Lannér groups. The list was determined complete by computer search by M. Chein and published in 1969.

By Vinberg, all but eight of these 72 compact and paracompact simplices are arithmetic. Two of the nonarithmetic groups are compact: Template:CDD and Template:CDD. The other six nonarithmetic groups are all paracompact, with five 3-dimensional groups Template:CDD, Template:CDD, Template:CDD, Template:CDD, and Template:CDD, and one 5-dimensional group Template:CDD.

Ideal simplices

Ideal fundamental domains of Template:CDD, [(∞,∞,∞)] seen in the Poincare disk model

There are 5 hyperbolic Coxeter groups expressing ideal simplices, graphs where removal of any one node results in an affine Coxeter group. Thus all vertices of this ideal simplex are at infinity.

Rank	Ideal group		Affine subgroups
3	[(∞,∞,∞)]	Template:CDD	[∞]	Template:CDD
4	[4[4]]	Template:CDD	[4,4]	Template:CDD
4	[3[3,3]]	Template:CDD	[3[3]]	Template:CDD
4	[(3,6)[2]]	Template:CDD	[3,6]	Template:CDD
6	[(3,3,4)[2]]	Template:CDD	[4,3,3,4], [3,4,3,3]	Template:CDD, Template:CDD

Ranghi 4–10

Infinite Euclidean cells like a hexagonal tiling, properly scaled, converge to a single ideal point at infinity, like the hexagonal tiling honeycomb, {6,3,3}, as shown with this single cell in a Poincaré disk model projection.

There are a total of 58 paracompact hyperbolic Coxeter groups from rank 4 through 10. All 58 are grouped below in five categories. Letter symbols are given by Johnson as Extended Witt symbols, using PQRSTWUV from the affine Witt symbols, and adding LMNOXYZ. These hyperbolic groups are given an overline, or a hat, for cycloschemes. The bracket notation from Coxeter is a linearized representation of the Coxeter group.

Hyperbolic paracompact groups

Rank	Total count	Groups
4	23	${\widehat {BR}}_{3}$ = [(3,3,4,4)]: Template:CDD ${\widehat {CR}}_{3}$ = [(3,43)]: Template:CDD ${\widehat {RR}}_{3}$ = [4[4]]: Template:CDD ${\widehat {AV}}_{3}$ = [(33,6)]: Template:CDD ${\widehat {BV}}_{3}$ = [(3,4,3,6)]: Template:CDD ${\widehat {HV}}_{3}$ = [(3,5,3,6)]: Template:CDD ${\widehat {VV}}_{3}$ = [(3,6)[2]]: Template:CDD	${\overline {P}}_{3}$ = [3,3[3]]: Template:CDD ${\overline {BP}}_{3}$ = [4,3[3]]: Template:CDD ${\overline {HP}}_{3}$ = [5,3[3]]: Template:CDD ${\overline {VP}}_{3}$ = [6,3[3]]: Template:CDD ${\overline {DV}}_{3}$ = [6,31,1]: Template:CDD ${\overline {O}}_{3}$ = [3,41,1]: Template:CDD ${\overline {M}}_{3}$ = [41,1,1]: Template:CDD	${\overline {R}}_{3}$ = [3,4,4]: Template:CDD ${\overline {N}}_{3}$ = [43]: Template:CDD ${\overline {V}}_{3}$ = [3,3,6]: Template:CDD ${\overline {BV}}_{3}$ = [4,3,6]: Template:CDD ${\overline {HV}}_{3}$ = [5,3,6]: Template:CDD ${\overline {Y}}_{3}$ = [3,6,3]: Template:CDD ${\overline {Z}}_{3}$ = [6,3,6]: Template:CDD	${\overline {DP}}_{3}$ = [3[]x[]]: Template:CDD ${\overline {PP}}_{3}$ = [3[3,3]]: Template:CDD
5	9	${\overline {P}}_{4}$ = [3,3[4]]: Template:CDD ${\overline {BP}}_{4}$ = [4,3[4]]: Template:CDD ${\widehat {FR}}_{4}$ = [(32,4,3,4)]: Template:CDD ${\overline {DP}}_{4}$ = [3[3]x[]]: Template:CDD	${\overline {N}}_{4}$ = [4,3,((4,2,3))]: Template:CDD ${\overline {O}}_{4}$ = [3,4,31,1]: Template:CDD ${\overline {S}}_{4}$ = [4,32,1]: Template:CDD	${\overline {R}}_{4}$ = [(3,4)2]: Template:CDD	${\overline {M}}_{4}$ = [4,31,1,1]: Template:CDD
6	12	${\overline {P}}_{5}$ = [3,3[5]]: Template:CDD ${\widehat {AU}}_{5}$ = [(35,4)]: Template:CDD ${\widehat {AR}}_{5}$ = [(3,3,4)[2]]: Template:CDD	${\overline {S}}_{5}$ = [4,3,32,1]: Template:CDD ${\overline {O}}_{5}$ = [3,4,31,1]: Template:CDD ${\overline {N}}_{5}$ = [3,(3,4)1,1]: Template:CDD	${\overline {U}}_{5}$ = [33,4,3]: Template:CDD ${\overline {X}}_{5}$ = [3,3,4,3,3]: Template:CDD ${\overline {R}}_{5}$ = [3,4,3,3,4]: Template:CDD	${\overline {Q}}_{5}$ = [32,1,1,1]: Template:CDD ${\overline {M}}_{5}$ = [4,3,31,1,1]: Template:CDD ${\overline {L}}_{5}$ = [31,1,1,1,1]: Template:CDD
7	3	${\overline {P}}_{6}$ = [3,3[6]]: Template:CDD	${\overline {Q}}_{6}$ = [31,1,3,32,1]: Template:CDD	${\overline {S}}_{6}$ = [4,32,32,1]: Template:CDD
8	4	${\overline {P}}_{7}$ = [3,3[7]]: Template:CDD	${\overline {Q}}_{7}$ = [31,1,32,32,1]: Template:CDD	${\overline {S}}_{7}$ = [4,33,32,1]: Template:CDD	${\overline {T}}_{7}$ = [33,2,2]: Template:CDD
9	4	${\overline {P}}_{8}$ = [3,3[8]]: Template:CDD	${\overline {Q}}_{8}$ = [31,1,33,32,1]: Template:CDD	${\overline {S}}_{8}$ = [4,34,32,1]: Template:CDD	${\overline {T}}_{8}$ = [34,3,1]: Template:CDD
10	3		${\overline {Q}}_{9}$ = [31,1,34,32,1]: Template:CDD	${\overline {S}}_{9}$ = [4,35,32,1]: Template:CDD	${\overline {T}}_{9}$ = [36,2,1]: Template:CDD

Subgroup relations of paracompact hyperbolic groups

These trees represents subgroup relations of paracompact hyperbolic groups. Subgroup indices on each connection are given in red. Subgroups of index 2 represent a mirror removal, and fundamental domain doubling. Others can be inferred by commensurability (integer ratio of volumes) for the tetrahedral domains.

Subgroup trees
H3
H4
H5

Hypercompact Coxeter groups (Vinberg polytopes)

Just as the hyperbolic plane Template:Mvar has nontriangular polygonal domains, non-simplex domains similarly exist in higher-dimensional hyperbolic spaces. These nonsimplex domains can be considered degenerate simplices with non-intersecting mirrors given infinite order; in a Coxeter diagram, such branches are given dotted or dashed lines. These nonsimplex domains are called Vinberg polytopes, after Ernest Vinberg who devised an algorithm for finding nonsimplex fundamental domain of a hyperbolic reflection group. Geometrically these fundamental domains can be classified as quadrilateral pyramids, or prisms or other polytopes with edges as the intersection of two mirrors having dihedral angles as $\pi /n$ for $n=2,3,4,\ldots$

In a simplex-based domain, there are Template:Mvar mirrors for Template:Mvar-dimensional space. In non-simplex domains, there are more than Template:Mvar mirrors. The list is finite, but not completely known. Instead partial lists have been enumerated as Template:Mvar mirrors for Template:Mvar as 2, 3, and 4.

Hypercompact Coxeter groups in three dimensional space or higher differ from two dimensional groups in one essential respect. Two hyperbolic Template:Mvar-gons having the same angles in the same cyclic order may have different edge lengths and are not in general congruent. In contrast Vinberg polytopes in 3 dimensions or higher are completely determined by the dihedral angles. This fact is based on the Mostow rigidity theorem, that two isomorphic groups generated by reflections in Template:Mvar for $n=3$, define congruent fundamental domains (Vinberg polytopes).

Vinberg polytopes with rank Template:Mvar for Template:Mvar-dimensional space

The complete list of compact hyperbolic Vinberg polytopes with rank Template:Mvar mirrors for Template:Mvar dimensions has been enumerated by F. Esselmann in 1996. A partial list was published in 1974 by I. M. Kaplinskaya.

The complete list of paracompact solutions was published by P. Tumarkin in 2003, with dimensions from 3 to 17.

The smallest paracompact form in Template:Mvar can be represented by Template:CDD, or [∞,3,3,∞] which can be constructed by a mirror removal of paracompact hyperbolic group [3,4,4] as [3,4,1⁺,4]. The doubled fundamental domain changes from a tetrahedron into a quadrilateral pyramid. Another pyramids include [4,4,1⁺,4] = [∞,4,4,∞], Template:CDD = Template:CDD. Removing a mirror from some of the cyclic hyperbolic Coxeter graphs become bow-tie graphs: [(3,3,4,1⁺,4)] = [((3,∞,3)),((3,∞,3))] or Template:CDD, [(3,4,4,1⁺,4)] = [((4,∞,3)),((3,∞,4))] or Template:CDD, [(4,4,4,1⁺,4)] = [((4,∞,4)),((4,∞,4))] or Template:CDD.

Other valid paracompact graphs with quadrilateral pyramid fundamental domains include:

Dimension	Rank	Graphs
H3	5	Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD

Another subgroup [1⁺,4^1,1,1] = [∞,4,1⁺,4,∞] = [∞^[6]]. Template:CDD = Template:CDD = Template:CDD.

Vinberg polytopes with rank Template:Mvar for Template:Mvar-dimensional space

There are a finite number of degenerate fundamental simplices exist up through dimension 8. These groups are labeled by dotted/broken lines for ultraparallel branches.

The complete list of compact Vinberg polytopes with rank Template:Mvar mirrors for Template:Mvar dimensions was first enumerated by P. Tumarkin in 2004 and then published completely in 2007 with some amendments. The highest figure was discovered by Bugaenko in 1984 in dimension 8, rank 11. There are no solutions in dimension 7.

Between dimensions 4 and 8, rank 7 to 11 Coxeter groups are counted as 40, 16, 3, 0, and 1 respectively:

Dimensions	Rank	Cases	Graphs
H4	7	40	...
H5	8	16	..
H6	9	3	Template:CDD	Template:CDD	Template:CDD
H7	10	0
H8	11	1	Template:CDD

On the other hand, the complete list of non-compact Vinberg polytopes with rank Template:Mvar mirrors and with one non-simple vertex for Template:Mvar dimensions has been enumerated by Mike Roberts.

Vinberg polytopes with rank Template:Mvar for Template:Mvar-dimensional space

There are a finite number of degenerate fundamental simplices that exist up through dimension 7. Compact Vinberg polytopes with rank Template:Mvar mirrors for Template:Mvar dimensions were explored by A. Felikson and P. Tumarkin first in 2005, with results formally published in 2008. They reported finding a single unique solution in dimension 7 with 11 mirror facets, and proved that no other solutions exist in higher dimensions.

Lorentzian groups

Regular honeycombs with Lorentzian groups

{3,3,7} viewed outside of Poincare ball model

{7,3,3} viewed outside of Poincare ball model

This shows rank 5 Lorentzian groups arranged as subgroups from [6,3,3,3], and [6,3,6,3]. The highly symmetric group Template:CDD, [3^[3,3,3]] is an index 120 subgroup of [6,3,3,3].

Lorentzian groups for simplex domains can be defined as graphs beyond the paracompact hyperbolic forms. These are sometimes called super-ideal simplices and are also related to a Lorentzian geometry, named after Hendrik Lorentz in the field of special and general relativity space-time, containing one (or more) time-like dimensional components whose self dot products are negative. Danny Calegari calls these convex cocompact Coxeter groups in n-dimensional hyperbolic space.

Livello 2

A 1982 paper by George Maxwell, Sphere Packings and Hyperbolic Reflection Groups, enumerates the finite list of Lorentzian reflection groups of rank 5 to 11. He calls them level 2, meaning removal any permutation of 2 nodes leaves a finite or Euclidean graph.

All higher-order branch Coxeter groups of rank-4 are Lorentzian, ending in the limit as a complete graph 3-simplex Coxeter-Dynkin diagram with 6 infinite order branches, which can be expressed as [∞^[3,3]]. Rank 5-11 have a finite number of groups 186, 66, 36, 13, 10, 8, and 4 Lorentzian groups respectively.

A 2013 paper by H. Chen and J.-P. Labbé, Lorentzian Coxeter groups and Boyd--Maxwell ball packings, recomputed and published the complete list, adding 3 new groups of rank 5, 189 total.

This is the complete list, including graphics for ranks 5 to 7.

Lorentzian Coxeter groups

Rank	Graphs	Packings	Groups
4	∞	∞	[3,3,7] ... [∞,∞,∞]: Template:CDD... Template:CDD [4,3[3]] ... [∞,∞[3]]: Template:CDD... Template:CDD [5,41,1] ... [∞1,1,1]: Template:CDD... Template:CDD ... [(5,4,3,3)] ... [∞[4]]: ... Template:CDD... Template:CDD ... [4[]×[]] ... [∞[]×[]]: ... Template:CDD ... [4[3,3]] ... [∞[3,3]]
5	186+3	95+	...[3[3,3,3]]:Template:CDD...
6	66	30	...[4,31,1,1,1]: Template:CDD
7	36	13	...[31,1,1,1,1,1]: Template:CDD
8	13	9	[3,3,3[6]]:Template:CDD [3,3[6],3]:Template:CDD [3,3[2+4],3]:Template:CDD [3,3[1+5],3]:Template:CDD [3[ ]e×[3]]:Template:CDD	[4,3,3,33,1]:Template:CDD [31,1,3,33,1]:Template:CDD [3,(3,3,4)1,1]:Template:CDD Template:CDD Template:CDD [32,1,3,32,1]:Template:CDD		[4,3,3,32,2]:Template:CDD [31,1,3,32,2]:Template:CDD
9	10	8	[3,3[3+4],3]:Template:CDD [3,3[9]]:Template:CDD [3,3[2+5],3]:Template:CDD	[32,1,32,32,1]:Template:CDD	[33,1,33,4]:Template:CDD [33,1,3,3,31,1]:Template:CDD	[33,3,2]:Template:CDD [32,2,4]:Template:CDD [32,2,33,4]:Template:CDD [32,2,3,3,31,1]:Template:CDD
10	8	7	[3,3[8],3]:Template:CDD [3,3[3+5],3]:Template:CDD [3,3[9]]:Template:CDD	[32,1,33,32,1]:Template:CDD	[35,3,1]:Template:CDD [33,1,34,4]:Template:CDD [33,1,33,31,1]:Template:CDD	[34,4,1]:Template:CDD
11	4	3		[32,1,34,32,1]:Template:CDD	[32,1,36,4]:Template:CDD [32,1,35,31,1]:Template:CDD	[37,2,1]:Template:CDD

Very-extended Coxeter diagrams

One usage includes a very-extended definition from the direct Dynkin diagram usage which considers affine groups as extended, hyperbolic groups over-extended, and a third node as very-extended simple groups. These extensions are usually marked by an exponent of 1,2, or 3 + symbols for the number of extended nodes. This extending series can be extended backwards, by sequentially removing the nodes from the same position in the graph, although the process stops after removing branching node. The E₈ extended family is the most commonly shown example extending backwards from E₃ and forwards to E₁₁.

The extending process can define a limited series of Coxeter graphs that progress from finite to affine to hyperbolic to Lorentzian. The determinant of the Cartan matrices determine where the series changes from finite (positive) to affine (zero) to hyperbolic (negative), and ending as a Lorentzian group, containing at least one hyperbolic subgroup. The noncrystallographic H_n groups forms an extended series where H₄ is extended as a compact hyperbolic and over-extended into a lorentzian group.

The determinant of the Schläfli matrix by rank are:

• det(A₁ⁿ = [2ⁿ⁻¹]) = 2ⁿ (Finite for all n)
• det(A_n = [3ⁿ⁻¹]) = n + 1 (finite for all n)
• det(B_n = [4,3ⁿ⁻²]) = 2 (finite for all n)
• det(D_n = [3^n−3,1,1]) = 4 (finite for all n)

Determinants of the Schläfli matrix in exceptional series are:

• det(E_n = [3^n−3,2,1]) = 9 − n (finite for E₃ (= A₂A₁), E₄ (= A₄), E₅ (= D₅), E₆, E₇ and E₈, affine at E₉ (${\tilde {E}}_{8}$), hyperbolic at E₁₀)
• det([3^n−4,3,1]) = 2(8 − n) (finite for n = 4 to 7, affine (${\tilde {E}}_{7}$), and hyperbolic at n = 8.)
• det([3^n−4,2,2]) = 3(7 − n) (finite for n = 4 to 6, affine (${\tilde {E}}_{6}$), and hyperbolic at n = 7.)
• det(F_n = [3,4,3ⁿ⁻³]) = 5 − n (finite for F₃ (= B₃) to F₄, affine at F₅ (${\tilde {F}}_{4}$), hyperbolic at F₆)
• det(G_n = [6,3ⁿ⁻²]) = 3 − n (finite for G₂, affine at G₃ (${\tilde {G}}_{2}$), hyperbolic at G₄)

Smaller extended series

Finite	$A_{2}$	$C_{2}$	$G_{2}$	$A_{3}$	$B_{3}$	$C_{3}$	$H_{4}$
Rank n	[3[3],3n-3]	[4,4,3n-3]	Gn=[6,3n-2]	[3[4],3n-4]	[4,31,n-3]	[4,3,4,3n-4]	Hn=[5,3n-2]
2	[3] A2 Template:CDD	[4] C2 Template:CDD	[6] G2 Template:CDD		[2] A12 Template:CDD	[4] C2 Template:CDD	[5] H2 Template:CDD
3	[3[3]] A2+=${\tilde {A}}_{2}$ Template:CDD	[4,4] C2+=${\tilde {C}}_{2}$ Template:CDD	[6,3] G2+=${\tilde {G}}_{2}$ Template:CDD	[3,3]=A3 Template:CDD	[4,3] B3 Template:CDD	[4,3] C3 Template:CDD	[5,3] H3 Template:CDD
4	[3[3],3] A2++=${\overline {P}}_{3}$ Template:CDD	[4,4,3] C2++=${\overline {R}}_{3}$ Template:CDD	[6,3,3] G2++=${\overline {V}}_{3}$ Template:CDD	[3[4]] A3+=${\tilde {A}}_{3}$ Template:CDD	[4,31,1] B3+=${\tilde {B}}_{3}$ Template:CDD	[4,3,4] C3+=${\tilde {C}}_{3}$ Template:CDD	[5,3,3] H4 Template:CDD
5	[3[3],3,3] A2+++ Template:CDD	[4,4,3,3] C2+++ Template:CDD	[6,3,3,3] G2+++ Template:CDD	[3[4],3] A3++=${\overline {P}}_{4}$ Template:CDD	[4,32,1] B3++=${\overline {S}}_{4}$ Template:CDD	[4,3,4,3] C3++=${\overline {R}}_{4}$ Template:CDD	[5,33] H5=${\overline {H}}_{4}$ Template:CDD
6				[3[4],3,3] A3+++ Template:CDD	[4,33,1] B3+++ Template:CDD	[4,3,4,3,3] C3+++ Template:CDD	[5,34] H6 Template:CDD
Det(Mn)	3(3-n)	2(3-n)	3-n	4(4-n)	2(4-n)

Middle extended series

Finite	$A_{4}$	$B_{4}$	$C_{4}$	$D_{4}$	$F_{4}$	$A_{5}$	$B_{5}$	$D_{5}$
Rank n	[3[5],3n-5]	[4,3,3n-4,1]	[4,3,3,4,3n-5]	[3n-4,1,1,1]	[3,4,3n-3]	[3[6],3n-6]	[4,3,3,3n-5,1]	[31,1,3,3n-5,1]
3		[4,3−1,1] B2A1 Template:CDD	[4,3] B3 Template:CDD	[3−1,1,1,1] A13 Template:CDD	[3,4] B3 Template:CDD		[4,3,3] C3 Template:CDD
4	[33] A4 Template:CDD	[4,3,3] B4 Template:CDD	[4,3,3] C4 Template:CDD	[30,1,1,1] D4 Template:CDD	[3,4,3] F4 Template:CDD		[4,3,3,3−1,1] B3A1 Template:CDD	[31,1,3,3−1,1] A3A1 Template:CDD
5	[3[5]] A4+=${\tilde {A}}_{4}$ Template:CDD	[4,3,31,1] B4+=${\tilde {B}}_{4}$ Template:CDD	[4,3,3,4] C4+=${\tilde {C}}_{4}$ Template:CDD	[31,1,1,1] D4+=${\tilde {D}}_{4}$ Template:CDD	[3,4,3,3] F4+=${\tilde {F}}_{4}$ Template:CDD	[34] A5 Template:CDD	[4,3,3,3,3] B5 Template:CDD	[31,1,3,3] D5 Template:CDD
6	[3[5],3] A4++=${\overline {P}}_{5}$ Template:CDD	[4,3,32,1] B4++=${\overline {S}}_{5}$ Template:CDD	[4,3,3,4,3] C4++=${\overline {R}}_{5}$ Template:CDD	[32,1,1,1] D4++=${\overline {Q}}_{5}$ Template:CDD	[3,4,33] F4++=${\overline {U}}_{5}$ Template:CDD	[3[6]] A5+=${\tilde {A}}_{5}$ Template:CDD	[4,3,3,31,1] B5+=${\tilde {B}}_{5}$ Template:CDD	[31,1,3,31,1] D5+=${\tilde {D}}_{5}$ Template:CDD
7	[3[5],3,3] A4+++ Template:CDD	[4,3,33,1] B4+++ Template:CDD	[4,3,3,4,3,3] C4+++ Template:CDD	[33,1,1,1] D4+++ Template:CDD	[3,4,34] F4+++ Template:CDD	[3[6],3] A5++=${\overline {P}}_{6}$ Template:CDD	[4,3,3,32,1] B5++=${\overline {S}}_{6}$ Template:CDD	[31,1,3,32,1] D5++=${\overline {Q}}_{6}$ Template:CDD
8						[3[6],3,3] A5+++ Template:CDD	[4,3,3,33,1] B5+++ Template:CDD	[31,1,3,33,1] D5+++ Template:CDD
Det(Mn)	5(5-n)	2(5-n)		4(5-n)	5-n	6(6-n)	4(6-n)

Some higher extended series

Finite	$A_{6}$	$B_{6}$	$D_{6}$	$E_{6}$	$A_{7}$	$B_{7}$	$D_{7}$	$E_{7}$	$E_{8}$
Rank n	[3[7],3n-7]	[4,33,3n-6,1]	[31,1,3,3,3n-6,1]	[3n-5,2,2]	[3[8],3n-8]	[4,34,3n-7,1]	[31,1,3,3,3,3n-7,1]	[3n-5,3,1]	En=[3n-4,2,1]
3									[3−1,2,1] E3=A2A1 Template:CDD
4				[3−1,2,2] A22 Template:CDD				[3−1,3,1] A3A1 Template:CDD	[30,2,1] E4=A4 Template:CDD
5		[4,3,3,3,3−1,1] B4A1 Template:CDD	[31,1,3,3,3−1,1] D4A1 Template:CDD	[30,2,2] A5 Template:CDD				[30,3,1] A5 Template:CDD	[31,2,1] E5=D5 Template:CDD
6	[35] A6 Template:CDD	[4,34] B6 Template:CDD	[31,1,3,3,3] D6 Template:CDD	[31,2,2] E6 Template:CDD		[4,3,3,3,3,3−1,1] B5A1 Template:CDD	[31,1,3,3,3,3−1,1] D5A1 Template:CDD	[31,3,1] D6 Template:CDD	[32,2,1] E6 * Template:CDD
7	[3[7]] A6+=${\tilde {A}}_{6}$ Template:CDD	[4,33,31,1] B6+=${\tilde {B}}_{6}$ Template:CDD	[31,1,3,3,31,1] D6+=${\tilde {D}}_{6}$ Template:CDD	[32,2,2] E6+=${\tilde {E}}_{6}$ Template:CDD	[36] A7 Template:CDD	[4,35] B7 Template:CDD	[31,1,3,3,3,30,1] D7 Template:CDD	[32,3,1] E7 * Template:CDD	[33,2,1] E7 * Template:CDD
8	[3[7],3] A6++=${\overline {P}}_{7}$ Template:CDD	[4,33,32,1] B6++=${\overline {S}}_{7}$ Template:CDD	[31,1,3,3,32,1] D6++=${\overline {Q}}_{7}$ Template:CDD	[33,2,2] E6++=${\overline {T}}_{7}$ Template:CDD	[3[8]] A7+=${\tilde {A}}_{7}$ * Template:CDD	[4,34,31,1] B7+=${\tilde {B}}_{7}$ * Template:CDD	[31,1,3,3,3,31,1] D7+=${\tilde {D}}_{7}$ * Template:CDD	[33,3,1] E7+=${\tilde {E}}_{7}$ * Template:CDD	[34,2,1] E8 * Template:CDD
9	[3[7],3,3] A6+++ Template:CDD	[4,33,33,1] B6+++ Template:CDD	[31,1,3,3,33,1] D6+++ Template:CDD	[34,2,2] E6+++ Template:CDD	[3[8],3] A7++=${\overline {P}}_{8}$ * Template:CDD	[4,34,32,1] B7++=${\overline {S}}_{8}$ * Template:CDD	[31,1,3,3,3,32,1] D7++=${\overline {Q}}_{8}$ * Template:CDD	[34,3,1] E7++=${\overline {T}}_{8}$ * Template:CDD	[35,2,1] E9=E8+=${\tilde {E}}_{8}$ * Template:CDD
10					[3[8],3,3] A7+++ * Template:CDD	[4,34,33,1] B7+++ * Template:CDD	[31,1,3,3,3,33,1] D7+++ * Template:CDD	[35,3,1] E7+++ * Template:CDD	[36,2,1] E10=E8++=${\overline {T}}_{9}$ * Template:CDD
11									[37,2,1] E11=E8+++ * Template:CDD
Det(Mn)	7(7-n)	2(7-n)	4(7-n)	3(7-n)	8(8-n)	2(8-n)	4(8-n)	2(8-n)	9-n

Geometric folding

Finite and affine foldings

φA : AΓ --> AΓ' for finite types
Γ	Γ'	Folding description	Coxeter–Dynkin diagrams
I2(h)	Γ(h)	Dihedral folding
Bn	A2n	(I,sn)
	Dn+1, A2n-1	(A3,+/-ε)
F4	E6	(A3,±ε)
H4	E8	(A4,±ε)
H3	D6
H2	A4
G2	A5	(A5,±ε)
	D4	(D4,±ε)
φ: AΓ+ --> AΓ'+ for affine types
${\tilde {A}}_{n-1}$	${\tilde {A}}_{kn-1}$	Locally trivial
${\tilde {B}}_{n}$	${\tilde {D}}_{2n+1}$	(I,sn)
	${\tilde {D}}_{n+1}$, ${\tilde {D}}_{2n}$	(A3,±ε)
${\tilde {C}}_{n}$	${\tilde {B}}_{n+1}$, ${\tilde {C}}_{2n}$	(A3,±ε)
	${\tilde {C}}_{2n+1}$	(I,sn)
${\tilde {C}}_{n}$	${\tilde {A}}_{2n+1}$	(I,sn) & (I,s0)
	${\tilde {A}}_{2n}$	(A3,ε) & (I,s0)
	${\tilde {A}}_{2n-1}$	(A3,ε) & (A3,ε')
${\tilde {C}}_{n}$	${\tilde {D}}_{n+2}$	(A3,-ε) & (A3,-ε')
${\tilde {C}}_{2}$	${\tilde {D}}_{5}$	(I,s1)
${\tilde {F}}_{4}$	${\tilde {E}}_{6}$, ${\tilde {E}}_{7}$	(A3,±ε)
${\tilde {G}}_{2}$	${\tilde {D}}_{6}$, ${\tilde {E}}_{7}$	(A5,±ε)
	${\tilde {B}}_{3}$, ${\tilde {F}}_{4}$	(B3,±ε)
	${\tilde {D}}_{4}$, ${\tilde {E}}_{6}$	(D4,±ε)

A (simply-laced) Coxeter–Dynkin diagram (finite, affine, or hyperbolic) that has a symmetry (satisfying one condition, below) can be quotiented by the symmetry, yielding a new, generally multiply laced diagram, with the process called "folding".

For example, in D₄ folding to G₂, the edge in G₂ points from the class of the 3 outer nodes (valence 1), to the class of the central node (valence 3). And E₈ folds into 2 copies of H₄, the second copy scaled by τ.

Geometrically this corresponds to orthogonal projections of uniform polytopes and tessellations. Notably, any finite simply-laced Coxeter–Dynkin diagram can be folded to I₂(h), where h is the Coxeter number, which corresponds geometrically to a projection to the Coxeter plane.

A few hyperbolic foldings

Complex reflections

Coxeter–Dynkin diagrams have been extended to complex space, Cⁿ where nodes are unitary reflections of period greater than 2. Nodes are labeled by an index, assumed to be 2 for ordinary real reflection if suppressed. Coxeter writes the complex group, p[q]r, as diagram Template:CDD.

A 1-dimensional regular complex polytope in $\mathbb {C} ^{1}$ is represented as Template:CDD, having p vertices. Its real representation is a regular polygon, {p}. Its symmetry is _p[] or Template:CDD, order p. A unitary operator generator for Template:CDD is seen as a rotation in $\mathbb {R} ^{2}$ by 2π/p radians counter clockwise, and a Template:CDD edge is created by sequential applications of a single unitary reflection. A unitary reflection generator for a 1-polytope with p vertices is Template:Math. When p = 2, the generator is e^πi = –1, the same as a point reflection in the real plane.

In a higher polytope, _p{} or Template:CDD represents a p-edge element, with a 2-edge, {} or Template:CDD, representing an ordinary real edge between two vertices.

Regular complex 1-polytopes

Complex 1-polytopes, Template:CDD, represented in the Argand plane as regular polygons for p = 2, 3, 4, 5, and 6, with black vertices. The centroid of the p vertices is shown seen in red. The sides of the polygons represent one application of the symmetry generator, mapping each vertex to the next counterclockwise copy. These polygonal sides are not edge elements of the polytope, as a complex 1-polytope can have no edges (it often is a complex edge) and only contains vertex elements.

12 irreducible Shephard groups with their subgroup index relations. Subgroups index 2 relate by removing a real reflection: p[2q]2 --> p[q]p, index 2. p[4]q --> p[q]p, index q.

p[4]2 subgroups: p=2,3,4... p[4]2 --> [p], index p p[4]2 --> p[]×p[], index 2

Aa regular complex polygons in $\mathbb {C} ^{2}$, has the form _p{q}_r or Coxeter diagram Template:CDD. The symmetry group of a regular complex polygon Template:CDD is not called a Coxeter group, but instead a Shephard group, a type of Complex reflection group. The order of _p[q]_r is $8/q\cdot (1/p+2/q+1/r-1)^{-2}$.

The rank 2 Shephard groups are: ₂[q]₂, _p[4]₂, ₃[3]₃, ₃[6]₂, ₃[4]₃, ₄[3]₄, ₃[8]₂, ₄[6]₂, ₄[4]₃, ₃[5]₃, ₅[3]₅, ₃[10]₂, ₅[6]₂, and ₅[4]₃ or Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD, Template:CDD of order 2q, 2p², 24, 48, 72, 96, 144, 192, 288, 360, 600, 1200, and 1800 respectively.

The symmetry group _p1[q]_p2 is represented by 2 generators R₁, R₂, where: R₁^p₁ = R₂^p₂ = I. If q is even, (R₂R₁)^q/2 = (R₁R₂)^q/2. If q is odd, (R₂R₁)^(q-1)/2R₂ = (R₁R₂)^(q-1)/2R₁. When q is odd, p₁=p₂.

The $\mathbb {C} ^{3}$ group Template:CDD or [1 1 1]^p is defined by 3 period 2 unitary reflections {R₁, R₂, R₃}: R₁² = R₁² = R₃² = (R₁R₂)³ = (R₂R₃)³ = (R₃R₁)³ = (R₁R₂R₃R₁)^p = 1. The period p can be seen as a double rotation in real $\mathbb {R} ^{4}$.

A similar $\mathbb {C} ^{3}$ group Template:CDD or [1 1 1]^(p) is defined by 3 period 2 unitary reflections {R₁, R₂, R₃}: R₁² = R₁² = R₃² = (R₁R₂)³ = (R₂R₃)³ = (R₃R₁)³ = (R₁R₂R₃R₂)^p = 1.

Voci correlate

• Coxeter group
• Schwarz triangle
• Goursat tetrahedron
• Dynkin diagram
• Uniform polytope
  • Wythoff symbol
  • Uniform polyhedron
  • List of uniform polyhedra
  • List of uniform planar tilings
  • Uniform 4-polytope
  • Convex uniform honeycomb
  • Convex uniform honeycombs in hyperbolic space
• Wythoff construction and Wythoff symbol

Bibliografia

• James E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge studies in advanced mathematics, 29 (1990)
• Kaleidoscopes: Selected Writings of H.S.M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication, 1995, ISBN 978-0-471-01003-6 [3], Googlebooks [4]
  • (Paper 17) Coxeter, The Evolution of Coxeter-Dynkin diagrams, [Nieuw Archief voor Wiskunde 9 (1991) 233-248]
• Coxeter, The Beauty of Geometry: Twelve Essays, Dover Publications, 1999, ISBN 978-0-486-40919-1 (Chapter 3: Wythoff's Construction for Uniform Polytopes)
• Coxeter, Regular Polytopes (1963), Macmillan Company
  • Regular Polytopes, Third edition, (1973), Dover edition, ISBN 0-486-61480-8 (Chapter 5: The Kaleidoscope, and Section 11.3 Representation by graphs)
• H.S.M. Coxeter and W. O. J. Moser. Generators and Relations for Discrete Groups 4th ed, Springer-Verlag. New York. 1980
• Norman Johnson, Geometries and Transformations, Chapters 11,12,13, preprint 2011
• N. W. Johnson, R. Kellerhals, J. G. Ratcliffe, S. T. Tschantz, The size of a hyperbolic Coxeter simplex, Transformation Groups 1999, Volume 4, Issue 4, pp 329–353 [5] [6]
• Norman W. Johnson and Asia Ivic Weiss Quadratic Integers and Coxeter Groups Archiviato il 26 marzo 2023 in Internet Archive. PDF Can. J. Math. Vol. 51 (6), 1999 pp. 1307–1336

Collegamenti esterni

Altri progetti

• Wikimedia Commons

• Wikimedia Commons contiene immagini o altri file su Grasso Luigi/sandbox4/Diagramma di Coxeter-Dynkin
• (EN) Eric W. Weisstein, Grasso Luigi/sandbox4/Diagramma di Coxeter-Dynkin, in MathWorld, Wolfram Research.
• October 1978 discussion on the history of the Coxeter diagrams by Coxeter and Dynkin in Toronto, Canada; Eugene Dynkin Collection of Mathematics Interviews, Cornell University Library.