SearcharxivSearch

arXiv · 1402.5314

On palindromic width of certain extensions and quotients of free nilpotent groups

Abstract

In arXiv:1303.1129, the authors provided a bound for the palindromic width of free abelian-by-nilpotent group $AN_n$ of rank $n$ and free nilpotent group ${\rm N}_{n,r}$ of rank $n$ and step $r$. In the present paper we study palindromic widths of groups $\widetilde{AN}_n$ and $\widetilde{\rm N}_{n,r}$. We denote by $\widetilde{G}_n = G_n / \langle \langle x_1^2, \ldots, x_n^2 \rangle \rangle$ the quotient of group $G_n = \langle x_1, \ldots, x_n \rangle$, which is free in some variety by the normal subgroup generated by $x_1^2, \ldots, x_n^2$. We prove that the palindromic width of the quotient $\widetilde{AN}_n$ is finite and bounded by $3n$. We also prove that the palindromic width of the quotient $\widetilde{\rm N}_{n, 2}$ is precisely $2(n-1)$. We improve the lower bound of the palindromic width for ${\rm N}_{n, r}$. We prove that the palindromic width of ${\rm N}_{n, r}$, $r\geq 2$ is at least $2(n-1)$. We also improve the bound for palindromic widths of free metabelian groups. We prove that the palindromic width of free metabelian group of rank $n$ is at most $4n-1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Valeriy G. Bardakov, Krishnendu Gongopadhyay. 2014-02-21. On palindromic width of certain extensions and quotients of free nilpotent groups. https://arxiv.org/abs/1402.5314

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