Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.26493/1855-3974.455.422 | ARS MATHEMATICA CONTEMPORANEA |
Keywords | Field | DocType |
Computational methods in group theory,lattices of subgroups | Discrete mathematics,Combinatorics,Classification of finite simple groups,Lattice (order),Fitting subgroup,Permutation group,Atlas (anatomy),Maximal subgroup,CA-group,Mathematics,Simple group | Journal |
Volume | Issue | ISSN |
8 | 2 | 1855-3966 |
Citations | PageRank | References |
1 | 0.41 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| thomas connor | 1 | 2 | 0.80 |
| Dimitri Leemans | 2 | 38 | 15.96 |