Related papers: Braided chord diagrams
In this paper we study the chord index of virtual knots, which can be thought of as an extension of the chord parity. We show how to use the chord index to define finite type invariants of virtual knots. The notions of indexed Jones…
Given a knot in $S^3$, one can associate to it a surface diffeomorphism in two different ways. First, an arbitrary knot in $S^{3}$ can be represented by braids, which can be thought of as diffeomorphisms of punctured disks. Second, if the…
We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids…
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
In this paper we present a detailed study of \emph{bonded knots} and their related structures, integrating recent developments into a single framework. Bonded knots are classical knots endowed with embedded bonding arcs modeling physical or…
This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…
In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…
In this paper we introduce the quadratic Jaco graph. The characteristics, properties and some graph invariants of quadratic Jaco graphs are discussed. The observation that quadratic Jaco graphs are well-defined in respect of complete graphs…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…
Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…
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,…
Knot Floer homology is a knot invariant defined using holomorphic curves. In more recent work, taking cues from bordered Floer homology,the authors described another knot invariant, called "bordered knot Floer homology", which has an…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…