A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link.
We generalize this result to show that the determinant is the alternating sum of the number of quasi-trees of genus j of the dessin of a non-alternating link.
Furthermore, we obtain formulas for other link invariants by counting quantities on dessins. In particular we will show that the $j$-th coefficient of the Jones polynomial is given by sub-dessins of genus less or equal to $j$.
We prove that there are only finitely many values of the Jones polynomial of quasi-alternating links of a given determinant. Consequently, we prove that there are only finitely many quasi-alternating links of a given Jones polynomial iff there are only finitely many quasi-alternating links of a given determinant.
Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links of determinant at most 7 are connected sums of two-bridge links, which is optimal since there are quasi-alternating links not of this form for all larger determinants. We achieve this by studying their branched double covers and characterizing distance-one surgeries between lens spaces of small order, leading to a classification of formal L-spaces with order …
Let L be any infinite biperiodic alternating link. We show that for any sequence of finite links that Folner converges almost everywhere to L, their determinant densities converge to the Mahler measure of the 2-variable characteristic polynomial of the toroidal dimer model on an associated biperiodic graph.
We examine the conjecture, due to Champanerkar, Kofman, and Purcell that $\text{vol}(K) < 2 π\log \det (K)$ for alternating hyperbolic links, where $\text{vol}(K) = \text{vol}(S^3\backslash K)$ is the hyperbolic volume and $\det(K)$ is the determinant of $K$. We prove that the conjecture holds for 2-bridge links, alternating 3-braids, and various other infinite families. We show the conjecture holds for highly twisted links and quantify this by showing the conjecture holds when the crossing number of $K$ exceeds some function of the twist number of $K$.
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number of its spanning arborescence is equal to the determinant, i.e., the value at -1 of the Jones polynomial.
We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its determinant. Thus, if this conjecture is proved then it would give an easier obstruction for quasi-alternateness than the ones already known.
We extend the Neumann's methods and give the explicit formulae for the volume and the Chern-Simons invariant for hyperbolic alternating knot orbifolds.
Qazaqzeh and Chbili showed that for any quasi-alternating link, the degree of $Q$-polynomial is less than its determinant. We give a refinement of their evaluation.
We prove that the degree of the Brandt-Lickorish-Millet polynomial of any quasi-alternating link is less than its determinant. Therefore, we obtain a new and a simple obstruction criterion for quasi-alternateness. As an application, we identify some knots of 12 crossings or less and some links of 9 crossings or less that are not quasi-alternating. Also, we show that there are only finitely many Kanenobu knots which are quasi-alternating. This last result supports Conjecture 3.1 of Greene in [10] which states that there are only finitely many quasi-alternating links with a given determinant. Mo…
Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at most 10 crossings, for which the unknotting number can be confirmed by using the general formulae for signatures. For 11 families of knots general formulae are obtained for their ascending numbers.
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial invariants, but that all such invariants are multiples of the Euler characteristic.
The volume density of a hyperbolic link is defined as the ratio of hyperbolic volume to crossing number. We study its properties and a closely-related invariant called the determinant density. It is known that the sets of volume densities and determinant densities of links are dense in the interval [0,v_{oct}]. We construct sequences of alternating knots whose volume and determinant densities both converge to any x in [0,v_{oct}]. We also investigate the distributions of volume and determinant densities for hyperbolic rational links, and establish upper bounds and density results for these inv…
The $\textit{volume density}$ of a hyperbolic link $K$ is defined to be the ratio of the hyperbolic volume of $K$ to the crossing number of $K$. We show that there are sequences of non-alternating links with volume density approaching $v_8$, where $v_8$ is the volume of the ideal hyperbolic octahedron. We show that the set of volume densities is dense in $[0,v_8]$. The $\textit{determinant density}$ of a link $K$ is $[2 π\log \det(K)]/c(K)$. We prove that the closure of the set of determinant densities contains the set $[0, v_8]$.
We construct an infinite family of links which are both almost alternating and quasi-alternating from a given either almost alternating diagram representing a quasi-alternating link, or connected and reduced alternating tangle diagram. To do that we use what we call a dealternator extension which consists in replacing the dealternator by a rational tangle extending it. We note that all not alternating and quasi-alternating Montesinos links can be obtained in that way. We check that all the obtained quasi-alternating links satisfy Conjecture 3.1 of Qazaqzeh et al. (JKTR 22 (06), 2013), that is …
We extend some classical results of Bankwitz, Crowell, and Murasugi to the setting of virtual links. For instance, we show that an alternating virtual link is split if and only if it is visibly split, and that the Alexander polynomial of any almost classical alternating virtual link is alternating. The first result is a consequence of an inequality relating the link determinant and crossing number for any non-split alternating virtual link. The second is a consequence of the matrix-tree theorem of Bott and Mayberry. We extend the first result to semi-alternating virtual links. We discuss the T…
A state generating is introduced to determine the Jones polynomial of a link. Formulae for two infinite families of knots are shown by applying this method, the second family of which are proved to be non-alternating. Moreover, the method is generalized to compute the Jones-Kauffman polynomial of a virtual link. As examples, formulae for one infinite family of virtual knots are given.
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 terms of homology of the double cover of S^3 branched along a link. In this way we extend the scope of the conjecture to all prime alternating links of arbitrary determinants. We first prove the Kauffman-Harary conjecture for pretzel knots and then we generalize our argument to show the generalized Kauffman-Harary conjecture for all Montesinos links. Finall…
We prove that the length of any gap in the differential grading of the Khovanov homology of any quasi-alternating link is one. As a consequence, we obtain that the length of any gap in the Jones polynomial of any such link is one. This establishes a weaker version of Conjecture 2.3 in [5]. Moreover, we obtain a lower bound for the determinant of any such link in terms of the breadth of its Jones polynomial. This establishes a weaker version of Conjecture 3.8 in [17]. The main tool in obtaining this result is establishing the Knight Move Conjecture [2,Conjecture 1] for the class of quasi-altern…
We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers occur as determinants of prime alternating achiral knots, and obtain a complete result for perfect squares. Using the checkerboard coloring, then an application is given to the number of spanning trees in planar self-dual graphs. Another application are some enumeration results on achiral rational knots. Finally, we describe the leading coefficients of the Ale…
We introduce a version of Khovanov homology for alternating links with marking data, $ω$, inspired by instanton theory. We show that the analogue of the spectral sequence from Khovanov homology to singular instanton homology introduced in \cite{KM_unknot} for this marked Khovanov homology collapses on the $E_2$ page for alternating links. We moreover show that for non-split links the Khovanov homology we introduce for alternating links does not depend on $ω$; thus, the instanton homology also does not depend on $ω$ for non-split alternating links. Finally, we study a version of binary dihedral…
Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related stories, especially if they allow as to place the main topic in a historical context. For example, we mention that the Goeritz matrix was preceded by the Kirchhoff matrix of an electrical network. The network complexity extracted from the matrix corresponds to the determinant of a link. We assume basic knowledge of knot theory and graph theory, however, we of…
