Related papers: Palindromic width of wreath products, metabelian g…

We show that the wreath product $G \wr \mathbb{Z}^n$ of any finitely generated group $G$ with $\mathbb{Z}^n$ has finite palindromic width. We also show that $C \wr A$ has finite palindromic width if $C$ has finite commutator width and $A$…

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for…

Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…

In this paper we consider the palindromic width of free nilpotent groups. In particular, we prove that the palindromic width of a finitely generated free nilpotent group is finite. We also prove that the palindromic width of a free…

We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except…

We prove that the nilpotent product of a set of groups $A_{1},\dots, A_{s}$ has finite palindromic width if and only if the palindromic widths of $A_{i}, i=1,\dots, s,$ are finite. We give a new proof that the commutator width of $F_n \wr…

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…

We provide a general structural criterion implying that a group has infinite $m$-almost palindromic width. In particular, we prove that both HNN extensions and free products exhibit infinite $m$-almost palindromic width, with the unique…

A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set $X$, such that every element of it can be written as a palindrome in the letters of $X$. Moreover, every…

Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S. The supremum of the values l_S(x), x \in G, is called the…

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…

We show that the verbal width is infinite for acylindrically hyperbolic groups, which include hyperbolic groups, mapping class groups and Out(Fn).

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Let $G$ be a non-elementary hyperbolic group. Let $w$ be a group word such that the set $w[G]$ of all its values in $G$ does not coincide with $G$ or 1. We show that the width of verbal subgroup $w(G)=<w[G]>$ is infinite. That is, there is…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…