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

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 9 tables

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

How to compute the Wedderburn decomposition of a finite-dimensional associative algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How to compute the Wedderburn decomposition of a finite-dimensional associative algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to compute the Wedderburn decomposition of a finite-dimensional associative algebra will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586343

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.