A probabilistic approach toward the finite general linear and unitary groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages

Keywords

Group Theory, Probability, 20G40;60B99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/76418

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9712238
 http://arxiv.org/abs/math/9712238

Collections

arXiv