Orbit-stabilizer problems and computing normalizers for polycyclic groups.
From MaRDI portal
Publication:1864872
DOI10.1006/jsco.2002.0540zbMath1050.20020OpenAlexW2088266529MaRDI QIDQ1864872
Publication date: 23 March 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2002.0540
Symbolic computation and algebraic computation (68W30) Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Software, source code, etc. for problems pertaining to group theory (20-04) Derived series, central series, and generalizations for groups (20F14)
Related Items (2)
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ The isomorphism problem for torsion free nilpotent groups of Hirsch length at most \(5\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the order of a solvable permutation group
- Computing intersections and normalizers in soluble groups
- The algorithmic theory of polycyclic-by-finite groups
- KANT V4
- Finding intersections and normalizers in finitely generated nilpotent groups
- A polycyclic quotient algorithm
- Practical algorithms for polycyclic matrix groups
- Some remarks on the computation of complements and normalizers in soluble groups
- The Orbit-Stabilizer Problem for Linear Groups
This page was built for publication: Orbit-stabilizer problems and computing normalizers for polycyclic groups.