Related papers: On ribbon graphs and virtual links
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…
A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual…
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…
New invariants of links are constructed using the skein invariant polynomial of colored links defined by the author in [1]. These invariants are stronger than the homflypt polynomial.
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We prove that Legendrian and transverse links in overtwisted contact structures having overtwisted complements can be classified coarsely by their classical invariants. We further prove that any coarse equivalence class of loose links has…
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…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
In the present paper, we construct an invariant of braids in the real projective plane which corresponds to an ``action'' of braids on certain graphs in $\R{}P^{2}$ with labels. This paper is a sequel of papers \cite{M},\cite{KM}. It…
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…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
Let $n$ be a nonnegative integer, we use ribbon $n-$graph diagrams and the Yamada polynomial skein relations to construct an algebra ${\mathcal Y}_n$ which is shown to be closely related to the Temerley-Lieb Algebra. We prove that the…
In GT/0006019 oriented quantum algebras were motivated and introduced in a natural categorical setting. Invariants of knots and links can be computed from oriented quantum algebras, and this includes the Reshetikhin-Turaev theory for Ribbon…
We prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.
In this draft paper, we introduce a novel architecture for graph networks which is equivariant to the Euclidean group in $n$-dimensions. The model is designed to work with graph networks in their general form and can be shown to include…
We introduce a new equivalence relation, named R-equivalence relation, on the set of colorings of an oriented knot diagram by a quandle. We determine the R-equivalence classes of colorings of a diagram of a torus knot by a quandle, called…
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new…
We introduce the concept of a relative Tutte polynomial of colored graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this…
In the paper we introduce and study a classification of finite (simple, undirected, loopless) graphs with respect to a switch-equivalence (`local-complement' equivalence of \cite{pascvebl}, an analogue of the complement-equivalence of…