Creating a dynamic database of finite groups
This article describes the abstract finite groups database added to the \(L\)-functions and Modular Forms Database (LMFDB). The database contains data for over \(540,000\) finite groups, \(275\) million subgroups and almost \(40\) million irreducible complex characters. It is dynamically searchable: many invariants and properties are precomputed, so that users can search by structural properties, subgroup data, character data, and related constructions without carrying out the corresponding computations directly in GAP or Magma.\N\NThe data come from several sources, including the Small Groups library, the transitive groups database, classical groups, matrix groups, perfect groups, sporadic groups, and automorphism groups of curves. The authors compute, when feasible, subgroup lattices up to conjugacy or automorphism, conjugacy classes, character tables, special subgroups such as the centre, commutator subgroup, Frattini subgroup and Fitting subgroup, as well as series, presentations, and representations. For solvable groups, they discuss methods for producing more human-readable polycyclic presentations.\N\NThe article also explains the labeling of groups, conjugacy classes, divisions, characters, and subgroups. These labels are intended to give permanent identifiers, compatible with GAP Small Groups labels when the ranges overlap. The final part describes links between the abstract groups database and other parts of the LMFDB, including Galois groups, number fields, \(p\)-adic fields, Artin representations, modular curves, Sato-Tate groups and automorphism groups of curves.\N\NFor the entire collection see [Zbl 08203827].
- \(\ell\)-adic images of Galois for elliptic curves over \(\mathbb{Q}\)(and an appendix with John Voight)
- A census of small transitive groups and vertex-transitive graphs
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Addendum to ``On the groups of cube-free order.
- Artin \(L\)-functions of small conductor
- Constructing transitive permutation groups.
- Construction of finite groups
- Galois properties of points of finite order of elliptic curves
- Groups and nilpotent Lie rings whose order is the sixth power of a prime.
- Groups whose orders factorise into at most four primes
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1505376 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- Matrix generators for exceptional groups of Lie type
- Matrix generators for the orthogonal groups
- On the groups of cube-free order.
- On Transitive Permutation Groups
- Sato-Tate distributions and Galois endomorphism modules in genus 2
- Stronger arithmetic equivalence
- The \(p\)-group generation algorithm
- The groups of order 256
- The groups of order at most 1000 except 512 and 768
- The groups of order at most 2000
- THE GROUPS OF ORDER qn· p
- The groups with order p^7 for odd prime p.
- The Klein quartic in number theory
- The Magma algebra system. I: The user language
- The Transitive Permutation Groups of Degree 32
This page was built for publication: Creating a dynamic database of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286271)