Palindromic width of wreath products (Q342827)

A palindrome is a word which reads the same left-to-right as right-to-left. Then, an element \(g\) of a group \(G\) is a palindrome if it can be represented by a palindromic word in the generators of \(G\). Moreover, a group \(G\) has finite palindromic width \(\mathrm{pw}(G,X)\) with respect to a generating set \(X\), if every element of \(G\) can be expressed as a product of at most \(\mathrm{pw}(G,X)\) many palindromes in the alphabet \(X^{\pm 1}\). A group \(G\) has a finite palindromic width if there exists a generating set with respect to which \(G\) has a finite palindromic width. In this paper, the author shows that the wreath product \(G \wr \mathbb Z^n\) of any finitely generated group \(G\) with \(\mathbb Z^n \) has finite palindromic width. This generalizes some result of \textit{T. Riley} et al. [Groups Complex. Cryptol. 6, No. 2, 121--132 (2014; Zbl 1312.20034)] for the special case when \(G\) has finite palindromic width. All possible subcases and explicit upper bounds for the palindromic width \(\mathrm{pw}(G,X)\) are conveniently summarized in Theorem 1.1. For instance, in the first part. (i.e. Theorem 3.4), the case is considered where \(G\) is a \(d\)-generated group generated by \(X\). If \(E\) is the standard generating set of \(\mathbb Z^k\), then \[ \mathrm{pw}( G \wr \mathbb Z^k, X \cup E ) \leq \begin{cases} 4d +8k -1 ,\text{ for }k\text{ even},\\ 4d +8k +1,\text{ for }k\text{ odd}.\end{cases} \]