Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generalized small cancellation presentations for automatic groups

Generalized small cancellation presentations for automatic groups 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Generalized small cancellation presentations for automatic groups

Groups Complexity Cryptology , Volume 6 (2) – Nov 1, 2014

Loading next page...
 
/lp/de-gruyter/generalized-small-cancellation-presentations-for-automatic-groups-1IJFka1rNk
Publisher
de Gruyter
Copyright
Copyright © 2014 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2014-0007
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2014

There are no references for this article.