✦ LIBER ✦

A classification programme of generalized Dynkin diagrams

✍ Scribed by J.-B. Zuber

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 417 KB
Volume: 26
Category: Article
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00209-4

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this note is to present a problem of classification of graphs according to their spectral properties.

This problem is encountered in several issues of current interest in mathematical physics. The graphs which appear are generalizations both of the simply laced Dynkin diagrams (i.e., of ADEtype)

and of fusion graphs drawn on the weight lattices of the sl(N) Lie algebras.

📜 SIMILAR VOLUMES

A Dynkin diagram classification theorem

A Dynkin diagram classification theorem arising from a combinatorial problem

✍ Robert A. Proctor 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 646 KB

## Los .4ngrlrs. Caljf'orrlia 90024 A combinatorial-linear algebraic condition suflicient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams

Bifurcations, Dynkin diagrams, and modal

Bifurcations, Dynkin diagrams, and modality of isolated singularities

✍ A. M. Gabriélov 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 462 KB

Coxeter-dynkin diagrams of partially ord

Coxeter-dynkin diagrams of partially ordered sets and A'Campo-Gusein-Zade diagrams of simple singularities

✍ G. G. Il'uta 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 483 KB

A Euclidean interpretation of Dynkin dia

A Euclidean interpretation of Dynkin diagrams and its relation to root systems

✍ Daniel Drucker; Daniel Frohardt 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 448 KB

A simple metric property satisfied by bases of (finite, not necessarily reduced) root systems is used to define sets in Euclidean space that provide models for Dynkin diagrams and their positive semideflnite one-vertex extensions. The theory of root systems can be founded on the study of these 'Dynk

On Generic Extensions of Representations

On Generic Extensions of Representations of a Dynkin Quiver of TypeD

✍ Xiao Qin Deng; Jiang Rong Chen 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 212 KB

On a computationally simple form of the

On a computationally simple form of the generalized Campbell–Baker–Hausdorff–Dynkin formula

✍ Ignacy Dulȩba 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 141 KB

In this paper a computationally simple form of the generalized Campbell-Baker-Hausdor -Dynkin formula (GCBHD) is given. Simpliÿcations arise from both combinatorial (explicit) as well as algorithmic (implicit) arguments. On generating the Ph. Hall basis in a special form, and introducing a speciÿc s