Related papers: Arrow calculus for welded and classical links
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Extended welded links are a generalization of Fenn, Rim\'{a}nyi, and Rourke's welded links. Their braided counterpart are extended welded braids, which are closely related to ribbon braids and loop braids. In this paper we prove versions of…
We obtain a localized version of the configuration space integral for the Casson knot invariant, where the standard symmetric Gauss form is replaced with a locally supported form. An interesting technical difference between the arguments…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute…
In this paper we study welded knots and their invariants. We focus on generating examples of non-trivial knotted ribbon tori as the tube of welded knots that are obtained from classical knot diagrams by welding some of the crossings.…
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
In these notes, I will sketch a new approach to Khovanov homology of knots and links based on counting the solutions of certain elliptic partial differential equations in four and five dimensions. The equations are formulated on four and…
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…
The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…
Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous…
In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…
We show how the treatment of cellularity in families of algebras arising from diagram calculi, such as Jones' Temperley--Lieb wreaths, variants on Brauer's centralizer algebras, and the contour algebras of Cox et al (of which many algebras…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
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…
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…