Introduction to Graph-Link Theory

Simple item page
dc.creatorIlyutko, Denis P.
dc.creatorManturov, Vassily O.
dc.date2008-10-30
dc.date.accessioned2026-07-07T10:14:13Z
dc.date.available2026-07-07T10:14:13Z
dc.descriptionThe present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with the same equivalence relations we get `graph-links'. On one hand graph-links generalise the notion of virtual link, on the other hand they do not feel link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalisation of the Kauffman-Murasugi-Thistlethwaite theorem on `minmal diagrams' for graph-links
dc.description34 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/0810.5522
dc.identifierhttp://arxiv.org/abs/0810.5522
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172807
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject57M25
dc.titleIntroduction to Graph-Link Theory
dc.typetext

Files

Collections

arXiv