Abstract
In this paper, we introduce a way of encoding links (long links). This ways leads to a combinatorial representation of links by words in a given finite alphabet. We prove that the link semigroup is isomorphic to some algebraically defined semigroup with a simple system of relations. Thus, knot theory is represented as a bracket calculus: the link recognition problem is reduced to a recognition problem in this semigroup.
Similar content being viewed by others
References
Adams, C.: The Knot Book, Freeman, New York, 1994.
Manturov, V. O.: Introduction to the Theory of Knots and their Invariants, Editorial URSS, Moscow, 2001.
Manturov, V. O.: The bracket semigroup of knots, Math. Notes 67(4) (2000), 571-581.
Prasolov, V. V. and Sossinsky, A. B.: Knots, Links, Braids, and 3-Manifolds, Transl. Math. Monogr., Amer. Math. Soc., Providence, 1997.
Reidemeister, K.: Knot Theory, Chelsea Publ., New York, 1948.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Manturov, V.O. Knots and the Bracket Calculus. Acta Applicandae Mathematicae 74, 293–336 (2002). https://doi.org/10.1023/A:1021154925574
Issue Date:
DOI: https://doi.org/10.1023/A:1021154925574