double-coset enumeration algorithm for symmetrically generated groupsdouble-coset枚举算法生成对称组.pdfVIP

DOUBLE-COSET ENUMERATION ALGORITHM FOR SYMMETRICALLY GENERATED GROUPS MOHAMED SAYED Received 25 March 2004 and in revised form 13 January 2005 A double-coset enumeration algorithm for groups generated by symmetric sets of invo- lutions together with its computer implementation is described. 1. Introduction The Todd-Coxeter algorithm described in [ 13] remains a primary reference for coset enu- meration programs. It may be viewed as a means of constructing permutation represen- tations of finitely presented groups. A number of effective computer programs for single- coset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial reduction in total cosets defined which leads to minimizing the storage (and time) needed. In [8, 9] Linton has developed two double-coset enumeration programs. The process in the earlier one, which is a corrected version of the algorithm proposed in [3], is viewed as a direct generalization of the ordinary single-coset enumeration. The later one is related to the present algorithm but with different calculations. In this paper, we present a double-coset enumeration algorithm which is specially de- veloped for groups symmetrically generated by involutions. Several finite groups, includ- ing all nonabelian finite simple groups, can be generated by symmetric sets of involu- tions, see, for example, [6, 10, 11]. The algorithm has been implemented as a Magma [1] program and this implementation has been used with success to check symmetric presentations for many finite simple groups. 2. Involutory symmetric generators of groups Let G be a group and let T = {t , t , ... , t } be a set of elements of order m in G. Defining 0 1 n−1 T = t and T = {T , T , ... , T } allows us to define N = (T), the set normalizer in i i 0 1 n−1 G G