Article
Licensed
Unlicensed
Requires Authentication
Palindromic width of wreath products, metabelian groups, and max-n solvable groups
-
Tim R. Riley
and
Andrew W. Sale
Published/Copyright:
October 7, 2014
Abstract
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 thank Valeriy Bardakov, Krishnendu Gongopadhyay, Elisabeth Fink, and an anonymous referee for their comments.
Received: 2014-3-12
Published Online: 2014-10-7
Published in Print: 2014-11-1
© 2014 by De Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- Editorial
- Friends and relatives of BS(1,2)
- Reflections on some aspects of infinite groups
- Generalized small cancellation presentations for automatic groups
- Diophantine cryptography in free metabelian groups: Theoretical base
- Palindromic width of wreath products, metabelian groups, and max-n solvable groups
- Group-theoretic orbit decidability
- Decoy-based information security
Articles in the same Issue
- Frontmatter
- Editorial
- Friends and relatives of BS(1,2)
- Reflections on some aspects of infinite groups
- Generalized small cancellation presentations for automatic groups
- Diophantine cryptography in free metabelian groups: Theoretical base
- Palindromic width of wreath products, metabelian groups, and max-n solvable groups
- Group-theoretic orbit decidability
- Decoy-based information security
