Mathematics – Group Theory
Scientific paper
1997-12-09
Mathematics
Group Theory
14 pages
Scientific paper
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.
No associations
LandOfFree
A probabilistic approach toward the finite general linear and unitary groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A probabilistic approach toward the finite general linear and unitary groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A probabilistic approach toward the finite general linear and unitary groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-16491