On the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups

preprint2013arXivOpen access

Abstract

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z)GL_{n}(\mathbb{Z}) for an appropriate n∈Nn\in \mathbb{N}; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in Nickel. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced as well as provide a modification of the algorithm presented by Nickel.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.