Related papers: Adding a suitable unknot to any link equates bridg…
The Meridional Rank Conjecture asks whether the bridge number of a knot in $S^3$ is equal to the minimal number of meridians needed to generate the fundamental group of its complement. In this paper we investigate the analogous conjecture…
We prove that links with meridional rank 3 whose 2-fold branched covers are graph manifolds are 3-bridge links. This gives a partial answer to a question by S. Cappell and J. Shaneson on the relation between the bridge numbers and…
We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…
We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…
To each link $L$ in $S^3$ we associate a collection of certain labelled directed trees, called width trees. We interpret some classical and new topological link invariants in terms of these width trees and show how the geometric structure…
We prove for a large class of knots that the meridional rank coincides with the bridge number. This class contains all knots whose exterior is a graph manifold. This gives a partial answer to a question of S. Cappell and J. Shaneson, see…
Given a knot $K$ in $S^3$, a question raised by Cappell and Shaneson asks if the meridional rank of $K$ equals the bridge number of $K$. Using augmentations in knot contact homology we consider the persistence of equality between these two…
We prove that the meridional rank and the bridge number of the Whitehead double of a prime algebraically tame knot coincide. Algebraically tame knots are a broad generalization of torus knots and iterated cable knots.
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
We present two practical and widely applicable methods, including some criteria and a general procedure, for detecting Brunnian property of a link, if each component is known to be unknot. The methods are based on observation and handwork.…
We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…
Suppose L is a link in $S^3$. We show that $\pi_1(S^3-L)$ admits an irreducible meridian-traceless representation in SU(2) if and only if L is not the unknot, the Hopf link, or a connected sum of Hopf links. As a corollary, $\pi_1(S^3-L)$…
We study certain linear representations of the knot group that induce augmentations of knot contact homology. This perspective on augmentations enhances our understanding of the relationship between the augmentation polynomial and the…
In a recent paper, McMullen showed an inequality between the Thurston norm and the Alexander norm of a 3-manifold. This generalizes the well-known fact that twice the genus of a knot is bounded from below by the degree of the Alexander…
For any pair of integers $m$ and $n$ such that $3<m<n$, we provide an infinite family of links, where each link in the family has a locally minimal $n$-bridge position and a globally minimal $m$-bridge position. We accomplish this by…
This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…
In a recent paper Y. Hu has given a sufficient condition for the fundamental group of the r-th cyclic branched covering of S^3 along a prime knot to be left-orderable in terms of representations of the knot group. Applying her criterion to…
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a…
Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…