How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.

From MaRDI portal
(Redirected from Publication:2882824)



Abstract: This is a survey paper on algorithms that have been developed during the last 25 years for the explicit computation of the structure of an associative algebra of finite dimension over either a finite field or an algebraic number field. This constructive approach was initiated in 1985 by Friedl and Ronyai and has since been developed by Cohen, de Graaf, Eberly, Giesbrecht, Ivanyos, Kuronya and Wales. I illustrate these algorithms with the case n = 2 of the rational semigroup algebra of the partial transformation semigroup PT_n on n elements; this generalizes the full transformation semigroup and the symmetric inverse semigroup, and these generalize the symmetric group S_n.


Let \(A\) be finite-dimensional algebra over either a finite field or an algebraically closed field. The paper under review surveys various algorithms available to do the following:{\parindent=8mm\begin{itemize}\item[(i)] compute a basis for the radical \(R\) of \(A\);\item[(ii)] compute structure constants for the semisimple quotient \(A/R\);\item[(iii)] compute a basis for the center of \(A/R\) consisting of orthogonal idempotents;\item[(iv)] compute the identity matrices in simple ideals of \(A/R\);\item[(v)] compute an isomorphism of each simple ideal of \(A/R\) with a full matrix algebra;\item[(vi)] compute explicit matrices for irreducible representations of \(A\).NEWLINENEWLINE\end{itemize}} The author illustrates these algorithms on the example of the semigroup algebra of the full partial transformation semigroup \(PT_2\) on a \(2\)-element set.











This page was built for publication: How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882824)