Effective computation with group homomorphisms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3865540 (Why is no real title available?)
- scientific article; zbMATH DE number 3702903 (Why is no real title available?)
- scientific article; zbMATH DE number 3769860 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3287776 (Why is no real title available?)
- scientific article; zbMATH DE number 3399470 (Why is no real title available?)
- An Algorithm for Finding the Blocks of a Permutation Group
- Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
- Computing in Permutation and Matrix Groups II: Backtrack Algorithm
- Construction of defining relators for finite groups
- Implementation and Analysis of the Todd-Coxeter Algorithm
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
Cited in
(6)- A note on short cosets
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
- GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
- The Canon package: a fast kernel for tensor manipulators
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- Computing with group homomorphisms
This page was built for publication: Effective computation with group homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062134)