2008/05/24 by Henrik Bäärnhielm, Bäärnhielm, Henrik · 1 citation
Computer Science · Engineering · Mathematics · #20-04 #20C40 #68Q25 #68W20 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group Theory (math.GR) #cs.DS #graph theory and CDMA systems #math.GR #msc:20-04 #msc:20C40 #msc:68Q25 #msc:68W20
paper · pdf · doi:10.48550/arxiv.0805.3742
The author's PhD thesis
openalex publication_date 2008/05/24 · arxiv created 2008/06/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02
This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive membership testing. We also consider problems of generating and conjugating Sylow and maximal subgroups. The algorithms are motivated by, and form a part of, the Matrix Group Recognition Project. Obtaining both theoretically and practically efficient algorithms has been a central goal. The algorithms have been developed with, and implemented in, the computer algebra system MAGMA.