Related papers: Combinatorial link concordance using cut-diagrams
Machine learning models are a powerful theoretical tool for analyzing data from quantum simulators, in which results of experiments are sets of snapshots of many-body states. Recently, they have been successfully applied to distinguish…
We define a deformation of our earlier link homologies for fundamental representations of sl_m. The deformed homology of a link is isomorphic to the deformed homology of the disjoint union of its components. Moreover, there exists a…
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
The purpose of this paper is to discuss how topology and geometry provide, in many instances, the connective tissue that enables logical comprehension. We illustrate this theme with many examples including Venn diagrams, knot diagrams,…
Reliability evaluation and fault tolerance of an interconnection network of some parallel and distributed systems are discussed separately under various link-faulty hypotheses in terms of different $\mathcal{P}$-conditional…
Electromagnetic modeling provides an interesting context to present a link between physical phenomena and homology and cohomology theories. Over the past twenty-five years, a considerable effort has been invested by the computational…
A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of…
The notion of a welded link was introduced by Fenn, Rim\'anyi, and Rourke as an analogue of welded braids. A welded link is defined as an equivalence class of link diagrams that may contain virtual crossings, where the equivalence is…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
Grid diagrams encode useful geometric information about knots in S^3. In particular, they can be used to combinatorially define the knot Floer homology of a knot K in S^3, and they have a straightforward connection to Legendrian…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
We create a framework for odd Khovanov homology in the spirit of Bar-Natan's construction for the ordinary Khovanov homology. Namely, we express the cube of resolutions of a link diagram as a diagram in a certain 2-category of chronological…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
We determine the algebraic structure underlying the geometric complex associated to a link in Bar-Natan's geometric formalism of Khovanov's link homology theory (n=2). We find an isomorphism of complexes which reduces the complex to one in…
We prove the analogue of the Concordance Implies Isotopy in Codimension $\ge 3$ Theorem for link maps, together with some other its singular analogues. In the case of spherical link maps, a stronger result was independently obtained by P.…
The arrow polynomial is an invariant of framed oriented virtual links that generalizes the virtual Kauffman bracket. In this paper we define the homological arrow polynomial, which generalizes the arrow polynomial to framed oriented virtual…
In his 1957 paper, John Milnor introduced a collection of invariants for links in $S^3$ detecting higher-order linking phenomena by studying lower central quotients of link groups and comparing them to those of the unlink. These invariants,…
Relations between multiple unitarity cuts and coproducts of Feynman integrals are extended to allow for internal masses. These masses introduce new branch cuts, whose discontinuities can be derived by placing single propagators on shell and…
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.