Groups Complexity Cryptology
Managing Editor: Shpilrain, Vladimir / Weil, Pascal
Editorial Board: Ciobanu, Laura / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura
2 Issues per year
CiteScore 2017: 0.32
SCImago Journal Rank (SJR) 2017: 0.208
Source Normalized Impact per Paper (SNIP) 2017: 0.322
Mathematical Citation Quotient (MCQ) 2017: 0.32
How to compute the Wedderburn decomposition of a finite-dimensional associative algebra
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 Rónyai and has since been developed by Cohen, de Graaf, Eberly, Giesbrecht, Ivanyos, Küronya and Wales. I illustrate these algorithms with the case n = 2 of the rational semigroup algebra of the partial transformation semigroup PTn on n elements; this generalizes the full transformation semigroup and the symmetric inverse semigroup, and these generalize the symmetric group Sn .
Keywords.: Structure theory of associative algebras; Dickson's Theorem on the radical; Wedderburn–Artin Theorem; Wedderburn–Malcev Theorem; computational algebra; finite transformation semigroups; representation theory of finite semigroups
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.