SearcharxivSearch

arXiv · 1201.6513

On the Width of Verbal Subgroups of the Groups of Triangular Matrices over a Field of Arbitrary Characteristic

Abstract

The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the product of at most $m$ words in $W$ evaluated on the group $G$ and their inverses. Recall that every verbal subgroup of the group $T_{n} (K)$ of triangular matrices over an arbitrary field $K$ can be defined by just one word: an outer commutator word or a power word. We prove that for every outer commutator word $w$ the equality $\wid(T_{n} (K),w)=1$ holds on the group $T_{n} (K)$ and that if $w=x^{s}$ then $\wid(T_{n}(K),w)=1$ except in two cases: (1) the field $K$ is finite and $s$ is divisible by the characteristic $p$ of $K$ but not by $|K|-1$; (2) the field $K$ is finite and $s=p^{t} (|K|-1)^{u} r$ for $r,t,u\in \mathbb N$ with $n\ge p^{t} +3$, while $r$ not divisible by $p$. In these cases the width equals 2. For finitary triangular groups the situation is similar, but in the second case the restriction $n\ge p^{t} +3$ is superfluous.

Explore related subjects

Keep this discovery

BibTeXRIS

Yu. V. Sosnovsky. 2012-01-31. On the Width of Verbal Subgroups of the Groups of Triangular Matrices over a Field of Arbitrary Characteristic. https://arxiv.org/abs/1201.6513

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