MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need to know some properties of the perfect group of order $190080$ which is the Schur cover of the Mathieu group ${\rm M}_{12}$, but when using PerfectGroup(190080), GAP runs so slowly. Is there any other method in GAP for getting this group?

share|cite|improve this question

Just write

gap> G := PerfectGroup(IsPermGroup,190080);
M12 2^1

in order to get the desired group as a permutation group:

gap> GeneratorsOfGroup(G);
[ (3,6)(7,10)(9,12)(13,16)(15,18)(19,22)(20,23)(21,24),

Now computations should be fast. (If you omit the first argument, you get the group as a finitely presented group, and computations with such groups are inefficient for the obvious reasons.)

share|cite|improve this answer
Thank you veryyyy much. Your advice was really useful. – Sara Jan 5 at 18:02
One more problem. How I can find the representation of a finite group as a permutation group, because by order GeneratorsOfGroup, generators obtained by a and b .... – Sara Jan 5 at 18:52
@Sara: You can obtain a faithful permutation representation of a finite group $G$ by IsomorphismPermGroup($G$), and the isomorphic permutation group is Image(IsomorphismPermGroup($G$)). – Stefan Kohl Jan 5 at 19:28
Thank you very much. This solve my problem – Sara Jan 5 at 19:42
@Sara It may be worth pointing out that IsomorphismPermGroup is not necessarily of smallest degree. To get a smaller degree permutation representation of a permutation group, use SmallerDegreePermutationRepresentation to get a faithful representation of (potentially) smaller degree. Take the Image as before to get the actual permutation group. This still doesn't guarantee the smallest possible degree representation, but computations tend to be faster in smaller degree so it is helpful to reduce the degree like this. – zibadawa timmy Mar 26 at 23:39

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.