A Polynomial Invariant Of Twisted Graph Diagrams

Simple item page
dc.creatorUhing, Jason
dc.date2007-06-19
dc.date.accessioned2026-07-07T08:11:08Z
dc.date.available2026-07-07T08:11:08Z
dc.descriptionTwisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/0706.2854
dc.identifierhttp://arxiv.org/abs/0706.2854
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132028
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject57M25;05C10
dc.titleA Polynomial Invariant Of Twisted Graph Diagrams
dc.typetext

Files

Collections

arXiv