scientific article; zbMATH DE number 1004928
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].
- Polynomial-time theory of matrix groups
- scientific article; zbMATH DE number 1004942
- Practical algorithms for polycyclic matrix groups
- scientific article; zbMATH DE number 1263310
- A practical algorithm for finding matrix representations for polycyclic groups
- Algorithms for matrix groups and the Tits alternative
- Algorithms for polycyclic-by-finite groups
- Complexity and computation in matrix groups.
- scientific article; zbMATH DE number 3924140
- Algorithms for matrix groups and the Tits alternative
- Practical algorithms for polycyclic matrix groups
- Constructing composition factors for a linear group in polynomial time
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Deterministic algorithms for management of matrix groups.
- Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
- Computing with matrix groups over infinite fields.
- scientific article; zbMATH DE number 4057755 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- Algorithms for arithmetic groups with the congruence subgroup property.
- On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- Constructive membership tests in some infinite matrix groups
- Polynomial-time theory of matrix groups
- Towards effective algorithms for linear groups.
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
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)