An unknotting index for virtual links

dc.contributor.author	Kaur, K.
dc.contributor.author	Prabhakar, M.
dc.contributor.author	Vesnin, A.
dc.date.accessioned	2019-08-22T14:47:28Z
dc.date.available	2019-08-22T14:47:28Z
dc.date.issued	2019-08-22
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1308
dc.description.abstract	Given a virtual link diagram D, we define its unknotting index U(D)to be minimum among (m, n)tuples, where mstands for the number of crossings virtualized and nstands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram we provide a lower bound for unknotting index of a virtual link. Then using warping degree of a diagram, we obtain an upper bound. Both these bounds are applied to find unknotting index for virtual links obtained from pretzel links by virtualizing some crossings.	en_US
dc.language.iso	en_US	en_US
dc.subject	Virtual link	en_US
dc.subject	Unknotting index	en_US
dc.subject	Pretzel link	en_US
dc.subject	Span value	en_US
dc.title	An unknotting index for virtual links	en_US
dc.type	Article	en_US