Related papers: A prime decomposition theorem for the 2-string lin…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
We develop a graphical calculus for monoidal categories equipped with twisted pivotal structures, which are a generalization of pivotal structures originating from the study of orientation structures in the context of the Cobordism…
We show that the Casson knot invariant, linking number and Milnor's triple linking number, together with a certain 2-string link invariant $V_2$, are necessary and sufficient to express any string link Vassiliev invariant of order two.…
We review work on `decomposition,' a property of two-dimensional theories with 1-form symmetries and, more generally, d-dimensional theories with (d-1)-form symmetries. Decomposition is the observation that such quantum field theories are…
In this paper Moussouris' algorithm for the decomposition of spin networks is reviewed and the implicit assumptions made in the Decomposition Theorem relating a spin network with its state sum are examined. It is found that the theorem in…
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…
We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
It is known by A. Loi and R. Piergallini that a closed, oriented, smooth 3-manifold is Stein fillable if and only if it has a positive open book decomposition. In the present paper we will show that for every link L in a Stein fillable…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…
Three-manifolds can be obtained through surgery of framed links in $S^3$. We study the meaning of surgery procedures in the context of topological strings. We obtain U(N) three-manifold invariants from U(N) framed link invariants in…
String theory in two-dimensional spacetime illuminates two main threads of recent development in string theory: (1) Open/closed string duality, and (2) Tachyon condensation. In two dimensions, many aspects of these phenomena can be explored…
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…
We show a possibility that the matrix models recently proposed to explain (almost) all the physics of M-theory may include the superstring theories that we know perturbatively. The ``1st quantized'' physical system of one IIA string seems…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
For n-bridge decompositions of links in S^3, we propose a practical method to ensure that the Hempel distance is at least two.