Abstract
A well known constructive proof for the 𝔸𝔻𝔼-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 𝔸 and 𝔻 in the language of graph theory. Also, a polynomial-time algorithm for computing the Dynkin type is suggested.
Get full access to this article
View all access options for this article.