相关论文: The concordance crosscap number and rational Witt …

We construct many examples of non-slice knots in 3-space that cannot be distinguished from slice knots by previously known invariants. Using Whitney towers in place of embedded disks, we define a geometric filtration of the 3-dimensional…

Given a graph $G=(V,E)$ and a positive integer $k\ge2$, a $k$-path vertex cover is a subset of vertices $F$ such that every path on $k$ vertices in $G$ contains at least one vertex from $F$. A minimum $k$-path vertex cover in $G$ is a…

One construction of the Alexander polynomial is as a quantum invariant associated with representations of restricted quantum $\mathfrak{sl}_2$ at a fourth root of unity. We generalize this construction to define a link invariant…

Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were…

Chern-Simons gauge theory for compact semisimple groups is analyzed from a perturbation theory point of view. The general form of the perturbative series expansion of a Wilson line is presented in terms of the Casimir operators of the gauge…

We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen $s$-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension $2^{|L|}$. The basic…

The conormal Lagrangian $L_K$ of a knot $K$ in $\mathbb{R}^3$ is the submanifold of the cotangent bundle $T^* \mathbb{R}^3$ consisting of covectors along $K$ that annihilate tangent vectors to $K$. By intersecting with the unit cotangent…

We provide explicit formulas for the integer-valued smooth concordance invariant $\upsilon(K) = \Upsilon_K(1)$ for every 3-braid knot $K$. We determine this invariant, which was defined by Ozsv\'ath, Stipsicz and Szab\'o, by constructing…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

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…

In this paper, we proceed as suggested in the final section of arXiv:1812.03874v2 and prove a lower bound for the spectral gap of the conjugate Kac process with 3 interacting particles. This bound turns out to be around $0.02$, which is…

The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing…

In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

We develop a construction suggested by Scharlemann and Thompson to obtain an infinite family of pairs of knots $K_{\alpha}$ and $K'_{\alpha}$ so that $w(K_{\alpha} # K'_{\alpha})=max{w(K_{\alpha}), w(K'_{\alpha})}$. This is the first known…

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in…

For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…

A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 2002, Exoo found a (3, 14) record graph with order 384. The…

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.

Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…