Related papers: On links minimizing the tunnel number
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
We establish a direct connection between the analytic data of weakly isolated mixed singularities and the topology of their associated links. More precisely, we prove that the existence of essential tori, topological information, in the…
In this work we establish the tightest lower bound up-to-date for the minimal crossing number of a satellite knot based on the minimal crossing number of the companion used to build the satellite. If $M$ is the wrapping number of the…
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…
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair steps are relatively terminating with respect to R. We further…
We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and n(n-1)/2 relations…
Dasbach and Lin proved a "volumish theorem" for alternating links. We prove the analogue for alternating link diagrams on surfaces, which provides bounds on the hyperbolic volume of a link in a thickened surface in terms of coefficients of…
We investigate the 1D version of the notable Bressan's mixing conjecture, and introduce various formulation in the classical optimal transport setting, the branched optimal transport setting and a combinatorial optimization. In the discrete…
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…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
We consider links that are alternating on surfaces embedded in a compact 3-manifold. We show that under mild restrictions, the complement of the link decomposes into simpler pieces, generalising the polyhedral decomposition of alternating…
Traffic dynamics on single or isolated complex networks has been extensively studied in the past decade. Recently, several coupled network models have been developed to describe the interactions between real-world networked systems. In a…
We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…
The Tait conjecture states that alternating reduced diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. Kauffman and K. Murasugi studying the Jones polynomial. The author proved…
We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.
A biperiodic alternating link has an alternating quotient link in the thickened torus. In this paper, we focus on semi-regular links, a class of biperiodic alternating links whose hyperbolic structure can be immediately determined from a…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
We show that there is a knot satisfying the property that for each minimal crossing number diagram of the knot and each single crossing of the diagram, changing the crossing results in a diagram for a knot whose unknotting number is at…
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…
Addressing a question of Zaremsky, we give conditions on a finite simplicial graph which guarantee that the associated matching arc complex is connected and hyperbolic.