2010
DOI: 10.1088/1751-8113/43/15/155209
|View full text |Cite
|
Sign up to set email alerts
|

Classification of hyperbolic Dynkin diagrams, root lengths and Weyl group orbits

Abstract: ABSTRACT. We give a criterion for a Dynkin diagram, equivalently a generalized Cartan matrix, to be symmetrizable. This criterion is easily checked on the Dynkin diagram. We obtain a simple proof that the maximal rank of a Dynkin diagram of compact hyperbolic type is 5, while the maximal rank of a symmetrizable Dynkin diagram of compact hyperbolic type is 4. Building on earlier classification results of Kac, Kobayashi-Morita, Li and Saçlioglu, we present the 238 hyperbolic Dynkin diagrams in ranks 3-10, 142 of… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
58
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(58 citation statements)
references
References 17 publications
0
58
0
Order By: Relevance
“…We have composed computer program to do the checking. The computation result shows except for the number 131,132,133,137,139,141 hyperbolic Lie algebras in the list of Carbone [1], all the subalgebras we constructed are non symmetrizable.…”
Section: (B)mentioning
confidence: 98%
“…We have composed computer program to do the checking. The computation result shows except for the number 131,132,133,137,139,141 hyperbolic Lie algebras in the list of Carbone [1], all the subalgebras we constructed are non symmetrizable.…”
Section: (B)mentioning
confidence: 98%
“…s ∈ S m , for fields from (16), (24)- (27), when Restrictions (31) and (32) are imposed, are equivalent to the equations of motion for the σ -model governed by the action:…”
Section: The Sigma Modelmentioning
confidence: 99%
“…Similarly, the proof of Theorem 3.9 does not use any assumption that the Kac-Moody algebra be of finite type, so our result extends to arbitrary simply-laced types. (see [5] for the notation and list of Dynkin diagrams), whose Dynkin diagram is the complete graph on four vertices. Then the partitions are enumerated as (ν (1) , ν (2) , ν (3) , ν (4) ) and Table 5.1 Well-known embeddings g −→ g of affine Kac-Moody algebras by type as given in [11] (n = 1).…”
Section: Proof Consider Any (B J) ∈ H and Definementioning
confidence: 99%