Knots with Hopf crossing number at most one

zbMATH Open1437.57011arXiv1907.11614MaRDI QIDQ2176808FDOQ2176808

Authors: Maciej Mroczkowski 

Publication date: 5 May 2020

Published in: Osaka Journal of Mathematics (Search for Journal in Brave)

Abstract: We consider diagrams of links in $S^2$ obtained by projection from $S^3$ 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.

Full work available at URL: https://arxiv.org/abs/1907.11614

Recommendations

• On two crossing numbers of algebraic knots under Hopf fibration
• Algebraic links and the Hopf fibration
• On some moves on links and the Hopf crossing number
• Triple-crossing projections, moves on knots and links and their minimal diagrams
• ALMOST POSITIVE LINKS HAVE NEGATIVE SIGNATURE

zbMATH Keywords

crossing numberalgebraic knot

Mathematics Subject Classification ID

Knot theory (57K10)

Cites Work

• Hecke algebra representations of braid groups and link polynomials
• State models and the Jones polynomial
• Three-Dimensional Link Theory and Invariants of Plane Curve Singularities. (AM-110)
• Title not available (Why is that?)
• The coloured Jones function and Alexander polynomial for torus knots
• KBSM of the product of a disk with two holes and \(S^1\)
• Shadow links and face models of statistical mechanics
• Title not available (Why is that?)
• The strong AJ conjecture for cables of torus knots
• Algebraic links and the Hopf fibration

Cited In (4)

• Nullification numbers of knots with up to 10 crossings
• On two crossing numbers of algebraic knots under Hopf fibration
• Infinitely many roots of unity are zeros of some Jones polynomials
• On some moves on links and the Hopf crossing number

Uses Software

• KnotPlot
• KnotInfo

This page was built for publication: Knots with Hopf crossing number at most one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176808)