On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
Open Access
- 3 February 2003
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 72 (243) , 1511-1529
Abstract
We present an algorithm to solve the orbit-stabilizer problem for a polycyclic group G G acting as a subgroup of G L ( d , Z ) GL(d, \mathbb Z) on the elements of Q d \mathbb Q^d . We report on an implementation of our method and use this to observe that the algorithm is practical.Keywords
This publication has 10 references indexed in Scilit:
- Practical Algorithms for Polycyclic Matrix GroupsJournal of Symbolic Computation, 1999
- A Polycyclic Quotient AlgorithmJournal of Symbolic Computation, 1998
- KANT V4Journal of Symbolic Computation, 1997
- Almost-Bieberbach Groups: Affine and Polynomial Structures1996
- Computation with Finitely Presented Groups1994
- A Course in Computational Algebraic Number Theory1993
- Computational Algebraic Number Theory1993
- The algorithmic theory of polycyclic-by-finite groupsJournal of Algebra, 1991
- Fundamental Algorithms for Permutation Groups1991
- The Orbit-Stabilizer Problem for Linear GroupsCanadian Journal of Mathematics, 1985