2000 character limit reached
Turaev genus and alternating decompositions
Published 10 Jul 2015 in math.GT | (1507.02771v2)
Abstract: We prove that the genus of the Turaev surface of a link diagram is determined by a graph whose vertices correspond to the boundary components of the maximal alternating regions of the link diagram. Furthermore, we use these graphs to classify link diagrams whose Turaev surface has genus one or two, and we prove that similar classification theorems exist for all genera.
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.