On deciding finiteness of matrix groups

Authors:
A. S. Detinko;D. L. Flannery
Affiliations:
School of Mathematics, Statistics and Applied Mathematics, National University of Ireland, Galway, Ireland;School of Mathematics, Statistics and Applied Mathematics, National University of Ireland, Galway, Ireland
Venue:
Journal of Symbolic Computation
Year:
2009

Citing 4
Cited 1

Deciding finiteness of matrix groups in Las Vegas polynomial time

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Deciding finiteness of matrix groups in deterministic polynomial time

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Algorithms for computing with nilpotent matrix groups over infinite domains

Journal of Symbolic Computation

Recognizing finite matrix groups over infinite fields

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a new, practical algorithm for deciding finiteness of matrix groups over function fields of zero characteristic. The algorithm has been implemented in GAP. Experimental results and extensions of the algorithm to any field of zero characteristic are discussed.