Groups Complexity Cryptology
Managing Editor: Shpilrain, Vladimir / Weil, Pascal
Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus
CiteScore 2018: 0.80
SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061
Mathematical Citation Quotient (MCQ) 2017: 0.32
Palindromic width of wreath products, metabelian groups, and max-n solvable groups
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 does . We also give a new, self-contained proof that finitely generated metabelian groups have finite palindromic width. Finally, we show that solvable groups satisfying the maximal condition on normal subgroups (max-n) have finite palindromic width.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.