Related papers: Arrow ribbon graphs
Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
Virtual knots are associated with knot diagrams, which are not obligatory planar. The recently suggested generalization from N=2 to arbitrary N of the Kauffman-Khovanov calculus of cycles in resolved diagrams can be straightforwardly…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
We connect Braided Ribbon Networks to the states of loop quantum gravity. Using this connection we present the reduced link as an invariant which captures information from the embedding of the spin-networks. We also present a means of…
In this paper we construct a Lie algebra representation of the algebraic string bracket on negative cyclic cohomology of an associative algebra with appropriate duality. This is a generalized algebraic version of the main theorem of [AZ]…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the…
A weak chord index $Ind'$ is constructed for self crossing points of virtual links. Then a new writhe polynomial $W$ of virtual links is defined by using $Ind'$. $W$ is a generalization of writhe polynomial defined in [6]. Based on $W$,…
It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate…
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
We study the algebraic rank of a divisor on a graph, an invariant defined using divisors on algebraic curves dual to the graph. We prove it satisfies the Riemann-Roch formula, a specialization property, and the Clifford inequality. We prove…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…