2014/12/30 by E. Gencheva, Gencheva, E., T. G. Genchev +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1412.8631
openalex publication_date 2014/12/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that the groups PSLn(q) are (2,3)-generated for n=9,10 or 11 and all q. Actually, we find out explicit generators xn and yn of respective orders 2 and 3, for the groups SLn(q).