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

algorithmsdecision problemsfinite linear groupsfinitely generated linear groupsfiniteness problem

Mathematics Subject Classification ID

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

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.

Review text

The authors continue their investigations into computation with finitely generated matrix groups over infinite fields (see, for example, \textit{A. S. Detinko} and \textit{D. L. Flannery}, J. Symb. Comput. 44, No. 8, 1037-1043 (2009; Zbl 1172.20310)] and the authors [J. Algebra 344, No. 1, 397-406 (2011; Zbl 1245.20062)]). The primary tool is the use of congruence homomorphisms to map a finitely generated matrix group \(G\) over an infinite field onto a matrix group of the same degree over a finite field \(K\) of characteristic \(p\), say; all the torsion elements in the kernel are \(p\)-elements. For finitely generated matrix groups \(G\) over quite general fields this enables the construction of a normal subgroup \(N\) of finite index in \(G\) such that \(N\) is torsion free (the authors call such a subgroup an SW-subgroup). This construction can then be used to decide whether \(G\) is finite and, if so, compute an isomorphic copy of \(G\) as a matrix group over a finite field, and hence determine various properties of \(G\). Some of the algorithms described have been implemented in the package \texttt{Infinite} in \texttt{Magma}, and examples of typical runtimes are provided.

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)

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

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)