Related papers: A 1-parameter approach to links in a solid torus
A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…
We develop a topological model of site-specific recombination that applies to substrates which are the connected sum of two torus links of the form $T(2,n)\#T(2,m)$. Then we use our model to prove that all knots and links that can be…
Echeverria recently introduced an invariant for a smoothly embedded torus in a homology $S^1\times S^3$, using gauge theory for singular connections. We define a new topological invariant of such an embedded torus, analogous to the…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…
Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…
In this paper, we give an explicit construction of dynamical systems (defined within a solid torus) containing any knot (or link) and arbitrarily knotted chaos. The first is achieved by expressing the knots in terms of braids, defining a…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
We consider surface links in the 4-space which are presented by the form of simple branched coverings over the standard torus, which we call torus-covering links. In this paper, we study unknotting numbers of torus-covering links. In some…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…
We consider knotted annuli in 4-space, called 2-string-links, which are knotted surfaces in codimension two that are naturally related, via closure operations, to both 2-links and 2-torus links. We classify 2-string-links up to…
In this paper we study the theory of {\it pseudo knots}, which are knots with some missing crossing information, and we introduce and study the theory of {\it pseudo tied links} and the theory of {\it pseudo knotoids}. In particular, we…
Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
A graph $G$ of constant link $L$ is a graph in which the neighborhood of any vertex induces a graph isomorphic to $L$. Given two different graphs, $H$ and $G$, the induced Tur\'an number ${\rm ex}(n; H, G{\rm -ind})$ is defined as the…
We show that after stabilizations of opposite parity and braid isotopy, any two braids in the same topological link type cobound embedded annuli. We use this to prove the generalized Jones conjecture relating the braid index and algebraic…
We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have…