Deciding finiteness for matrix groups over function fields

DOI10.1007/BF02775029zbMath0932.20051OpenAlexW2014257221MaRDI QIDQ1288492

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

Publication date: 14 December 1999

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

Full work available at URL: https://doi.org/10.1007/bf02775029

zbMATH Keywords

function fieldsdeterministic algorithmsmatrix groupsrandomized algorithmsfiniteness of finitely generated subgroups

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over fields (20H20)

Related Items (7)

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

This page was built for publication: Deciding finiteness for matrix groups over function fields