ﻻ يوجد ملخص باللغة العربية
Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We give a set of diagrammatic moves on triple-crossing diagrams analogous to the Reidemeister moves on ordinary diagrams. The existence of n-crossing diagrams for every n>1 allows the definition of the n-crossing number. We prove that for any nontrivial, nonsplit link, other than the Hopf link, its triple-crossing number is strictly greater than its quintuple-crossing number.
We prove that the crossing changes, Delta moves, and sharp moves are unknotting operations on welded knots.
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
We show that the crossing number of a satellite knot is at least 10^{-13} times the crossing number of its companion knot.
In the 1950s Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that $L$ has vanishin
Research about crossings is typically about minimization. In this paper, we consider emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any g