Congruence of multilinear forms

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.Comment: 16 page

Complexity of matrix problems

In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems. We show in an explicit form that this problem contains all classification matrix problems given by quivers or posets. Then we prove that it does not contain (but is contained in) the problem of classifying three-valent tensors. Hence, all wild classification problems given by quivers or posets have the same complexity; moreover, a solution of any one of these problems implies a solution of each of the others. The problem of classifying three-valent tensors is more complicated.Comment: 24 page

PROBLEMS OF CLASSIFYING ASSOCIATIVE OR LIE ALGEBRAS OVER A FIELD OF CHARACTERISTIC NOT TWO AND FINITE METABELIAN GROUPS ARE WILD ∗

Abstract. Let F be a field of characteristic different from 2. It is shown that the problems of classifying (i) local commutative associative algebras over F with zero cube radical, (ii) Lie algebras over F with central commutator subalgebra of dimension 3, and (iii) finite p-groups of exponent p with central commutator subgroup of order p 3 are hopeless since each of them contains • the problem of classifying symmetric bilinear mappings U × U → V,or • the problem of classifying skew-symmetric bilinear mappings U × U → V, in which U and V are vector spaces over F (consisting of p elements for p-groups (iii)) and V is 3-dimensional. The latter two problems are hopeless since they are wild; i.e., each of them contains the problem of classifying pairs of matrices over F up to similarity. Key words. groups