Related papers: Estimates for the minimal crossing number
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…
We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…
We show that link Floer homology detects the Thurston norm of a link complement. As an application, we show that the Thurston polytope of an alternating link is dual to the Newton polytope of its multi-variable Alexander polynomial. To…
In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…
We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.
An $n$-crossing projection of a link $L$ is a projection of $L$ onto a plane such that $n$ points on $L$ are superimposed on top of each other at every crossing. We prove that for all $k \in \mathbb{N}$ and all links $L$, the inequality…
We construct efficient topological cobordisms between torus links and large connected sums of trefoil knots. As an application, we show that the signature invariant $\sigma_\omega$ at $\omega=\zeta_6$ takes essentially minimal values on…
It is known that the Kauffman-Murasugi-Thislethwaite type inequality becomes an equality for any (possibly virtual) adequate link diagram. We refine this condition. As an application we obtain a criterion for virtual link diagram with…
This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to…
If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2^n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…
We use the multiplicative structure of the Koszul resolution to give short and simple proofs of some known estimates for the total dimension of the cohomology of spaces which admit free torus actions and analogous results for filtered…
It is a very old conjecture that the crossing number of knots is additive under connected sum. In other words, if K#K' is the connected sum of knots K and K', then does the equality c(K#K') = c(K) + c(K') hold? We prove that c(K#K') is at…
We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…
The Kauffman-Harary conjecture states that for any reduced alternating diagram K of a knot with a prime determinant p, every non-trivial Fox p-coloring of K assigns different colors to its arcs. We generalize the conjecture by stating it in…