A Probabilistic Approach Toward the Finite General Linear and Unitary Groups

@inproceedings{FulmanAPA,
  title={A Probabilistic Approach Toward the Finite General Linear and Unitary Groups},
  author={E. Fulman}
}
  • E. Fulman
Probabilistic algorithms are applied to prove theorems about the nite 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 xed space of a random matrix, and Lusztig's work on counting nilpotent matrices of a given rank.