Related papers: From Heegaard diagrams to surgery
In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on…
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
Performing machine learning on structured data is complicated by the fact that such data does not have vectorial form. Therefore, multiple approaches have emerged to construct vectorial representations of structured data, from kernel and…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual…
We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let $M$ be a connected oriented closed smooth 3-manifold. Let $L_1(M)$ be the set of…
We introduce $\delta$ type vertex conditions for beam operators, the fourth derivative operator, on metric graphs and study the effect of certain geometrical alterations (graph surgery) of the graph on the spectra of beam operators on…
The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…
The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
We study the implications of the modeling choice to use a graph, instead of a hypergraph, to represent real-world interconnected systems whose constituent relationships are of higher order by nature. Such a modeling choice typically…
This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are represented by edges in a diagram, and matrices by markings…
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…
This paper provides a conceptual study of the twisting procedure, which amounts to create functorially new differential graded Lie algebras, associative algebras or operads (as well as their homotopy versions) from a Maurer--Cartan element.…
We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider…
We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization…
This paper surveys the significant progress over the past couple of decades in the theory of stratified spaces through the application of controlled methods as well as through the application of intersection homology.
We study trisections of 4-manifolds obtained by spinning and twist-spinning 3-manifolds, and we show that, given a (suitable) Heegaard diagram for the 3-manifold, one can perform simple local modifications to obtain a trisection diagram for…