coset enumeration of groups generated by symmetric sets of involutions陪集枚举对称组退化产生的组织.pdfVIP

COSET ENUMERATION OF GROUPS GENERATED BY SYMMETRIC SETS OF INVOLUTIONS MOHAMED SAYED Received 4 June 2005 and in revised form 9 October 2005 All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm which performs coset enumeration for a group defined in this manner on the cosets of a subgroup of automorphisms of these involutions is presented. 1. Introduction The well-known Todd-Coxeter algorithm [ 14], which may be viewed as a means of con- structing permutation representations of finitely presented groups, remains a primary reference for coset enumeration programs. All the strategies and variants of this algo- rithm perform essentially the same calculations as the original algorithm, merely choos- ing different orders in which to process the available information. A statement of the basic technique and the early study appear in [7, 8]. A detailed survey and comparison of different strategies are given in [2]. A contemporary work is described in [6, 9]. In more recent work, see [11, 12], we developed two related algorithms for enumerat- ing single and double cosets of any group generated by a finite conjugacy class of invo- lutions. Several finite groups, including all non-abelian finite simple groups, can be sym- metrically generated by involutions. Curtis showed how various sporadic simple groups can be so generated, see for instance [4]. The enumerator described in this paper, which can still be viewed as another vari- ant of the Todd-Coxeter algorithm, has substantial improvements (for space, speed, and simplicity of programming) to the version described in [11]. In particular, the additional algebraic information, in the form of coset stabilizing subgroups, is not needed. 2. Involutory symmetric generation of groups Let G be a group and let T = {t , t , ... , t } be a set of elements of order m in G. Making 0 1 n−1 the definitions T = t and T = {T