Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the dimension of matrix representations of finitely generated torsion free nilpotent groups

On the dimension of matrix representations of finitely generated torsion free nilpotent groups Abstract. It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into for an appropriate ; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in (J. Algebra 300 (2006), 376–383). 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 in (J. Algebra 300 (2006), 376–383). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

On the dimension of matrix representations of finitely generated torsion free nilpotent groups

Loading next page...
 
/lp/de-gruyter/on-the-dimension-of-matrix-representations-of-finitely-generated-Sk7czIPseW
Publisher
de Gruyter
Copyright
Copyright © 2013 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2013-0011
Publisher site
See Article on Publisher Site

Abstract

Abstract. It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into for an appropriate ; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in (J. Algebra 300 (2006), 376–383). 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 in (J. Algebra 300 (2006), 376–383).

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2013

There are no references for this article.