## Abstract

There is much interest in finding short presentations for the finite simple groups. In a previous paper we produced nice efficient presentations for all small simple groups and for their covering groups. Here we extend those results from simple groups of order less than 100,000 up to order one million, but we leave one simple group and one covering group for which the efficiency question remains unresolved. We give presentations that are better than what was previously available, in terms of length and in terms of computational properties, in the process answering two previously unresolved problems about the efficiency of covering groups of simple groups. Our results are based on major amounts of computation. We make substantial use of systems for computational group theory and, in particular, of computer implementations of coset enumeration.

Original language | English |
---|---|

Pages (from-to) | 347-358 |

Number of pages | 12 |

Journal | Experimental Mathematics |

Volume | 16 |

Publication status | Published - 2007 |

## Keywords

- efficient presentations
- simple groups
- covering groups
- PRESENTATIONS