اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVirtual Multicrossings and Petal Diagrams for Virtual Knots and Links
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all virtual knots.
قيم البحث
اقرأ أيضاً
The writhe polynomial is a fundamental invariant of an oriented virtual knot. We introduce a kind of local moves for oriented virtual knots called shell moves. The first aim of this paper is to prove that two oriented virtual knots have the same writ
he polynomial if and only if they are related by a finite sequence of shell moves. The second aim of this paper is to classify oriented $2$-component virtual links up to shell moves by using several invariants of virtual links.
We generalize unoriented handlebody-links to the twisted virtual case, obtaining Reidemeister moves for handlebody-links in ambient spaces of the form $Sigmatimes [0,1]$ for $Sigma$ a compact closed 2-manifold up to stable equivalence. We introduce a
related algebraic structure known as twisted virtual bikeigebras whose axioms are motivated by the twisted virtual handlebody-link Reidemeister moves. We use twisted virtual bikeigebras to define $X$-colorability for twisted virtual handlebody-links and define an integer-valued invariant $Phi_{X}^{mathbb{Z}}$ of twisted virtual handlebody-links. We provide example computations of the new invariants and use them to distinguish some twisted virtual handlebody-links.
We give a new interpretation of the Alexander polynomial $Delta_0$ for virtual knots due to Sawollek and Silver and Williams, and use it to show that, for any virtual knot, $Delta_0$ determines the writhe polynomial of Cheng and Gao (equivalently, Ka
uffmans affine index polynomial). We also use it to define a second-order writhe polynomial, and give some applications.
Oikawa defined an unknotting operation on virtual knots, called a CF-move, and gave a classification of 2-component virtual links up to CF-moves by the virtual linking number and his $n$-invariant. In particular, it was proved that a CF-move characte
rizes the information contained in the virtual linking number for 2-component odd virtual links. In this paper, we extend this result by classifying odd virtual links and almost odd virtual links with arbitrary number of components up to CF-moves, using the virtual linking number. Moreover, we extend Oikawas $n$-invariant and introduce two invariants for 3-component even virtual links. Using these invariants together with the virtual linking number, we classify 3-component even virtual links up to CF-moves. As a result, a classification of 3-component virtual links up to CF-moves is provided.
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links into an invariant of ribbon graphs, and vice versa.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
