Deciding finiteness for matrix groups over function fields

LetF be a field andt an indeterminate. In this paper we consider aspects of the problem of deciding if a finitely generated subgroup of GL(n,F(t)) is finite. WhenF is a number field, the analysis may be easily reduced to deciding finiteness for subgroups of GL(n,F), for which the results of [1] can be applied. WhenF is a finite field, the situation is more subtle. In this case our main results are a structure theorem generalizing a theorem of Weil and upper bounds on the size of a finite subgroup generated by a fixed number of generators with examples of constructions almost achieving the bounds. We use these results to then give exponential deterministic algorithms for deciding finiteness as well as some preliminary results towards more efficient randomized algorithms.

[1]  Leonard Eugene Dickson,et al.  Algebras and Their Arithmetics , 1924 .

[2]  A. Weil On the Analogue of the Modular Group in Characteristic p , 1970 .

[3]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[4]  C. Soulé Homological Group Theory: Chevalley groups over polynomial rings , 1979 .

[5]  C. Wall Homological Group Theory , 1980 .

[6]  D. Gorenstein Finite Simple Groups: An Introduction to Their Classification , 1982 .

[7]  D. Gorenstein Finite Simple Groups: An Introduction to Their Classification , 1982 .

[8]  Daniel Gorenstein The Classification of Finite Simple Groups , 1983 .

[9]  Lajos Rónyai,et al.  Polynomial time solutions of some problems of computational algebra , 1985, STOC '85.

[10]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[11]  Cheryl E. Praeger,et al.  A Recognition Algorithm for Special Linear Groups , 1992 .

[12]  D. Rockmore,et al.  Computation of L-series for elliptic curves over function fields. , 1992 .

[13]  Jeffrey Adams,et al.  Representation Theory of Groups and Algebras , 1993 .

[14]  László Babai,et al.  Deciding finiteness of matrix groups in deterministic polynomial time , 1993, ISSAC '93.

[15]  László Babai,et al.  Las Vegas algorithms for matrix groups , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  Cheryl E. Praeger,et al.  Implementing a recognition algorithm for classical groups , 1995, Groups and Computation.

[17]  S. Friedland Discrete groups of unitary isometries and balls in hyperbolic manifolds , 1996 .

[18]  W. Kantor,et al.  Groups and Computation II , 1997 .

[19]  Cheryl E. Praeger,et al.  A Recognition Algorithm For Classical Groups Over Finite Fields , 1998 .

[20]  Robert Beals Algorithms for Matrix Groups and the Tits Alternative , 1999, J. Comput. Syst. Sci..