2000 character limit reached
Link diagrams with low Turaev genus
Published 10 Jul 2015 in math.GT | (1507.02918v2)
Abstract: We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provide new obstructions for a link diagram on a surface to come from the Turaev surface algorithm.
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.