Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
In: Fundamenta Informaticae
Online
serialPeriodical
Zugriff:
A well known constructive proof for the ADE-classification of many mathematical objects, such as positive unit forms and their associated quasi-Cartan matrices, has lead to an Inflations Algorithm. However, this algorithm is not known to run in polynomial time. In this paper we use a so called flation transformation and show how its invariants can be used to characterize the Dynkin types A and D in the language of graph theory. Also, a polynomial-time algorithm for computing the Dynkin type is suggested.
Titel: |
Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
|
---|---|
Autor/in / Beteiligte Person: | Abarca, M. ; Rivera, D. |
Link: | |
Zeitschrift: | Fundamenta Informaticae |
Medientyp: | serialPeriodical |
Schlagwort: |
|
Sonstiges: |
|