Deciding finiteness for matrix groups over function fields

DOI10.1007/BF02775029zbMath0932.20051MaRDI QIDQ1288492

Daniel N. Rockmore, Ki-Seng Tan, Robert Beals

Publication date: 14 December 1999

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

function fields; deterministic algorithms; matrix groups; randomized algorithms; finiteness of finitely generated subgroups

Mathematics Subject Classification ID

20E07: Subgroup theorems; subgroup growth

20F05: Generators, relations, and presentations of groups

20-04: Software, source code, etc. for problems pertaining to group theory

20H20: Other matrix groups over fields

Related Items

On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic, Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals, On deciding finiteness of matrix groups., A note on the order of finite subgroups of \(\text{GL}(n,\mathbb{Z})\), Deciding finiteness of matrix groups in positive characteristic., Quantum automata and algebraic groups

Cites Work

• Discrete groups of unitary isometries and balls in hyperbolic manifolds
• A Recognition Algorithm for Special Linear Groups
• On the Analogue of the Modular Group in Characteristic p
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item