Calculating subgroups with GAP
From MaRDI portal
Publication:6599585
DOI10.1007/978-981-13-2047-7_5zbMATH Open1544.20003MaRDI QIDQ6599585
Publication date: 6 September 2024
Subgroup theorems; subgroup growth (20E07) Series and lattices of subgroups (20D30) Finite simple groups and their classification (20D05) Computational methods for problems pertaining to group theory (20-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective black-box constructive recognition of classical groups.
- A practical model for computation with matrix groups.
- Some applications of the first cohomology group
- Studies of the lattice of subgroups of finite groups using a programmable electronic dual machine
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Computing subgroups invariant under a set of automorphisms
- Isomorphism testing for \(p\)-groups
- Peakword condensation and submodule lattices: An application of the Meat- Axe
- Short presentations for finite groups
- Automorphism group computation and isomorphism testing in finite groups
- Über die Darstellung der endlichen Gruppen als Untergruppen direkter Produkte.
- Standard generators for sporadic simple groups
- Finding intermediate subgroups
- Computing conjugacy classes of elements in matrix groups.
- Computing subgroups of bounded index in a finite group.
- Computing conjugacy class representatives in permutation groups.
- Some remarks on the computation of complements and normalizers in soluble groups
- Computing maximal subgroups of finite groups.
- The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
- A data structure for a uniform approach to computations with finite groups
- Calculation of the subgroups of a trivial-fitting group
- On minimal faithful permutation representations of finite groups
- Conjugacy classes in finite permutation groups via homomorphic images
- Some remarks on the computation of conjugacy classes of soluble groups
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- Generating random elements of a finite group
- Polynomial-time theory of matrix groups
- Computing the subgroups of a permutation group
Related Items (1)
This page was built for publication: Calculating subgroups with GAP
