Algorithmic enumeration of regular maps

Thomas Connor, Dimitri Leemans


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.


Regular map, O'Nan sporadic simple group, subgroup lattice, character table

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications