Related papers: Links with splitting number one
In this paper, we tabulate the set of alternating pretzel links. Specifically, for any given crossing number $c$, we derive a closed formula that would allow us to compute $\mathcal{P}(c)$, the total number of alternating pretzel links with…
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…
We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation…
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving…
State-of-the-art link prediction (LP) models demonstrate impressive benchmark results. However, popular benchmark datasets often assume that training, validation, and testing samples are representative of the overall dataset distribution.…
We consider the problem of link prediction in networks whose edge structure may vary (sufficiently slowly) over time. This problem, with applications in many important areas including social networks, has two main variants: the first, known…
We describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…
We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…
A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…
This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…
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.…
Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…
We show that a random link defined by random bridge splitting is hyperbolic with asymptotic probability 1.
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…
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…
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.
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…
The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.
Menasco proved the surprising result that if $G$ is a reduced, alternating, connected projection of a link $L$ and $G$ is prime then $L$ is prime. This result has been generalized to other classes of links, tangles, and spatial graphs. We…