Algorithms for finite soluble groups and applications
From MaRDI portal
Recommendations
Cited in
(19)- Elementare Algorithmen aus der Gruppentheorie. (Elementary algorithms in group theory)
- Towards a soluble quotient algorithm
- Intersecting subgroups of finite soluble groups
- Computing a set of generators of minimal cardinality in a solvable group
- Computing stable epimorphisms onto finite groups
- Construction of the irreducible modular representations of a finite group
- Computing in arithmetic groups with Voronoï's algorithm.
- Algorithms for symmetric groups of simplexes
- Writing representations over proper division subrings.
- Minimizing representations over number fields.
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- Computational approaches to the theory of finite soluble groups
- scientific article; zbMATH DE number 3558069 (Why is no real title available?)
- scientific article; zbMATH DE number 1257081 (Why is no real title available?)
- scientific article; zbMATH DE number 597711 (Why is no real title available?)
- scientific article; zbMATH DE number 1419254 (Why is no real title available?)
- Algorithms for polycyclic-by-finite groups
- Computing projectors, injectors, residuals and radicals of finite soluble groups
- Decomposing homogeneous modules of finite groups in characteristic zero.
This page was built for publication: Algorithms for finite soluble groups and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762217)