.png){kind=icon}
.png){kind=icon}
Return
Classical groups, probabilistic methods, and the (2,3)-generation problem
.png){kind=icon}
PRE
AI
DOI：10.2307/2118584.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the probability that randomly chosen elements of prescribed type in a finite simple classical group G generate G; in particular, we prove a conjecture of Kantor and Lubotzky in this area. The probabilistic approach is then used to determine the finite simple classical quotients of the modular group PSL(2)(Z), up to finitely many exceptions.
Keywords:
FINITE CHEVALLEY-GROUPS
MAXIMAL-SUBGROUPS
GENERATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.3
Papers:
1.4K
Citations:
1.6W
Organization
No organization information available