A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a linear algorithm detecting whether a Gauss paragraph encodes a classical link. We describe Wirtinger presentations realizable by virtual link groups.
A Gauss paragraph is a combinatorial formulation of a generic closed curve with multiple components on some surface. A virtual string is a collection of circles with arrows that represent the crossings of such a curve. Every closed curve has an underlying virtual string and every virtual string has an underlying Gauss paragraph. A word-wise partition is a partition of the alphabet set of a Gauss paragraph that satisfies certain conditions with respect to the Gauss paragraph. In this paper we use the theory of virtual strings to obtain a combinatorial description of closed curves in the 2-spher…
In this paper we use theory of embedded graphs on oriented and compact $PL$-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter's circles. For the case of signed Gauss words, we use a generating set of $H_1(S_w,\mathbb{Z})$, given in \cite{CaEl}, and the intersection pairing of immersed $PL$-normal curves to present a short solution of the signed Gauss word problem. Moreover, we define the join operation on signed Gauss paragraphs to produce …
We discuss Gauss codes of virtual diagrams and virtual doodles. The notion of a left canonical Gauss code is introduced and it is shown that oriented virtual doodles are uniquely presented by left canonical Gauss codes.
In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define the notion of virtual link groups which is an extension of virtual link groups defined by Kauffman. Moreover, we introduce the concept of marked Gauss diagrams as a generalisation of Gauss diagrams and their interpretation in terms of knot-like diagrams. We extend the definition of virtual link groups to marked Gauss diagrams and define their peripheral str…
The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram
We define a new kind of Gauss diagrams to describe knots in the solid torus with projections in the annulus. We see that it provides an efficient tool for showing that a knot diagram can be fully recovered from its decorated Gauss diagram, and we use it to establish a characterization of the decorated Gauss diagrams of closed braids.
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we extend these invariants to all virtual marked vertex diagrams by considering colorings by involutory biquandles, also known as bikei. We introduce a way of representing marked vertex diagrams with Gauss diagrams and use these to characterize orientability.
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 of the earlier attempts to decorate Gauss diagrams, in a way that is made precise via symmetry-preserving maps. These maps become crucial when one makes use of decorated Gauss diagrams to describe finite-type invariants. In particular they allow us to generalize Grishanov-Vassiliev's formulas and to show that they define invariants of virtual knots.
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility, stability and Reidemeister moves. We show that virtual braids are in a bijective correspondence with abstract braids. Finally we demonstrate that for any abstract braid, its representative of minimal genus is unique up to compatibility and Reidemeister moves. The genus of such a representative is thus an invariant for virtual braids. We also give a complete …
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss codes via knot diagrams with virtual crossings. This paper gives basic results and examples (such as non-trivial virtual knots with trivial Jones polynomial), studies fundamental group and quandles of virtual knots, extensions of the bracket and Jones polynomials, quantum link i…
We consider the group of unrestricted virtual braids, describe its structure and explore its relations with fused links. Also, we define the groups of flat virtual braids and virtual Gauss braids and study some of their properties, in particular their linearity.
We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite type invariant and show that the restriction of any such invariant of degree n to classical knots is an invariant of degree at most n in the classical sense. A universal invariant of degree at most n is defined via a Gauss diagram formula. This machinery is used to obtain explicit formulas for invariants of low degrees. The same technique is also used to prove…
Twisted knot theory, introduced by M.O.Bourgoin, is a generalization of virtual knot theory. It is easily shown that any virtual knot can be deformed into a trivial knot by a finite sequence of generalized Reidemeister moves and two "forbidden moves" $F_{1}$ and $F_{2}$. Similarly, we show that any twisted knot also can be deformed into a trivial knot or a trivial knot with a bar by a finite sequence of extended Reidemeister moves and three "forbidden moves" $T_{4}$, $F_{1}$ (or $F_{2}$) and $F_{3}$ (or $F_{4}$) .
Virtual knot theory is a generalization of knot theory which is based on Gauss chord diagrams and link diagrams on closed oriented surfaces. A twisted knot is a generalization of a virtual knot, which corresponds to a link diagram on a possibly non-orientable surface. In this paper, we discuss an invariant of twisted links which is obtained from the JKSS invariant of virtual links by use of double coverings. We also discuss some properties of double covering diagrams.
We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The construction relies upon the notion of parity. As corollaries, we prove that the minimal classical crossing number for classical knots.
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also define generalizations of virtual link diagrams and Gauss codes to represent virtual links, and use such diagrams to construct a combinatorial biquandle invariant for virtual $2$-links. In the case of $2$-links, we also explore generalizations of Fox-Milnor movies to the virtual case. In addition, we discuss definitions extending the notion of welded links to h…
Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we introduce a Gauss-diagrammatic theory for pseudoknots which gives rise to the notion of a virtual pseudoknot. We provide new, easily computable isotopy and homotopy invariants for classical and virtual pseudodiagrams. We also give tables of unknotting numbers for homotopically trivial pseudoknots and homotopy classes of homotopically nontrivial pseudoknots. Sinc…
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also define generalizations of virtual link diagrams and Gauss codes to represent virtual links, and use such diagrams to construct a combinatorial biquandle invariant for virtual $2$-links. In the case of $2$-links, we also explore generalizations of Fox-Milnor movies to the virtual case. In addition, we discuss definitions extending the notion of welded links to h…
Virtual knots arise in the study of Gauss diagrams and Vassiliev invariants of usual knots. Virtual braids correspond naturally to virtual knots. We consider the group of virtual braids on n strings VB_n and its Burau representation, in particular we study their homological properties. We prove that the plus-construction of the classifying space of the virtual braid group on the infinite number of strings is an infinite loop space which is equivalent to a product of Q(S^0), S^1 and an infinite loop space Y. Connections with the K-functor of the integers are discussed.
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 diagrams staying halfway between twisted virtual links and Kauffman bracket / Khovanov homology; alternatable virtual links intermediate between virtual and classical links. The most profound role here belongs to a structure that we dare to call orientation of chord diagram. Khovanov homology is generalized to oriented signed chord diagrams and links in oriented t…
Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree $n$ Vassiliev invariants.
Using Gauss diagrams, one can define the virtual bridge number ${\rm vb}(K)$ and the welded bridge number ${\rm wb}(K),$ invariants of virtual and welded knots with ${\rm wb}(K) \leq {\rm vb}(K).$ If $K$ is a classical knot, Chernov and Manturov showed that ${\rm vb}(K) = {\rm br}(K),$ the bridge number as a classical knot, and we ask whether the same thing is true for welded knots. The welded bridge number is bounded below by the meridional rank of the knot group $G_K$, and we use this to relate this question to a conjecture of Cappell and Shaneson. We show how to use other virtual and welded…
An elementary stabilization of a Legendrian link $L$ in the spherical cotangent bundle $ST^*M$ of a surface $M$ is a surgery that results in attaching a handle to $M$ along two discs away from the image in $M$ of the projection of the link $L$. A virtual Legendrian isotopy is a composition of stabilizations, destabilizations and Legendrian isotopies. In contrast to Legendrian knots, virtual Legendrian knots enjoy the property that there is a bijective correspondence between the virtual Legendrian knots and the equivalence classes of Gauss diagrams. We study virtual Legendrian isotopy classes o…
Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classical knots. However, many virtual knots survive after this simplification. We construct invariants of these objects and present their applications to minimality problems of virtual knots as well as some questions related to graph-links. One can easily generalize these results for …
