Sciweavers

IJCM
2008

Combinatorial method in the coset enumeration of symmetrically generated groups

13 years 11 months ago
Combinatorial method in the coset enumeration of symmetrically generated groups
We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial automorphisms. Lots of finite groups, including some of the sporadic simple groups can be defined in this mannar. Mathematics Subject Classification: 20Bxx
Mohamed Sayed
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IJCM
Authors Mohamed Sayed
Comments (0)