Article
Licensed
Unlicensed
Requires Authentication
Generalized small cancellation presentations for automatic groups
Published/Copyright:
October 21, 2014
Abstract
By a result of Gersten and Short finite presentations satisfying the usual non-metric small cancellation conditions present biautomatic groups. We show that in the case in which all pieces have length 1, a generalization of the C(3)-T(6) condition yields a larger collection of biautomatic groups.
Funding source: NSF
Award Identifier / Grant number: 1318716
Received: 2014-3-6
Published Online: 2014-10-21
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
