Return to search

Constructive membership testing in classical groups

Let G be a perfect classical group defined over a finite field F and generated by a set of standard generators X. Let E be the image of an absolutely irreducible representation of G by matrices over a field of the natural characteristic. Given the image of X in E, we present algorithms that write an arbitrary element of E as a straight-line programme in this image of X in E. The algorithms run in polynomial time.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:518094
Date January 2009
CreatorsCosti, Elliot Mark
PublisherQueen Mary, University of London
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttp://qmro.qmul.ac.uk/xmlui/handle/123456789/28509

Page generated in 0.0019 seconds