Minimal nonstandard Coxeter trees (Q1312864): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1171065 |
||
Property / reviewed by | |||
Property / reviewed by: Q686171 / rank | |||
Revision as of 17:00, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal nonstandard Coxeter trees |
scientific article |
Statements
Minimal nonstandard Coxeter trees (English)
0 references
29 August 1994
0 references
A Coxeter graph \(\Gamma\) consists of a set of vertices \(S\) and an associated matrix \(M\). The Witt form of \(\Gamma\) is a symmetric bilinear form \(B_ \Gamma\) defined over the real vector space \(V_ \Gamma\) of dimension \(| \Gamma |\) by \(B_ \Gamma = -\cos (\pi/m_{s,t})\) if \(m_{s,t} \neq+\infty\) and \(=-1\) if \(m_{s,t} = + \infty\). The signature of \(\Gamma\) is the \(l\)-tuple \((\varepsilon_ 1, \dots, \varepsilon_ l)\) where \(\varepsilon_ i\) is \(-1,0\) or 1 such that there exists \(P \in \text{GL} (V_ \Gamma)\) with \(PB_ \Gamma P^ t=\text{diag} (\varepsilon_ 1, \dots, \varepsilon_ l)\). A Coexter graph is nonstandard if its signature does not have 1's in all but the first position. The paper studies the structure of minimal nonstandard Coxeter trees, where minimal means not containing another Coxeter tree as a minor. A Coxeter graph is called ordinary if the weight of each edge is 3. The paper includes a complete list of ordinary minimal nonstandard Coxeter trees.
0 references
Coxeter graph
0 references
Witt form
0 references
Coxeter tree
0 references