par Connor, Thomas
;Leemans, Dimitri 
Référence Ars Mathematica contemporanea, 8, 2, page (259-266)
Publication Publié, 2015


Référence Ars Mathematica contemporanea, 8, 2, page (259-266)
Publication Publié, 2015
Article révisé par les pairs
Résumé : | We provide algorithms to compute and produce subgroup lattices of finite permutation groups. We discuss the problem of naming groups and we propose an algorithm that au-tomatizes the naming of groups, together with possible ways of refinement. Finally we announce an atlas of subgroup lattices for a large collection of finite almost simple groups made available online. |