Journals / Turkish Journal of Mathematics / 2004 / Cilt: 28 - Sayı: 1

Solution of the Word Problem in the Singular Braid Group

Pages
95–100
Publication Date
2022-11-04
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Combined with Corran's normal form for the singular braid monoid, our algorithm provides a computable normal form for the singular braid group.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise with distinct tangents.
📊
Key Findings & Data:Under the usual multiplication of braids, they form a monoid.
💡
Conclusion & Impact:Combined with Corran's normal form for the singular braid monoid, our algorithm provides a computable normal form for the singular braid group.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Singular braid · word problem · Singular braid

Abstract

Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise with distinct tangents. Under the usual multiplication of braids, they form a monoid. The singular braid group was introduced by Fenn-Keyman-Rourke as the quotient group of the singular braid monoid. We give a solution of the word problem for this group. It is obtained as a combination of the results by Fenn-Keyman-Rourke and some simple geometric considerations based on the mapping class interpretation of braids. Combined with Corran's normal form for the singular braid monoid, our algorithm provides a computable normal form for the singular braid group.

Özet

Singular braids are isotopy classes of smooth strings which are allowed to cross each other pairwise with distinct tangents. Under the usual multiplication of braids, they form a monoid. The singular braid group was introduced by Fenn-Keyman-Rourke as the quotient group of the singular braid monoid. We give a solution of the word problem for this group. It is obtained as a combination of the results by Fenn-Keyman-Rourke and some simple geometric considerations based on the mapping class interpretation of braids. Combined with Corran's normal form for the singular braid monoid, our algorithm provides a computable normal form for the singular braid group.

🔖

Cite This Article

OREVKOV, S. Y. (2022). Solution of the Word Problem in the Singular Braid Group. Turkish Journal of Mathematics, Cilt: 28 - Sayı: 1, 95–100. https://ajindex.com/articles/608793

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...