Generating Systems of the Full Matrix Algebra That Contain Nonderogatory Matrices

Let A be an algebra over a field F generated by a set of matrices S. The paper considers algorithmic aspects of checking whether A coincides with the full matrix algebra. Laffey has shown that for F = C, under the assumption that S contains a Jordan matrix from a certain class, there is a fast metho...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2022-03, Vol.262 (1), p.99-107
Main Authors: Markova, O. V., Novochadov, D. Yu
Format: Article
Language:English
Subjects:
Algebra
Algorithms
Mathematical analysis
Mathematics
Mathematics and Statistics
Matrix algebra
Subspaces
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let A be an algebra over a field F generated by a set of matrices S. The paper considers algorithmic aspects of checking whether A coincides with the full matrix algebra. Laffey has shown that for F = C, under the assumption that S contains a Jordan matrix from a certain class, there is a fast method for checking whether A possesses nontrivial invariant subspaces and, consequently, coincides with the full algebra by Burnside’s theorem. This paper extends the class to the largest subclass of Jordan matrices on which the algorithm works correctly. Examples demonstrating different types of behavior of other matrix systems are provided.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-022-05802-2