arXiv Analytics

Sign in

arXiv:1412.5288 [math.GT]AbstractReferencesReviewsResources

On generating sets of Yoshikawa moves for marked graph diagrams of surface-links

Jieon Kim, Yewon Joung, Sang Youl Lee

Published 2014-12-17Version 1

A marked graph diagram is a link diagram possibly with marked $4$-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa gave local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two marked graph diagrams representing equivalent surface-links are related by a finite sequence of these Yoshikawa moves. In this paper, we provide some generating sets of Yoshikawa moves on marked graph diagrams representing unoriented surface-links, and also oriented surface-links. We also discuss independence of certain Yoshikawa moves from the other moves.

Related articles: Most relevant | Search more
arXiv:1602.01558 [math.GT] (Published 2016-02-04)
Polynomial of an oriented surface-link diagram via quantum A_2 invariant
arXiv:1701.07170 [math.GT] (Published 2017-01-25)
Yoshikawa Moves on Marked Graphs via Roseman's Theorem
arXiv:1910.06944 [math.GT] (Published 2019-10-15)
The commutator subgroup of the braid group is generated by two elements