ufs_dynkintype - calculates the Dynkin type of a quadratic form

Calling sequence:

ufs_dynkintype(M)

Parameters:

M - a symmetric matrix definig a non negative unit form q

Synopsis:

ufs_dynkintype calculates the Dynkin type of q, as described below.

The argument must be a symmetric matrix definig a unit form, otherwise an error occurs.

It is a classic result, that the equivalence classes of positive unit forms are characterized by the Dynkin diagrams

[Maple Math] ( [Maple Math] ), [Maple Math] ( [Maple Math] ) and [Maple Math] ( [Maple Math] ),

namely a Dynkin [Maple Math] diagram defines a unit form [Maple Math] in the following way: Suppose [Maple Math] has 1,..., [Maple Math] as vertices then [Maple Math] is a form in the variables [Maple Math] ,..., [Maple Math] and [Maple Math] where [Maple Math] is the number of edges between [Maple Math] and [Maple Math] in [Maple Math] . Now each positive unit form [Maple Math] is equivalent to a unit form [Maple Math] where [Maple Math] is one of those Dynkin diagrams, called the Dynkin type of [Maple Math] . It has been shown in [1], that the equivalence classes of non-negative unit forms are characterized by two data: the corank and a Dynkin diagram as above, namely each unit form [Maple Math] in the variables [Maple Math] ,..., [Maple Math] which has corank [Maple Math] is equivalent to some [Maple Math] , where [Maple Math] is one of those Dynkin diagrams with [Maple Math] vertices. Again, [Maple Math] is called the Dynkin type of [Maple Math] .

Example:

> A:=matrix([[2,1,1,0,0],[1,2,1,1,0],[1,1,2,1,1],[0,1,1,2,1],[0,0,1,1,2]]);
B:=linalg[diag](A,A):

[Maple Math]

> ufs_dynkintype(A);
ufs_dynkintype(B);

[Maple Math]

[Maple Math]

>

Back to:
start page of the crep online manual, ufstrong