Projects per year
Abstract
We describe algorithms for testing polycyclicity and nilpotency for finitely generated subgroups of GL( d, Q) and thus we show that these properties are decidable. Variations of our algorithm can be used for testing virtual polycyclicity and virtual nilpotency for finitely generated subgroups of GL(d, Q).
| Original language | English |
|---|---|
| Pages (from-to) | 1669-1682 |
| Number of pages | 14 |
| Journal | Mathematics of Computation |
| Volume | 76 |
| Issue number | 259 |
| Publication status | Published - 2007 |
Fingerprint
Dive into the research topics of 'Testing polycyclicity of finitely generated rational matrix groups'. Together they form a unique fingerprint.Projects
- 1 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard