Papers
Topics
Authors
Recent
Search
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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.