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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematics of Computation of the American Mathematical Society
Paper Title
Journal
Date
