Combinatorial method in the coset enumeration of symmetrically generated groups

Authors:
Mohamed Sayed
Affiliations:
Department of Mathematics and Computer Science, Faculty of Science, Kuwait University, Safat, Kuwait
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 2
Cited 0

Symmetric representation of the elements of the Janko group J1

Journal of Symbolic Computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference

Quantified Score

Hi-index	0.00

Visualization

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.