Canonical matrices for linear matrix problems (Q1587891)

From MaRDI portal
Revision as of 14:46, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Canonical matrices for linear matrix problems
scientific article

    Statements

    Canonical matrices for linear matrix problems (English)
    0 references
    28 August 2001
    0 references
    A large class of matrix problems, which includes the problems of classifying representations of quivers, partially ordered sets and finite dimensional algebras, is studied. Some matrix problems can be formulated in terms of quivers i. e. directed graphs and their representations. The class of studied matrix problems may be extended by considering quivers with relations and partially directed graphs with relations. The Belitskiĭ's algorithm [cf. \textit{G. R. Belitskiĭ}, Normal forms in a space of matrices, in: Marchenko, V. A. (Ed.), Analysis in Infinite-Dimensional Spaces and Operator Theory. Naukova Dumka, Kiev, p. 3-15 (1983) (in Russian)] is presented in a form which allows to reduce pairs of \(n \times n\) matrices to a canonical form by transformations of simultaneous similarity: \((A, B) \mapsto (S^{-1}AS, S^{-1}BS)\). It is shown that the set \(C_{mn}\) of indecomposable canonical \(m \times n\) matrices in the affine space of \(n \times n\) matrices either consists of a finite number of points and straight lines for every \(m \times n\) or that the set \(C_{mn}\) contains a 2-dimensional plane for some \(m \times n\). It means that \(C_{mn}\) satisfies one and only one of the so-called tame and wild type conditions.
    0 references
    canonical forms
    0 references
    directed graphs
    0 references
    matrix reduction
    0 references
    tame and wild matrix problems
    0 references
    quivers
    0 references
    partially ordered sets
    0 references
    finite dimensional algebras
    0 references
    Belitskiĭ's algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references