Description

The module enumerator is used as part of solvable- or hybrid quotient algorithms. It produces the matrix action of a finitely presented algebra on a finitely presented module.

This is a time-critical task that requires a good implementation.

It also would be useful to see, whether one can use if the algebra has in fact a normal form for elements (this is the case in the quotient algorithms).

A groebner basis approach might also be useful.

References

• S. A. Linton, in {\it Computational algebra and number theory (Sydney, 1992)}, 29--51, Kluwer Acad. Publ., Dordrecht, 1995; MR 96m:08003
• S. A. Linton, Linear Algebra Appl. {\bf 192} (1993), 235--248; MR 94k:20022
• S. A. Linton, J. Symbolic Comput. {\bf 12} (1991), no.~4-5, 427--438; MR 93c:20032

Remarks

GAP home page