Deciding finiteness of matrix groups in positive characteristic.

DOI10.1016/J.JALGEBRA.2009.08.020zbMATH Open1189.20043OpenAlexW2087159115MaRDI QIDQ2267461FDOQ2267461

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

Publication date 1 March 2010

Published in Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsgeneral linear groupsexponential-time algorithmsfinitely generated matrix groupsorder problemfiniteness problemmatrix groups over function fields

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 new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness problem for finitely generated matrix groups over an arbitrary field. We also give an algorithm to compute the order of a finite matrix group over a function field of positive characteristic. Our MAGMA implementations of these algorithms are publicly available.

Recommendations

• On deciding finiteness of matrix groups.
• On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic
• Recognizing finite matrix groups over infinite fields.
• Deciding finiteness for matrix groups over function fields
• scientific article; zbMATH DE number 1263310

Cites work

• scientific article; zbMATH DE number 3815938 (Why is no real title available?)
• scientific article; zbMATH DE number 3749242 (Why is no real title available?)
• scientific article; zbMATH DE number 3496414 (Why is no real title available?)
• scientific article; zbMATH DE number 1263310 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• Algorithms for computing with nilpotent matrix groups over infinite domains.
• Deciding finiteness for matrix groups over function fields
• Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals
• On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic
• On deciding finiteness of matrix groups.
• The Magma algebra system. I: The user language

Cited in

(9)

• scientific article; zbMATH DE number 1263310 (Why is no real title available?)
• Algorithms for linear groups of finite rank.
• On deciding finiteness of matrix groups.
• A characterization of matrix groups that act transitively on the cone of positive definite matrices
• Testing polycyclicity of finitely generated rational matrix groups
• Recognizing finite matrix groups over infinite fields.
• Linear groups and computation
• Algorithms for the Tits alternative and related problems.
• On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic

Describes a project that uses

Uses Software

• Magma
• Nilmat

This page was built for publication: Deciding finiteness of matrix groups in positive characteristic.

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