A probabilistic approach toward the finite general linear and unitary groups
Group Theory
2007-05-23 v1 Probability
Abstract
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's count of unipotent elements, Rudvalis and Shindoda's work on the fixed space of a random matrix, and Lusztig's work on counting nilpotent matrices of a given rank.
Cite
@article{arxiv.math/9712238,
title = {A probabilistic approach toward the finite general linear and unitary groups},
author = {Jason Fulman},
journal= {arXiv preprint arXiv:math/9712238},
year = {2007}
}
Comments
14 pages