A probabilistic approach toward the finite general linear and unitary groups

Simple item page
dc.creatorFulman, Jason
dc.date1997-12-09
dc.date.accessioned2026-07-07T05:23:23Z
dc.date.available2026-07-07T05:23:23Z
dc.descriptionProbabilistic 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/9712238
dc.identifierhttp://arxiv.org/abs/math/9712238
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76418
dc.subjectGroup Theory
dc.subjectProbability
dc.subject20G40;60B99
dc.titleA probabilistic approach toward the finite general linear and unitary groups
dc.typetext

Files

Collections

arXiv