| eBook ISBN: | 978-1-4704-0431-4 |
| Product Code: | MEMO/176/830.E |
| List Price: | $66.00 |
| MAA Member Price: | $59.40 |
| AMS Member Price: | $39.60 |
| eBook ISBN: | 978-1-4704-0431-4 |
| Product Code: | MEMO/176/830.E |
| List Price: | $66.00 |
| MAA Member Price: | $59.40 |
| AMS Member Price: | $39.60 |
-
Book DetailsMemoirs of the American Mathematical SocietyVolume: 176; 2005; 90 ppMSC: Primary 05; Secondary 20
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 & Lübeck.
-
Table of Contents
-
Chapters
-
1. Introduction, tables, and preliminaries
-
2. Separable and cyclic matrices in classical groups
-
3. Semisimple and regular matrices in classical groups
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
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 & Lübeck.
-
Chapters
-
1. Introduction, tables, and preliminaries
-
2. Separable and cyclic matrices in classical groups
-
3. Semisimple and regular matrices in classical groups
