A reduced set of moves on one-vertex ribbon graphs coming from links
Susan Abernathy, Cody Armond, Moshe Cohen, Oliver T. Dasbach, Hannah, Manuel, Chris Penn, Heather M. Russell, and Neal W. Stoltzfus
TL;DR
This paper establishes a Markov type theorem for representing links in R^3 using a simplified set of moves on one-vertex ribbon graphs, enhancing understanding of link diagram transformations.
Contribution
It introduces a reduced move set for one-vertex ribbon graphs that represent links, providing a new framework for link diagram equivalence.
Findings
Proves a Markov type theorem for one-vertex ribbon graphs.
Defines a simplified move set for link representations.
Enhances understanding of link diagram transformations.
Abstract
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.