Constructive recognition of classical matrix groups in even characteristic

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review


Let G = hXi be isomorphic to a classical matrix group H = hSi ≤ GL(d, q)in natural representation, where S is a nice generating set. For example, one can efficiently write an arbitrary element of H as a word in S. Informally, a constructive recognition algorithm constructs an effective isomorphism from G to H, and vice versa. An approach for doing this is to consider a generating set S′ ⊆ G corresponding to S, and to write the elements of S′ as words in X. If every element of G can efficiently be written as a word in S′, then the isomorphisms G ↔ H defined by S′ ↔ S are effective since images can be computed readily. For example, if g ∈ G is written as a word w(S′) in S′, then the image of g in H is easily determined as w(S). Thus, instead of working in G, this allows us to work in the nice group H.
Original languageEnglish
Title of host publicationMathematisches Forschungsinstitut Oberwolfach
Subtitle of host publicationReport No. 37/2011 - Computational Group Theory
Place of PublicationGermany
PublisherMathematisches Forschungsinstitut Oberwolfach
Number of pages2
Publication statusPublished - 2011

Cite this