Related papers: Crosscap Numbers of Two-component Links
We give a characterization of alternating link exteriors in terms of cubed complexes. To this end, we introduce the concept of a "signed BW cubed-complex", and give a characterization for a signed BW cubed-complex to have the underlying…
We describe a construction procedure of infinite sets of $2$-links in closed simply connected 4-manifolds that are topologically isotopic, smoothly inequivalent and componentwise topologically unknotted. These 2-links are the first examples…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…
We introduce three kinds of invariants of a virtual knot called the first, second, and third intersection polynomials. The definition is based on the intersection number of a pair of curves on a closed surface. The calculations of…
In our earlier work, we studied the link surgery modules of two component L-space links. Therein, we computed two of the four idempotents of such modules. In this article, we use Koszul duality to give an alternate account of this proof,…
We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
M. Scharlemann has recently proved that any genus one tunnel number one knot is either a satellite or 2-bridge knot, as conjectured by H. Goda and M. Teragaito; all such knots admit a (1,1) decomposition. In this paper we give a…
A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…
We show that for links with at most 5 components, the only finite type homotopy invariants are products of the linking numbers. In contrast, we show that for links with at least 9 components, there must exist finite type homotopy invariants…
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}. In this paper, we present various formulas and bounds for…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
In this paper, we study the cup products and Betti numbers over cohomology superspaces of two-step nilpotent Lie superalgebras with coefficients in the adjoint modules over an algebraically closed field of characteristic zero. As an…
We compute the maximal Thurston-Bennequin number for a Legendrian two-bridge knot or oriented two-bridge link in standard contact R^3, by showing that the upper bound given by the Kauffman polynomial is sharp. As an application, we present…
The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a…
We define an integer valued invariant for two-component links in S^3 by counting projective SU(2) representations of the link group having non-trivial second Stiefel-Whitney class. We show that our invariant is, up to sign, the linking…
The key elements that a common format for describing networks should include are discussed.
In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said…
In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links…
We classify transverse Hopf links in the standard contact 3-space up to transverse isotopy in terms of their components' self-linking number.