Generalized small cancellation presentations for automatic groups

Robert H. Gilman

doi:10.1515/gcc-2014-0007

Generalized small cancellation presentations for automatic groups

Robert H. Gilman

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	93-101
Number of pages	9
Journal	Groups, Complexity, Cryptology
Volume	6
Issue number	2
DOIs	https://doi.org/10.1515/gcc-2014-0007
State	Published - 1 Nov 2014

Keywords

Small cancellation
automatic group
pregroup

Access to Document

10.1515/gcc-2014-0007

Cite this

@article{c2adf06522e14349855c73c141563df1,

title = "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.",

keywords = "Small cancellation, automatic group, pregroup",

author = "Gilman, \{Robert H.\}",

note = "Publisher Copyright: {\textcopyright} 2014 by De Gruyter.",

year = "2014",

month = nov,

day = "1",

doi = "10.1515/gcc-2014-0007",

language = "English",

volume = "6",

pages = "93--101",

number = "2",

}

TY - JOUR

T1 - Generalized small cancellation presentations for automatic groups

AU - Gilman, Robert H.

PY - 2014/11/1

Y1 - 2014/11/1

N2 - 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.

AB - 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.

KW - Small cancellation

KW - automatic group

KW - pregroup

UR - https://www.scopus.com/pages/publications/84922061731

UR - https://www.scopus.com/pages/publications/84922061731#tab=citedBy

U2 - 10.1515/gcc-2014-0007

DO - 10.1515/gcc-2014-0007

M3 - Article

AN - SCOPUS:84922061731

SN - 1867-1144

VL - 6

SP - 93

EP - 101

JO - Groups, Complexity, Cryptology

JF - Groups, Complexity, Cryptology

IS - 2

ER -

Generalized small cancellation presentations for automatic groups

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this