ترغب بنشر مسار تعليمي؟ اضغط هنا

An elementary fact about unlinked braid closures

48   0   0.0 ( 0 )
 نشر من قبل J. Elisenda Grigsby
 تاريخ النشر 2013
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let n be a positive integer. We provide a Khovanov homology proof of the following classical fact: If the closure of an n-strand braid is the n-component unlink, then the braid is trivial.

قيم البحث

اقرأ أيضاً

An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of strings is countable.
145 - Marc Lackenby 2016
The aim of this survey article is to highlight several notoriously intractable problems about knots and links, as well as to provide a brief discussion of what is known about them.
We investigate two categorified braid conjugacy class invariants, one coming from Khovanov homology and the other from Heegaard Floer homology. We prove that each yields a solution to the word problem but not the conjugacy problem in the braid group.
137 - Usman Ali 2008
In this article we describe the summit sets in B_3, the smallest element in a summit set and we compute the Hilbert series corresponding to conjugacy classes.The results will be related to Birman-Menesco classification of knots with braid index three or less than three.
369 - Nic Koban , Jon McCammond , 2013
In 1987 Bieri, Neumann and Strebel introduced a geometric invariant for discrete groups. In this article we compute and explicitly describe the BNS-invariant for the pure braid groups.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا