相关论文: Braided chord diagrams
We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general…
To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…
An invariant of knots is constructed from an integral for geometric braids due to Kohno and Kontsevich. It takes values in a quotient by a certain ideal of the algebra generated by chord diagrams over the circle.
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…
We define a new algebraic structure called a \emph{pointed rack} and use it to construct ambient isotopy invariants of $ n $-braids. We first introduce an integer-valued invariant of braids using pointed racks. This is then strengthened by…
We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…