Recognizing finite matrix groups over infinite fields.

DOI10.1016/J.JSC.2012.04.002MaRDI QIDQ1930160zbMATH OpenOpenAlexFDO

Authors E. A. O'Brien, A. S. Detinko, D. L. Flannery

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.04704

zbMATH Keywords

algorithmsfinite linear groupsdecision problemsfinitely generated linear groupsfiniteness problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over fields (20H20)

Abstract: We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field, and uses this copy to investigate the group's structure. Implementations of our algorithms are available in MAGMA.

Recommendations

• Deciding finiteness of matrix groups in positive characteristic.
• On deciding finiteness of matrix groups.
• Computing with matrix groups over infinite fields.
• Deciding finiteness for matrix groups over function fields
• scientific article; zbMATH DE number 1263310

Cited in

(19)

• The use of permutation representations in structural computations in large finite matrix groups
• Algorithms for arithmetic groups with the congruence subgroup property.
• Algorithms for linear groups of finite rank.
• On deciding finiteness of matrix groups.
• Algorithms for Experimenting with Zariski Dense Subgroups
• Integrality and arithmeticity of solvable linear groups.
• Practical Computation with Linear Groups Over Infinite Domains
• A practical model for computation with matrix groups.
• Zariski density and computing in arithmetic groups
• A note on group representations, determinantal hypersurfaces and their quantizations
• Computing a chief series and the soluble radical of a matrix group over a finite field.
• Algorithms for computing with nilpotent matrix groups over infinite domains.
• Computing with matrix groups over infinite fields.
• Proving infinite index for a subgroup of matrices
• Deciding finiteness of matrix groups in positive characteristic.
• Linear groups and computation
• scientific article; zbMATH DE number 742945 (Why is no real title available?)
• Classifying finite monomial linear groups of prime degree in characteristic zero
• On the geometry of symmetry breaking inequalities

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Recognizing finite matrix groups over infinite fields.

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