Perfect finite groups with balanced presentations

combinatorial-group-theoryfinite-groupsgroup-presentationgroup-theory

A balanced presentation for a group is a presentation with an equal number of generators and relations. A perfect group is a group that is equal to its commutator group.

I am wondering what finite perfect groups are known to admit balanced presentations? I only know two example: the trivial group and the binary icosahedral group $\langle x,y \mid x^2=y^3=(xy)^5\rangle$. What are some other examples?

Best Answer

For more examples see:

C. Campbell, E. Robertson, A deficiency zero presentation for $SL(2,p)$. Bull. London Math. Soc. 12 (1980), no. 1, 17–20.

and, more recently,

C. Campbell, G. Havas, C. Ramsay, E. Robertson, Nice efficient presentations for all small simple groups and their covers. LMS J. Comput. Math. 7 (2004), 266–283.

C. Campbell, G. Havas, C. Ramsay, E. Robertson, All simple groups with order from 1 million to 5 million are efficient. Int. J. Group Theory 3 (2014), no. 1, 17–30.

Here a superperfect group (a perfect group with trivial Schur multiplier) is efficient if and only if it admits a balanced presentation.

The last two papers cover all groups of order up to 5 million.

Related Question