相关论文: Non-minimal bridge position of $2$-cable links

We study the behavior of the Ozsvath-Szabo and Rasmussen knot concordance invariants tau and s on K(m,n), the (m,n)-cable of a knot K where m and n are relatively prime. We show that for every knot K and for any fixed positive integer m,…

We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination numbers of a graph and its complement. We provide an answer…

We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.

We use the degree of the colored Jones knot polynomials to show that the crossing number of a $(p,q)$-cable of an adequate knot with crossing number $c$ is larger than $q^2\, c$. As an application we determine the crossing number of…

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it…

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected…

Using the Bordered Floer theory of Lipshitz-Ozsv\'ath-Thurston we prove that the $(p,q)$-cables of any non-trivial knots are not Heegaard Floer homologically thin. Using the proof and a theorem of Zemke, we find a larger set of satellite…

We prove that many pretzel knots of the form $P(2n,m,-2n\pm1,-m)$ are not topologically slice, even though their positive mutants $P(2n, -2n\pm1, m, -m)$ are ribbon. We use the sliceness obstruction of Kirk and Livingston related to the…

Given a link projection $P$ and a link $L$, it is natural to ask whether it is possible that $P$ is a projection of $L$. Taniyama answered this question for the cases in which $L$ is a prime knot or link with crossing number at most five.…

A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…

Nonlinear transport through a quantum dot is studied in the limit of weak and strong intra-dot Coulomb interaction. For the latter regime the nonequilibrium self-consistent mean field equations for energies and spectral weights of…

It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of…

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…

In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of $4$-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present…

We study the AJ conjecture that relates the A-polynomial and the colored Jones polynomial of a knot in $S^3$. We confirm the AJ conjecture for $(r,2)$-cables of the $m$-twist knot, for all odd integers $r$ satisfying $\begin{cases}…

We consider the relationship between the crosscap number $\gamma$ of knots and a partial order on the set of all prime knots, which is defined as follows. For two knots $K$ and $J$, we say $K \geq J$ if there exists an epimorphism…

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…