arXiv Analytics

Sign in

arXiv:1407.4485 [math.GT]AbstractReferencesReviewsResources

Multi-crossing Number for Knots and the Kauffman Bracket Polynomial

Colin Adams, Orsola Capovilla-Searle, Jesse Freeman, Daniel Irvine, Samantha Petti, Daniel Vitek, Ashley Weber, Sicong Zhang

Published 2014-07-16Version 1

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<K> 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.

Comments: 28 pages, 19 figures
Categories: math.GT
Subjects: 57M25
Related articles: Most relevant | Search more
arXiv:0905.4879 [math.GT] (Published 2009-05-29, updated 2009-11-16)
A bracket polynomial for graphs. III. Vertex weights
arXiv:1311.0526 [math.GT] (Published 2013-11-03)
Bounds on Übercrossing and Petal Numbers for Knots
Colin Adams et al.
arXiv:0906.3408 [math.GT] (Published 2009-06-18, updated 2010-05-06)
On two categorifications of the arrow polynomial for virtual knots