| __Base and Strong Generator Functions__ *(Site not responding. Last check: 2007-10-08)* |

| | Construct a presentation for the matrix group G on a set of **strong** generators and return the presentation in the form of a finitely presented group F that is isomorphic to G. In Magma, the Todd-Coxeter Schreier algorithm is used to construct the presentation. |

| | If **strong** generators have to be constructed, the parameter Random with its associated parameters Max and Run may be used to apply the Random Schreier algorithm to construct a probable BSGS before commencing the construction of the presentation. |

| | Given a matrix group G for which a **base** and **strong** generating set are known, and an integer i, where 1 <= i <= k with k the length of the **base**, return the subgroup of G which fixes the first i - 1 points of the **base**. |

| www.sci.kuniv.edu.kw /magma/text285.html (1169 words) |