An atlas of subgroup lattices of finite almost simple groups

Thomas Connor, Dimitri Leemans


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 automatizes 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.


Computational methods in group theory, lattices of subgroups

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