scientific article; zbMATH DE number 1004928

MaRDI QIDQ4335290zbMATH OpenFDO

Authors Robert Beals

Publication date 8 January 1998

zbMATH Keywords

algebraic number fieldsfinitely generated matrix groupsgenerating setsmanageable representations of simple groupspolynomial time algorithmspresentations

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Representation theory for linear algebraic groups (20G05) Linear algebraic groups over global fields and their integers (20G30) Symbolic computation and algebraic computation (68W30)

Recommendations

• 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

Cited in

(17)

• 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)