scientific article; zbMATH DE number 3871623
From MaRDI portal
Publication:3338422
algorithmscentralizerscomposition seriesconjugacy classesintersections of subgroupsmaximal abelian subgroupsnormalizersSOGOSsoluble groupsSylow subgroups
Software, source code, etc. for problems pertaining to group theory (20-04) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Finite nilpotent groups, (p)-groups (20D15) Series and lattices of subgroups (20D30) Symbolic computation and algebraic computation (68W30)
Recommendations
- Intersecting subgroups of finite soluble groups
- Computing intersections and normalizers in soluble groups
- Some remarks on the computation of complements and normalizers in soluble groups
- Algorithms for finite soluble groups and applications
- Some remarks on the computation of conjugacy classes of soluble groups
Cited in
(45)- Normalizers of \(p\)-subgroups in finite groups.
- The modular group algebra of a central-elementary-by-abelian p-group
- Towards a soluble quotient algorithm
- Constructing normalisers in finite soluble groups
- Intersecting subgroups of finite soluble groups
- Computing in permutation and matrix groups. III: Sylow subgroups
- The primitive soluble permutation groups of degree less than 256
- Double coset enumeration
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- Computing with group homomorphisms
- An algorithm for solving the factorization problem in permutation groups
- Mod 2 group algebras with metabelian unit groups
- Computing a set of generators of minimal cardinality in a solvable group
- Computing subgroups by exhibition in finite solvable groups
- The \(p\)-group generation algorithm
- On Galois groups and their maximal 2-subgroups
- Construction of discrete structures, especially isomers
- Obituary: Joachim Neubüser (1932--2021)
- Computing conjugacy classes of elements in matrix groups.
- Some remarks on the computation of complements and normalizers in soluble groups
- Special polycyclic generating sequences for finite soluble groups.
- Algorithms for finite soluble groups and applications
- Non-commutative lattice problems
- scientific article; zbMATH DE number 4019302 (Why is no real title available?)
- scientific article; zbMATH DE number 3871627 (Why is no real title available?)
- Computational approaches to the theory of finite soluble groups
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
- scientific article; zbMATH DE number 597711 (Why is no real title available?)
- Some remarks on the computation of conjugacy classes of soluble groups
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- Integrality and arithmeticity of solvable linear groups.
- Algorithms for polycyclic-by-finite groups
- Parallel complexity for nilpotent groups
- Algorithms to solve absolute orientation problem for GL(3), O(3), and SO(3) groups
- The groups of order 128
- Computing double cosets in soluble groups
- Computing projectors, injectors, residuals and radicals of finite soluble groups
- Short presentations for three-dimensional unitary groups.
- Calculating subgroups with GAP
- Computational group theory. Abstracts from the workshop held June 1--6, 2025
- Units in the modular group algebra of a finite Abelian p-group
- Collection from the left and other strategies
- Computing modular and projective character degrees of soluble groups
- Computing intersections and normalizers in soluble groups
- A proof of Holt's algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338422)
