arXiv · math/9712238
A probabilistic approach toward the finite general linear and unitary groups
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jason Fulman. 1997-12-09. A probabilistic approach toward the finite general linear and unitary groups. https://searcharxiv.com/abs/math/9712238
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.