Practical algorithms for polycyclic matrix groups
DOI10.1006/jsco.1999.0287zbMath0977.20024OpenAlexW2072901418MaRDI QIDQ1974695
Publication date: 8 May 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/657003b8ec200613b12d6a7252b35bb14ac244e8
Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Representation theory for linear algebraic groups (20G05) Generators, relations, and presentations of groups (20F05) Linear algebraic groups over the reals, the complexes, the quaternions (20G20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic theory of polycyclic-by-finite groups
- Direct methods for primary decomposition
- On a question of Lehmer and the number of irreducible factors of a polynomial
- The Orbit-Stabilizer Problem for Linear Groups
- Computing a lattice basis from a system of generating vectors
- Maximal Abelian Subgroups of the Symmetric Groups
This page was built for publication: Practical algorithms for polycyclic matrix groups