2003/12/08 by В. Г. Бардаков, Valery Bardakov, Bardakov, Valery +2
Computer Science · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Limits and Structures in Graph Theory #math.GR #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0312153
11 pages
arxiv created 2003/12/08 · openalex publication_date 2003/12/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. This means that there is no a uniform bound k such that every element of G is a product of at most k palindromes. Earlier the similar fact established for non-abelian free groups.