Related papers: Biquasiles and Dual Graph Diagrams
In this paper we introduce a description of ordered groupoids as a particular type of double categories. This enables us to turn Lawson's correspondence between ordered groupoids and left-cancellative categories into a biequivalence. We use…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
In work by Ausoni, Dundas and Rognes a half magnetic monopole is discovered and describes an obstruction to creating a determinant K(ku) \to ku*. In fact it is an obstruction to creating a determinant gerbe map from K(ku) to K(Z,3). We…
This is the second part of the article on doubly symmetric diagrams and strongly positive amphicheiral knots. We develop an enumeration strategy for prime knots given by doubly symmetric diagrams and determine all cases up to 18 crossings…
We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollob\'as-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally…
In this paper, we consider certain elements in von Neumann algebras generated by graph groupoids. In particular, we are interested in finitely supported elements, called graph operators. We study the characterizations for self-adjointness,…
A new kind of diagrams is presented, showing the causal structure of bimetric interactions.
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new…
We describe various properties and give several characterizations of ternary groups satisfying two axioms derived from the third Reidemeister move in knot theory. Using special attributes of such ternary groups, such as semi-commutativity,…
This work presents a detailed analysis of the combinatorics of modular operads. These are operad-like structures that admit a contraction operation as well as an operadic multiplication. Their combinatorics are governed by graphs that admit…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
We introduce a two-parameters bt-algebra which, by specialization, becomes the one-parameter bt-algebra, introduced by the authors, as well as another one-parameter presentation of it; the invariant for links and tied links, associated to…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
Representations of equipped graphs were introduced by Gelfand and Ponomarev; they are similar to representation of quivers, but one does not need to choose an orientation of the graph. In a previous article we have shown that, as in Kac's…
By designating vertices with variables, a simple undirected graph can be augmented to have an associated representing rational function in two variables taking the complex bi-upper halfplane to itself. We give relations between representing…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
We enhance the quandle coloring quiver invariant of oriented knots and links with quandle modules. This results in a two-variable polynomial invariant with specializes to the previous quandle module polynomial invariant as well as to the…
We construct an extension of the Kontsevich integral of knots to knotted trivalent graphs, which commutes with orientation switches, edge deletions, edge unzips, and connected sums. In 1997 Murakami and Ohtsuki [MO] first constructed such…