SearcharxivSearch

arXiv · 2404.00023

Conciseness on normal subgroups and new concise words from outer commutator words

Abstract

Let $w=w(x_1,\ldots,x_r)$ be an outer commutator word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables. This applies in particular to words of the form $w(x_1^{n_1},\ldots,x_r^{n_r})$, where the $n_i$ are non-zero integers. Our approach is via the study of values of $w$ on normal subgroups, and in this setting we obtain the following result: if $N_1,\ldots,N_r$ are normal subgroups of a group $G$ and the set of all values $w(g_1,\ldots,g_r)$ with $g_i\in N_i$ is finite then also the subgroup generated by these values, i.e. $w(N_1,\ldots,N_r)$, is finite.

Explore related subjects

Keep this discovery

BibTeXRIS

Gustavo A. Fernandez-Alcober, Matteo Pintonello. 2024-03-20. Conciseness on normal subgroups and new concise words from outer commutator words. https://arxiv.org/abs/2404.00023

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