Computing subgroups by exhibition in finite solvable groups
From MaRDI portal
Recommendations
- Intersecting subgroups of finite soluble groups
- Some remarks on the computation of complements and normalizers in soluble groups
- Computing projectors, injectors, residuals and radicals of finite soluble groups
- Computing intersections and normalizers in soluble groups
- Computing maximal subgroups of finite groups.
Cites work
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 1004933 (Why is no real title available?)
- A finite soluble quotient algorithm
- An internal approach to covering groups
- Computing the order of a solvable permutation group
- Finite soluble groups
- On internal formation theory
- Some remarks on the computation of complements and normalizers in soluble groups
- The \(\mathfrak F\)-normalizers of a finite soluble group
- Towards a soluble quotient algorithm
- Zur Theorie der endlichen auflösbaren Gruppen
Cited in
(6)- Special polycyclic generating sequences for finite soluble groups.
- Filters compatible with isomorphism testing
- Computing projectors, injectors, residuals and radicals of finite soluble groups
- Solving a class of higher-order equations over a group structure
- Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality
- scientific article; zbMATH DE number 3959779 (Why is no real title available?)
This page was built for publication: Computing subgroups by exhibition in finite solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599538)
