wreath 积、亚阿贝尔群及满足极大条件可解群的回文宽度
群论
2014-09-16 v3
摘要
如果存在使得每个元素都可以表示为个或更少回文词的乘积，则称该群具有有限回文宽度。我们证明，如果群相对于某个生成集具有有限回文宽度，那么也具有有限回文宽度。我们还给出了一个全新的、自包含的证明，表明有限生成的亚阿贝尔群具有有限回文宽度。最后，我们证明了满足正规子群极大条件（max-n）的可解群具有有限回文宽度。
引用
@article{arxiv.1307.4861,
title = {Palindromic width of wreath products, metabelian groups, and max-n solvable groups},
author = {T. R. Riley and A. W. Sale},
journal= {arXiv preprint arXiv:1307.4861},
year = {2014}
}
备注
The example in Section 2.1 has been expanded. Otherwise only minor changes have been made. 15 pages. To appear in Groups Complexity Cryptology