| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 403341 | Journal of Symbolic Computation | 2009 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
