Strict inequalities for the n-crossing number

DOI10.1142/S0218216523500281MaRDI QIDQ6041683zbMATH OpenOpenAlexFDO

Authors

Publication date 12 May 2023

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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

zbMATH Keywords

diagramknotmulti-crossing numbertriple-crossing9-crossing

Mathematics Subject Classification ID

Knot theory (57K10)

Abstract: In 2013, Adams introduced the $n$-crossing number of a knot $K$, denoted by $c_n(K)$. Inequalities between the $2$-, $3$-, $4$-, and $5$-crossing numbers have been previously established. We prove $c_9(K)leq{c}_3(K)-2$ for all knots $K$ that are not the trivial, trefoil, or figure-eight knot. We show this inequality is optimal and obtain previously unknown values of $c_9(K)$. We generalize this inequality to prove that $c_{13}(K)<c_5(K)$ for a certain set of classes of knots.

Recommendations

• Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots
• A new bound on odd multicrossing numbers of knots and links
• The crossing number of composite knots
• Multi-crossing number for knots and the Kauffman bracket polynomial
• Triple-crossing number, the genus of a knot or link and torus knots

Cites work

• Multi-crossing number for knots and the Kauffman bracket polynomial
• Quadruple crossing number of knots and links
• Triple crossing number of knots and links
• Triple-crossing number and moves on triple-crossing link diagrams
• Triple-crossing number, the genus of a knot or link and torus knots
• Triple-crossing projections, moves on knots and links and their minimal diagrams

Cited in

(5)

• A new bound on odd multicrossing numbers of knots and links
• The crossing number of composite knots
• On the sharpness of some results relating cuts and crossing numbers
• Multi-crossing number for knots and the Kauffman bracket polynomial
• Answer to a question by Nakamura, Nakanishi, and Satoh involving crossing numbers of knots

This page was built for publication: Strict inequalities for the n-crossing number

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