Valery Bardakov, Vladimir Tolstykh
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 of order two (Theorem 2.4). This means that there is no uniform bound $k$ such that every element of $G$ is a product of at most $k$ palindromes. Earlier, the similar fact was established for non-abelian free groups. The proof of Theorem 2.4 makes use of the ideas by Rhemtulla developed for the study of the widths of verbal subgroups of free products.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados