Finding the radical of matrix algebras using Fitting decompositions (Q1295786): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875224 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234180 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216754 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4314299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the radical of an algebra of linear transformations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5340151 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4762672 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4227340 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nearly Optimal Algorithms for Canonical Matrix Forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4312071 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3935355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3961610 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the structure of finite algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions in Algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5662056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851616 / rank | |||
Normal rank |
Revision as of 20:56, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding the radical of matrix algebras using Fitting decompositions |
scientific article |
Statements
Finding the radical of matrix algebras using Fitting decompositions (English)
0 references
22 August 1999
0 references
The author addresses the computational problem of finding the Jacobson radical \(\text{Rad}(A)\) of a subalgebra \(A\) of the full matrix algebra \(M_n(K)\) over the field \(K\). It is assumed that \(A\) contains the identity matrix. The author assumes that the input is a finite set of matrices which generate \(A\) as an algebra and the output is a set of matrices which generate \(\text{Rad}(A)\) as an ideal. This task has several applications from modular representation theory of groups to the calculation of the structure of Lie algebras. Until now, all the known methods for computing the radical are based on solving systems of linear or semilinear equations. The coefficients are the traces and other invariants in positive characteristic of the products \(b_ib_j\) where \(b_1,b_2,\ldots,b_s\) is a basis of \(A\). Unfortunately, it is not known how to determine the coefficients in a way more efficient than computing the diagonal elements of the product \(b_ib_j\) of \(O(s^2)\) pairs \(b_i,b_j\). Since \(s\) can be as large as \(n^2\), the existing algorithms require \(\Omega(n^6)\) operations. The approach of this paper is different. The key idea is using the Fitting decomposition with respect to the adjoint actions of appropriate subalgebras to reduce the task to computing the radical of a subalgebra which is nilpotent as a Lie algebra. Factoring by the commutator ideal leads to a reduction to the commutative case. The author also describes a probabilistic version for computing elements which generate the radical as an ideal.
0 references
Jacobson radical
0 references
full matrix algebras
0 references
finite sets of matrices
0 references
semilinear equations
0 references
traces
0 references
algorithms
0 references
Fitting decompositions
0 references
adjoint actions
0 references