A generating function approach to the enumeration of matrices in classical groups over finite fields
Author(s)
Bibliographic Information
A generating function approach to the enumeration of matrices in classical groups over finite fields
（Memoirs of the American Mathematical Society, no. 830）
American Mathematical Society, c2005
Available at / 16 libraries
-
No Libraries matched.
- Remove all filters.
Note
"Volume 176, number 830 (second of 4 numbers)"
Bibliography: p. 89-90
Description and Table of Contents
Description
Generating function techniques are used to study the probability that an element of a classical group defined over a finite field is separable, cyclic, semisimple or regular. The limits of these probabilities as the dimension tends to infinity are calculated in all cases, and exponential convergence to the limit is proved. These results complement and extend earlier results of the authors, G. E. Wall, and Guralnick & Lubeck.
Table of Contents
Introduction, tables, and preliminaries Separable and cyclic matrices in classical groups Semisimple and regular matrices in classical groups Bibliography.
by "Nielsen BookData"
