Treating the Exceptional Cases of the MeatAxe

DOI10.1080/10586458.2000.10504414zbMath0966.16028OpenAlexW2015416631MaRDI QIDQ4526080

Klaus Lux, Gábor Ivanyos

Publication date: 11 July 2001

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1045604672

zbMATH Keywords

polynomial time algorithmsLas Vegas algorithmsrunning timescomputation of simple modulesMetaAxe

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Simple and semisimple modules, primitive rings and ideals in associative algebras (16D60) Computational aspects of associative rings (general theory) (16Z05) Randomized algorithms (68W20)

Related Items (16)

The Solvable Primitive Permutation Groups of Degree at Most 6560 ⋮ Identification of matrix generators of a Chevalley group. ⋮ Groups acting on tensor products. ⋮ Recognising the small Ree groups in their natural representations. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS ⋮ A counterexample to a conjugacy conjecture of Steinberg ⋮ The module isomorphism problem reconsidered. ⋮ Computing isometry groups of Hermitian maps ⋮ A practical model for computation with matrix groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Testing isomorphism of modules. ⋮ The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices ⋮ Recognising the Suzuki groups in their natural representations. ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Towards an efficient meat-axe algorithm using \(f\)-cyclic matrices: The density of uncyclic matrices in M\((n,q)\)

Uses Software

• GAP
• MeatAxe

Cites Work

• Nearly Optimal Algorithms for Canonical Matrix Forms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Treating the Exceptional Cases of the MeatAxe