2000 character limit reached
On ribbon graphs and virtual links
Published 8 Oct 2020 in math.GT and math.CO | (2010.04238v2)
Abstract: We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links into an invariant of ribbon graphs, and vice versa.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.