Related papers: The Connectivity Order of Links
We show that limit linear series spaces for chains of curves are reduced. Using new advances in the foundations of limit linear series, we then use degenerations to study the question of connectedness for spaces of linear series with…
This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
This short note presents a new relation between coherent spaces and finiteness spaces. This takes the form of a functor from COH to FIN commuting with the additive and multiplicative structure of linear logic. What makes this correspondence…
This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…
The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…
The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…
This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2^n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be…
Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the…
In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of $4$-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
We give a classification of $n$-component links up to $C_n$-move. In order to prove this classification, we characterize Brunnian links, and have that a Brunnian link is ambient isotopic to a band sum of trivial link and Milnor's links.
We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these…