scientific article; zbMATH DE number 1004928

From MaRDI portal
Publication:4335290





The paper describes polynomial time algorithms for finitely generated matrix groups. For a given finitely generated matrix group \(G\) with generating set \(S\), the following computational problems are addressed: Constructive membership test of a matrix \(x\) (where \(G\) is finite), computation of a presentation for \(G\), determination whether or not \(G\leq\text{GL}(n,F)\) is finite, \(F\) an algebraic number field, and determination whether or not \(G\) is solvable. In particular, algorithms for the following subproblems are given: recognition of simple groups, determination of normal closure \(\langle x^G\rangle\) of \(x\in G\) in \(G\), construction of manageable representations, i.e., finding an effective homomorphism from \(G\) to a manageable group, and, in particular, construction of manageable representations of simple groups. For the entire collection see [Zbl 0861.00012].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335290)