Related papers: On positive and almost alternating links
We introduce a new numerical invariant for special, reduced, alternating diagrams of oriented knots and links, defined in terms of the Laplacian matrix of the associated Tait graph. For a special alternating diagram, the Laplacian encodes…
We present a table of symmetric diagrams for strongly invertible knots up to 10 crossings, point out the similarity of transvergent diagrams for strongly invertible knots with symmetric union diagrams and discuss open questions.
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
We extend Howie's characterization of alternating knots to give a topological characterization of toroidally alternating knots, which were defined by Adams. We provide necessary and sufficient conditions for a knot to be toroidally…
We give a non-left-orderability criterion for involutory quandles of non-split links. We use this criterion to show that the involutory quandle of any non-trivial alternating link is not left-orderable, thus improving Theorem 8.1. proven by…
The paper develops a general theory of orderability of quandles with a focus on link quandles of tame links and gives some general constructions of orderable quandles. We prove that knot quandles of many fibered prime knots are…
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…
T-positive links form a subset of strongly quasipositive links that strictly contains the set of all non-split braid positive links. Analogous to Baader's characterisation of positive links as precisely the strongly quasipositive and…
We show that every non-trivial strongly quasipositive link is smoothly concordant to infinitely many pairwise non-isotopic strongly quasipositive links. In contrast to our result, Baker conjectured that smoothly concordant strongly…
We consider two well known constructions of link invariants. One uses skein theory: you resolve each crossing of the link as a linear combination of things that don't cross, until you eventually get a linear combination of links with no…
We prove that Legendrian and transverse links in overtwisted contact structures having overtwisted complements can be classified coarsely by their classical invariants. We further prove that any coarse equivalence class of loose links has…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…
This note presents conjectures on polynomial/algebraic/sub-exponential convergence of transition probabilities for $\lambda$-null recurrent and $\lambda$-transient Markov chains in continuous time. The only known positive examples are in…
This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations. The theorem nests 60 special cases,…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…