Abstract
AbstractWe revise the matching algorithm of Noeske (LMS J. Comput. Math. 11 (2008) 213–222) and introduce a new approach via composition series to expedite the calculations. Furthermore, we show how the matching algorithm may be applied in the more general and frequently occurring setting that we are only given subalgebras of the condensed algebras which each contain the separable algebra of one of their Wedderburn–Malcev decompositions.
Subject
Computational Theory and Mathematics,General Mathematics