Related papers: Palindromic Width of Wreath Products

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

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…

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 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…

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…

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…

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

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…

Generalizing results of Higman and Houghton on varieties generated by wreath products of finite cycles, we prove that the (direct or cartesian) wreath product of arbitrary abelian groups $A$ and $B$ generates the product variety $var (A)…

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 $\mathcal{S}$ be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in $\mathcal{S}$ is…

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…

We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy…

In the 1980's K.S. Brown proved that the Houghton group $H_n$ is of type $\operatorname{F}_{n-1}$ but not $\operatorname{FP}_n$. We show that, provided $n\ge3$, the same conclusion holds for all subgroups $G$ of $H_n$ that are 'large' in…

For any finite group $A$ and any finitely generated group $B$, we prove that the corresponding lamplighter group $A\wr B$ admits a standard generating set with unbounded depth, and that if $B$ is abelian then the above is true for every…

We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for…

It is well known that the pair $(\mathcal{S}_n,\mathcal{S}_{n-1})$ is a Gelfand pair where $\mathcal{S}_n$ is the symmetric group on $n$ elements. In this paper, we prove that if $G$ is a finite group then $(G\wr \mathcal{S}_n, G\wr…

Let $G$ be the first Grigorchuk group. We show that the commutator width of $G$ is $2$: every element $g\in [G,G]$ is a product of two commutators, and also of six conjugates of $a$. Furthermore, we show that every finitely generated…