Combinatorial method in the coset enumeration of symmetrically generated groups
Pages 993 - 1001
Abstract
Several finite groups, including all non-abelian finite simple groups, can be generated by finite conjugacy classes of involutions. We describe a coset enumeration algorithm that is particularly developed for a group defined in this manner. We illustrate the process by using some rather small examples for which the enumerations can be worked manually.
References
[1]
Beetham, M. J. (1984) Space saving in coset enumeration. Computational Group Theory, pp. 19-25. Academic Press, London, New York
[2]
Bosma, W., Cannon, J. and Playoust, C. (1997) The MAGMA algebra system I: The user language. J. Symb. Comp., 24, pp. 235-265.
[3]
Bray, J. N. and Curtis, R. T. (2004) Double coset enumeration of symmetrically generated groups. J. Group Theory, 7, pp. 167-185.
[4]
Cannon, J. J., Dimino, L. A., Havas, G. and Watson, J. M. (1973) Implementation and analysis of the Todd-Coxeter algorithm. Math. Comp., 27, pp. 463-490.
[5]
Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A. and Wilson, R. A. (1985) An Atlas of Finite Group, Oxford University Press, Oxford
[6]
Curtis, R. T. (1999) Symmetric generation and existence of the Janko group J1. J. Group Theory, 2, pp. 355-366.
[7]
Curtis, R. T. and Hasan, Z. (1996) Symmetric representation of the elements of the Janko group J1. J. Symb. Comp., 22, pp. 201-214.
[8]
Havas, G. (1991) Coset enumeration strategies, University of Queensland, Key Center for Software Technology, Australia
[9]
Leech, J. (1963) Coset enumeration on digital computers. Proc. Camb. Phill. Soc., 59, pp. 257-267.
[10]
Leech, J. (1984) Coset enumeration. Computational Group Theory, pp. 3-18. Academic Press, London, New York
[11]
Linton, S. A. (1989) The maximal subgroups of the sporadic group Th, Fi24 and Fi24' and other topics, University of Cambridge
[12]
Sayed, M. (1998) Computational methods in symmetric generation of groups, University of Birmingham
[13]
Sayed, M. (2005) Double-coset enumeration algorithm for symmetrically generated groups. Int. J. Math. Sci. 2005, 5, pp. 699-715.
[14]
Sayed, M. (2005) Coset enumeration of groups generated by symmetric sets of Involutions. Int. J. Math. Sci. 2005, pp. 3739-3750.
[15]
Todd, J. A. and Coxeter, S. M. (1936) A practical method for enumerating cosets of finite abstract groups. Proc. Edinburgh Math. Soc., 5, pp. 26-34.
Index Terms
- Combinatorial method in the coset enumeration of symmetrically generated groups
Recommendations
Digraphical Regular Representations of Infinite Finitely Generated Groups
A directed Cayley graphXis called a digraphical regular representation (DRR) of a groupGif the automorphism group ofXacts regularly onX. LetSbe a finite generating set of the infinite cyclic groupZ. We show that a directed Cayley graphX(Z,S) is ...
Generation of Rosary permutations expressed in Hamiltonian circuits
Systematic generation of a specific class of permutations fundamental to scheduling problems is described.
In a nonoriented complete graph with n vertices, Hamiltonian circuits equivalent to 1/2(n - 1)! specific permutations of n elements, termed rosary ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Taylor & Francis, Inc.
United States
Publication History
Published: 01 July 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Feb 2025