Calculating subgroups with GAP

DOI10.1007/978-981-13-2047-7_5MaRDI QIDQ6599585zbMATH OpenFDO

Authors A. Hulpke

Publication date 6 September 2024

Full work available at URL https://doi.org/10.1007/978-981-13-2047-7_5

Mathematics Subject Classification ID

Finite simple groups and their classification (20D05) Series and lattices of subgroups (20D30) Subgroup theorems; subgroup growth (20E07) Computational methods for problems pertaining to group theory (20-08)

Cites work

• scientific article; zbMATH DE number 3871623 (Why is no real title available?)
• scientific article; zbMATH DE number 4055862 (Why is no real title available?)
• scientific article; zbMATH DE number 4081802 (Why is no real title available?)
• scientific article; zbMATH DE number 3710402 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 1254012 (Why is no real title available?)
• scientific article; zbMATH DE number 1284153 (Why is no real title available?)
• scientific article; zbMATH DE number 1004935 (Why is no real title available?)
• scientific article; zbMATH DE number 1076948 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 194815 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• A data structure for a uniform approach to computations with finite groups
• A practical model for computation with matrix groups.
• Automorphism group computation and isomorphism testing in finite groups
• Calculation of the subgroups of a trivial-Fitting group
• Computing conjugacy class representatives in permutation groups.
• Computing conjugacy classes of elements in matrix groups.
• Computing maximal subgroups of finite groups.
• Computing subgroups invariant under a set of automorphisms
• Computing subgroups of bounded index in a finite group.
• Computing the maximal subgroups of a permutation group. I
• Computing the subgroups of a permutation group
• Conjugacy classes in finite permutation groups via homomorphic images
• Effective black-box constructive recognition of classical groups.
• Finding intermediate subgroups
• Generating random elements of a finite group
• Isomorphism testing for \(p\)-groups
• On minimal faithful permutation representations of finite groups
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Polynomial-time theory of matrix groups
• Short presentations for finite groups
• Some applications of the first cohomology group
• Some remarks on the computation of complements and normalizers in soluble groups
• Some remarks on the computation of conjugacy classes of soluble groups
• Standard generators for sporadic simple groups
• Strong bias of group generators: an obstacle to the “product replacement algorithm”
• Studies of the lattice of subgroups of finite groups using a programmable electronic dual machine
• The maximal subgroups of the low-dimensional finite classical groups.
• Über die Darstellung der endlichen Gruppen als Untergruppen direkter Produkte.

Cited in

(1)

• Anomalies of average symmetries: entanglement and open quantum systems

This page was built for publication: Calculating subgroups with GAP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599585)