相关论文: Strict Inequalities for the $n$-crossing Number

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given…

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

Gay and Meier asked whether or not a trisection diagram obtained by the Gluck twist on a spun or a twist spun 2-knot obtained from some method is standard. In this paper, we depict the trisection diagrams explicitly when the 2- knot is the…

Final revision. To appear in the Journal of Differential Geometry. This paper studies knots that are transversal to the standard contact structure in $\reals^3$, bringing techniques from topological knot theory to bear on their transversal…

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$.

In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the $m(5_2)$ knot. Epstein, Fuchs, and Meyer extended his result by showing that there are at least $n$ different Legendrian representatives with maximal…

Suppose that there exists an epimorphism from the knot group of a $2$-bridge knot $K$ onto that of another knot $K'$. In this paper, we study the relationship between their crossing numbers $c(K)$ and $c(K')$. Especially it is shown that…

We call a knot $K$ a complete Alexander neighbor if every possible Alexander polynomial is realized by a knot one crossing change away from $K$. It is unknown whether there exists a complete Alexander neighbor with nontrivial Alexander…

In 1958, Hill conjectured that the minimum number of crossings in a drawing of $K_n$ is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…

Let $m, n, k$ and $c$ be positive integers. Let $\nu_2(k)$ be the 2-adic valuation of $k$. By $S(n,k)$ we denote the Stirling numbers of the second kind. In this paper, we first establish a convolution identity of the Stirling numbers of…

The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm…

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…

In 1972, Kainen proved a general lower bound on the crossing number of a graph in a closed surface and conjectured that this bound is tight when the graph is either a complete graph or a complete bipartite graph, and the surface is of genus…

We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…

In this paper we deal with the problem of computing the exact crossing number of almost planar graphs and the closely related problem of computing the exact anchored crossing number of a pair of planar graphs. It was shown by [Cabello and…

We give infinitely many examples of 2-bridge knots for which the topological and smooth slice genera differ. The smallest of these is the 12-crossing knot $12a255$. These also provide the first known examples of alternating knots for which…

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…