Finding intermediate subgroups

DOI10.4171/PM/2002MaRDI QIDQ2413195zbMATH OpenOpenAlexFDO

Authors A. Hulpke

Publication date 9 April 2018

Published in Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.00769

zbMATH Keywords

algorithmintervallatticesubgroups

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) General theory for finite permutation groups (20B05) Series and lattices of subgroups (20D30) Symbolic computation and algebraic computation (68W30)

Abstract: This article describes a practical approach for determining the lattice of subgroups U < V < G between given subgroups U and G, provided the total number of such subgroups is not too large. It builds on existing functionality for element conjugacy, double cosets and maximal subgroups.

Recommendations

• scientific article; zbMATH DE number 848018
• scientific article; zbMATH DE number 665466
• On intersections of subgroups in groups
• scientific article; zbMATH DE number 6967854
• Finding non-trivial elements and splittings in groups.
• Intermediately fully invariant subgroups of abelian groups
• Intersecting subgroups of finite soluble groups
• Identifying congruence subgroups of the modular group
• Subgroups and the Partitioning Property
• scientific article; zbMATH DE number 1148347

Cited in

(2)

• Directed subgroup graph for studying the subgroup properties of finite groups
• Calculating subgroups with GAP

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Finding intermediate subgroups

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