Related papers: Primeness of alternating virtual links

A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$, such that adjacent vertices have relatively prime labels. We will present previously…

In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…

This is the first in a series of four papers wherein we enumerate all prime alternating knots and links. In this first paper, we introduce four operators on knots and show that, when used according to very simple rules on the prime…

A link $L$ in $S^3$ is called a symmetric link if it is preserved by a $\pi$ rotation around a closed geodesic in $S^3$. Any symmetric link can be depicted by a diagram with a symmetry axis lying on the plane of the diagram, called a…

In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…

In this work, we propose a novel representation of complex multi-relational networks, which is compact and allows very efficient network analysis. Multi-relational networks capture complex data relationships and have a variety of…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…

The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…

Let $L$ be a fixed link. Given a link diagram $D$, is there a sequence of crossing exchanges and smoothings on $D$ that yields a diagram of $L$? We approach this problem from the computational complexity point of view. It follows from work…

Let $L$ be a prime alternating link with $n$ crossings. We show that for each fixed $g$, the number of genus $g$ incompressible surfaces in the complement of $L$ is bounded by a polynomial in $n$. Previous bounds were exponential in $n$.

In a social network, the number of links of a node, or node degree, is often assumed as a proxy for the node's importance or prominence within the network. It is known that social networks exhibit the (first-order) assortative mixing, i.e.…

Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

Traditionally, alternating links are studied with alternating diagrams on $S^2$ in $S^3$. In this paper, we consider links which are alternating on higher genus surfaces $S_g$ in $S_g \times I$. We define what it means for such a link to be…

A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

We extend the Gordon-Litherland pairing to links in thickened surfaces, and use it to define signature, determinant, and nullity invariants for links that bound (unoriented) spanning surfaces. The invariants are seen to depend only on the…

We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity is defined in terms of joining virtual link diagrams, which…