Computing the soluble radical of a permutation group.
From MaRDI portal
Recommendations
- Computing the order of a solvable permutation group
- scientific article; zbMATH DE number 3558069
- On the solvability of a group with permutable subgroups.
- scientific article; zbMATH DE number 1004937
- scientific article; zbMATH DE number 975405
- Computing Sylow subgroups in permutation groups
- Computing the subgroups of a permutation group
- On the number of conjugates defining the solvable radical of a finite group.
- Permutability in finite soluble groups
- Characterization of solvable groups and solvable radical.
Cites work
- Automorphism group computation and isomorphism testing in finite groups
- Computing maximal subgroups of finite groups.
- Computing Sylow subgroups in permutation groups
- Computing the subgroups of a permutation group
- Computing with group homomorphisms
- Constructing transitive permutation groups.
- scientific article; zbMATH DE number 3989617 (Why is no real title available?)
- scientific article; zbMATH DE number 1254012 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 1004937 (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 1849958 (Why is no real title available?)
- On minimal faithful permutation representations of finite groups
- The Magma algebra system. I: The user language
This page was built for publication: Computing the soluble radical of a permutation group.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496868)