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.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:518094 |
| Date | January 2009 |
| Creators | Costi, Elliot Mark |
| Publisher | Queen Mary, University of London |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://qmro.qmul.ac.uk/xmlui/handle/123456789/28509 |
Page generated in 0.0019 seconds