Related papers: From Heegaard diagrams to surgery
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well…
Extensive rewrite. Tables and proofs have been reformatted and/or rewritten for clarity.
We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…
The twisted face-pairing construction of our earlier papers gives an efficient way of generating, mechanically and with little effort, myriads of relatively simple face-pairing descriptions of interesting closed 3-manifolds. The…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
This largely technical paper is divided into two parts: part I: An account of P. Ozsvath and Z. Szabo's construction of the link surgery spectral sequence. There are no new results here, but this part slightly modifies and expands their…
We describe a correspondence between Turaev surfaces of link diagrams on $S^2\subset S^3$ and special Heegaard diagrams for $S^3$ adapted to links.
This paper is simply a collection of process diagrams for further use and reference. These are diagrams about different approaches to research.
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
A new kind of diagrams is presented, showing the causal structure of bimetric interactions.
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
In the present paper, we discuss a way of generalising Vassiliev knot invariants and weight systems to framed chord diagrams having framing 0 and 1.
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
Let L be a link in an integral homology three-sphere. We give a description of the Heegaard Floer homology of integral surgeries on L in terms of some data associated to L, which we call a complete system of hyperboxes for L. Roughly, a…
Let $(M,\xi)$ be a contact 3-manifold. We present two new algorithms, the first of which converts an open book $(\Sigma,\Phi)$ supporting $(M,\xi)$ with connected binding into a contact surgery diagram. The second turns a contact surgery…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a…
The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…