2000 character limit reached
Knots with Hopf crossing number at most one
Published 26 Jul 2019 in math.GT | (1907.11614v1)
Abstract: We consider diagrams of links in $S2$ obtained by projection from $S3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots are exhibited. In particular, we establish which of these knots are algebraic and, for such knots, give an answer to a problem posed by Fiedler.
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.