SearcharxivSearch

arXiv · 1603.05424

Q-tensor square of finitely generated nilpotent groups, q >= 0

Abstract

The authors extend to the $q-$tensor square $G \otimes^q G$ of a group $G$, $q$ a non-negative integer, some structural results due to R. D. Blyth, F. Fumagalli and M. Morigi concerning the non-abelian tensor square $G \otimes G$ ($q = 0$). The results are applied to the computation of $G \otimes^q G$ for finitely generated nilpotent groups $G$, specially for free nilpotent groups of finite rank. They also generalize to all $q \geq 0$ results of M. Bacon regarding an upper bound to the minimal number of generators of the non-abelian tensor square $G \otimes G$ when $G$ is a $n-$generator nilpotent group of class 2. The paper ends with the computation of the $q-$tensor squares of the free $n-$generator nilpotent group of class 2, $n \geq 2$, for all $q \geq 0.$ This shows that the above mentioned upper bound is also achieved for these groups when $q > 1.$

Explore related subjects

Keep this discovery

BibTeXRIS

Noraí R. Rocco, Eunice C. P. Rodrigues. 2016-03-17. Q-tensor square of finitely generated nilpotent groups, q >= 0. https://arxiv.org/abs/1603.05424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR