On the dimension of matrix embeddings of torsion-free nilpotent groups

DOI10.1016/J.JALGEBRA.2017.01.027zbMATH Open1455.20024arXiv1606.02247OpenAlexW2964177915MaRDI QIDQ517082FDOQ517082

Authors: Funda Gul, Armin Weiß 

Publication date: 16 March 2017

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Since the work of Jennings (1955), it is well-known that any finitely generated torsion-free nilpotent group can be embedded into unitriangular integer matrices $U{T}_N(Z)$ for some $N$. In 2006, Nickel proposed an algorithm to calculate such embeddings. In this work, we show that if $U{T}_n(Z)$ is embedded into $U{T}_N(Z)$ using Nickel's algorithm, then $Ngeq{2}^{n/2-2}$ if the standard ordering of the Mal'cev basis (as in Nickel's original paper) is used. In particular, we establish an exponential worst-case running time of Nickel's algorithm. On the other hand, we also prove a general exponential upper bound on the dimension of the embedding by showing that for any torsion free, finitely generated nilpotent group the matrix representation produced by Nickel's algorithm has never larger dimension than Jennings' embedding. Moreover, when starting with a special Mal'cev basis, Nickel's embedding for $U{T}_n(Z)$ has only quadratic size. Finally, we consider some special cases like free nilpotent groups and Heisenberg groups and compare the sizes of the embeddings.

Full work available at URL: https://arxiv.org/abs/1606.02247

Recommendations

• On the dimension of matrix representations of finitely generated torsion free nilpotent groups.
• Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group
• Constructing faithful representations of finitely-generated torsion-free nilpotent groups
• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• scientific article; zbMATH DE number 1533645

zbMATH Keywords

nilpotent groupsMal'cev basisJennings' embeddingNickel's algorithmunitriangular matrix group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nilpotent groups (20F18) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05)

Cites Work

• SUBGROUP DISTORTIONS IN NILPOTENT GROUPS
• Word Problems Solvable in Logspace
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A practical algorithm for finding matrix representations for polycyclic groups
• A linear decomposition attack
• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• Symbolic Collection using Deep Thought
• The Group Ring Of a Class Of Infinite Nilpotent Groups
• Simple upper bounds for partition functions
• Constructing faithful representations of finitely-generated torsion-free nilpotent groups
• On the dimension of matrix representations of finitely generated torsion free nilpotent groups.

Cited In (8)

• Assouad-Nagata dimension of nilpotent groups with arbitrary left invariant metrics
• Constructing faithful representations of finitely-generated torsion-free nilpotent groups
• On embeddings of the free group into the group of infinite unitriangular matrices
• On the dimension of matrix representations of finitely generated torsion free nilpotent groups.
• Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups
• Word images in symmetric and classical groups of Lie type are dense
• Diagonal embeddings of nilpotent groups
• Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group

This page was built for publication: On the dimension of matrix embeddings of torsion-free nilpotent groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517082)