Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

How to compute the Wedderburn decomposition of a finite-dimensional associative algebra 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 . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

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

Bremner, Murray R.
Groups - Complexity - Cryptology , Volume 3 (1) – May 1, 2011
Download PDF
20 pages

Loading next page...
 
/lp/de-gruyter/how-to-compute-the-wedderburn-decomposition-of-a-finite-dimensional-eY7VahXCfP

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2011 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2011.003
Publisher site
See Article on Publisher Site

Abstract

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 .

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: May 1, 2011

References

  • Wedderburn and the structure theory of algebras Hist
    Parshall
  • Decompositions of algebras over
    Eberly
  • Decomposition of algebras over finite fields and number fields
    Eberly
  • Computing the structure of finite algebras Symbolic
    Rónyai
  • de Computing Levi decompositions in Lie algebras Algebra Engrg
    Graaf
  • The Algebraic Theory of Semigroups ematical
    Clifford
  • Classical Finite Transformation Semigroups : An In - troduction On the irreducible representations of a finite semigroup
    Ganyushkin
  • Complex representations of finite monoids London Math
    Putcha
  • Finding the radical of an algebra of linear transformations
    Cohen
  • Maschke s theorem for semigroups
    Drazin
  • Efficient decomposition of associative algebras over finite fields Symbolic
    Eberly