Treating the Exceptional Cases of the MeatAxe (Q4526080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1553184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treating the Exceptional Cases of the MeatAxe |
scientific article; zbMATH DE number 1553184 |
Statements
Treating the Exceptional Cases of the MeatAxe (English)
0 references
11 July 2001
0 references
computation of simple modules
0 references
MetaAxe
0 references
Las Vegas algorithms
0 references
running times
0 references
polynomial time algorithms
0 references
0.8274854421615601
0 references
The original MetaAxe package of Richard Parker was designed to compute simple modules for an algebra. The crucial step is a Las Vegas algorithm to determine whether a module is irreducible. It performed extremely well when the underlying field of the algebra was small, but over large fields running times were exponential in the size of the input. Improvements due to Holt and Rees, based on calculating characteristic polynomials, dramatically reduced typical running times for large fields, but still gave exponential running times in certain cases. The present paper plugs this gap, so that all modules can be treated in (Las Vegas) polynomial time. The algorithm is available with GAP, and also (by Cannon and Leedham-Green) in MAGMA.
0 references
