Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms (Q1604369)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms |
scientific article |
Statements
Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms (English)
0 references
4 July 2002
0 references
This paper is a major contribution to the study of random matrices over a finite field. The author is studying conjugacy classes in the group of invertible affine transformations over a finite field. This problem leads to a natural probability measure on the set of all partitions of all positive integers. Using symmetric function theory and Markov chains, Fulman analyzes this measure leading to interesting and nontrivial enumerative results. He derives cycle index generating functions and computes the asymptotic distributions (and convergence rates) for various types of elements in the affine group (as the dimension increases) -- in particular, separable, cyclic and semisimple elements are considered. These results are interesting and will have many applications (for example, in studying derangements). Interesting connections with Rogers-Ramanujan identities and Hall-Littlewood polynomials are made. We refer the reader to the article for details and statements of the results.
0 references
conjugacy classes
0 references
classical groups
0 references
affine groups
0 references
Hall-Littlewood polynomials
0 references
symmetric functions
0 references
random matrices
0 references
partitions
0 references
probability measures
0 references
generating functions
0 references
semisimple elements
0 references
Rogers-Ramanujan identities
0 references
0 references
0 references