Rewriting systems in alternating knot groups

Fabienne Chouraqui

doi:10.1142/S0218196706003220

Rewriting systems in alternating knot groups

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

Abstract

Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a, common projection has a, finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.

Original language	English
Pages (from-to)	749-769
Number of pages	21
Journal	International Journal of Algebra and Computation
Volume	16
Issue number	4
DOIs	https://doi.org/10.1142/S0218196706003220
State	Published - Aug 2006
Externally published	Yes

Keywords

Knot group
Rewriting system
Word problem

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1142/S0218196706003220

Cite this

@article{e91ef70d035e45ab8c5a921f1169edb6,

title = "Rewriting systems in alternating knot groups",

abstract = "Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a, common projection has a, finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.",

keywords = "Knot group, Rewriting system, Word problem",

author = "Fabienne Chouraqui",

year = "2006",

month = aug,

doi = "10.1142/S0218196706003220",

language = "English",

volume = "16",

pages = "749--769",

journal = "International Journal of Algebra and Computation",

issn = "0218-1967",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "4",

}

TY - JOUR

T1 - Rewriting systems in alternating knot groups

AU - Chouraqui, Fabienne

PY - 2006/8

Y1 - 2006/8

N2 - Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a, common projection has a, finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.

AB - Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the augmented Dehn presentation of the knot group of a tame, prime, alternating knot in regular position, with a, common projection has a, finite and complete rewriting system. This provides an algorithm for solving the word problem with this presentation and we find an algorithm for solving the word problem with the Dehn presentation also.

KW - Knot group

KW - Rewriting system

KW - Word problem

UR - http://www.scopus.com/inward/record.url?scp=33748552012&partnerID=8YFLogxK

U2 - 10.1142/S0218196706003220

DO - 10.1142/S0218196706003220

M3 - Article

AN - SCOPUS:33748552012

SN - 0218-1967

VL - 16

SP - 749

EP - 769

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

IS - 4

ER -

Rewriting systems in alternating knot groups

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this