• Citer

Algorithmic enumeration of regular maps

par Connor, Thomas ;Leemans, Dimitri
Référence Ars Mathematica contemporanea, 10, 2, page (211-222)
Publication Publié, 2016

Article révisé par les pairs

• Détails
• Contenu

Résumé :

Given a finite group G, we describe an algorithm that enumerates the regular maps having G as rotational subgroup, using the knowledge of its table of ordinary characters and its subgroup lattice. To show the efficiency of our algorithm, we use it to compute that, up to isomorphism, there are 796,772 regular maps whose rotational subgroup is the sporadic simple group of O'Nan and Sims.