Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/on-the-dimension-of-matrix-representations-of-finitely-generated-Sk7czIPseW
References (8)
-
Dailu Li, Xiquan Liang, Yanhong Men (2010)
Nilpotent Groups, 18
-
Werner Nickel (2006)
Matrix representations for torsion-free nilpotent groups by Deep ThoughtJournal of Algebra, 300
-
W. Graaf, Werner Nickel (2002)
Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent GroupsJ. Symb. Comput., 33
-
A. Kostrikin, I. Shafarevich (1993)
Algebra IV: Infinite Groups, Linear Groups -
J. Michel (2006)
Handbook of computational group theoryMath. Comput., 75
-
C. Leedham-Green, L. Soicher (1998)
Symbolic Collection using Deep ThoughtLms Journal of Computation and Mathematics, 1
-
(1991)
Shafarevich. Encyclopedia of Mathematical Sciences, Volume 37, Algebra IV: Infinite Groups -
D. Holt, B. Eick, E. O'Brien (2005)
Handbook of Computational Group Theory
- 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 Cryptology – de Gruyter
Published: Nov 1, 2013