Weak rectangular diagrams, multi-crossing number, and arc index

Abstract

For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\hat{I}\pm (L)-2\le c_2(D)+{\sum }_{n>2}(2n-4)c_n(D)$ holds. Here $\hat{I}\pm (L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and subsumes many known inequalities related to multi-crossing numbers. In the course of proof, we introduce a notion of weak rectangular diagram and show that a loose rectangular diagram can be converted to usual rectangular diagram preserving its arc index.

13 pages, 8 Figures. Following the referee's comment, the terminology `loose rectangular diagram' has been revised to `weak rectangular diagram' and the title has been updated accordingly. Added more details