We describe an algorithm to compute a composition tree for a matrix group defined over a finite field, and show how to use the associated structure to carry out computations with such groups; these… (More)

Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q),… (More)

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… (More)

Here follows brief details about my other activities as a PhD student at QMUL. recognition of the Suzuki groups " • MAGMA Workshop on Group Theory and Algebraic Geometry, University of Warwick,… (More)

We present a new algorithm for constructive recognition of the Suzuki groups in their natural representations. The algorithm runs in Las Vegas polynomial time given a discrete logarithm oracle. An… (More)

We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups G2(q) = Ree(q), where q = 3 for some m > 0, in their natural representations of… (More)

We present three extensions to the product replacement algorithm. First we prove that the well-known accumulator extension does not increase the mixing time. Then we present a new heuristic… (More)

For the technology supported Nordic LARP <i>The Monitor Celestra</i> in March 2013, we built a sound system to support deep immersion into the game world using a Haskell-embedded Domain Specific… (More)