Related papers: The C-complex clasp number of links
The slope is an isotopy invariant of colored links with a distinguished component, initially introduced by the authors to describe an extra correction term in the computation of the signature of the splice. It appeared to be closely related…
We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…
An oriented link L in a 3-sphere S in complex 2-space is a C-boundary if it bounds a piece of algebraic curve in the 4-ball bounded by S. Using Kronheimer and Mrowka's proof of the Thom Conjecture, we construct many oriented knots which are…
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…
Given a link L in the 3-sphere, we ask whether the components of L bound disjoint, nullhomologous disks properly embedded in a simply-connected positive-definite smooth 4-manifold; the knot case has been studied extensively in work of…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
In 1833 Gauss defined the linking number of two disjoint curves in 3-space. For open curves this double integral over the parameterised curves is real-valued and invariant modulo rigid motions or isometries that preserve distances between…
Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…
For a Morse function f on a compact oriented manifold M, we show that f has more critical points than the number required by the Morse inequalities if and only if there exists a certain class of link in M whose components have nontrivial…
An explicit polynomial in the linking numbers $l_{ij}$ and Milnor's triple linking numbers $\mu(rst)$ on six component links is shown to be a well-defined finite type link-homotopy invariant. This solves a problem raised by B. Mellor and D.…
We define a "reduced" version of the knot Floer complex $CFK^-(K)$, and show that it behaves well under connected sums and retains enough information to compute Heegaard Floer $d$-invariants of manifolds arising as surgeries on the knot…
The collapsibility number of simplicial complexes was introduced by Wegner in order to understand the intersection patterns of convex sets. This number also plays an important role in a variety of Helly type results. We show that the…
For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster…
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called local clique cover number of G and is…
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…
The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a collection of cliques of G, covering (resp. partitioning) all…
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…
Cycles and Cliques in a side-information graph reduce the number of transmissions required in an index coding problem. Thapa, Ong and Johnson defined a more general form of overlapping cycles, called the interlinked-cycle (IC) structure,…