Search

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound on the span of the bracket polynomial of K as 4c_2(K), to the n-crossing number: span is bounded above by ([n^2/2] + 4n-8) c_n(K) for all integers n at least 3. We also explore n-crossing additivity under composition, and find that for n at least 4, there are examples of knots such that the n-crossing number is sub-additive. Further, we present the first extensive list of calculations of n-crossing numbers for knots. Finally, we explore the monotonicity of the sequence of n-crossings of a knot, which we call the crossing spectrum., Comment: 28 pages, 19 figures

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there are no loops nested within others. The \"ubercrossing number, $\text{\"u}(K)$, is the smallest $n$ for which we can represent a knot $K$ with a single $n$-crossing. The petal number is the number of loops in the minimal petal projection. In this paper, we relate the \"{u}bercrossing number and petal number to well-known invariants such as crossing number, bridge number, and unknotting number. We find that the bounds we have constructed are tight for $(r, r+1)$-torus knots. We also explore the behavior of \"{u}bercrossing number under composition., Comment: 13 pages, 8 figures