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

Murray R. Bremner

doi:10.1515/gcc.2011.003

Article

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

Murray R. Bremner

Published/Copyright: January 20, 2011

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 3 Issue 1

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 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 PT_n on n elements; this generalizes the full transformation semigroup and the symmetric inverse semigroup, and these generalize the symmetric group S_n.

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

Received: 2010-06-17

Published Online: 2011-01-20

Published in Print: 2011-May

You are currently not able to access this content.

Articles in the same Issue

https://doi.org/10.1515/gcc.2011.003

Keywords for this article

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