Related papers: Symmetric union diagrams and refined spin models
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
We establish a direct map between refined topological vertex and sl(N) homological invariants of the of Hopf link, which include Khovanov-Rozansky homology as a special case. This relation provides an exact answer for homological invariants…
We classify the possible finite symmetries of conformal field theories with an affine Lie algebra su(2) and su(3), and discuss the results from the perspective of the graphs associated with the modular invariants. The highlights of the…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
Topological nodal line semimetals host stable chained, linked, or knotted line degeneracies in momentum space protected by symmetries. In this paper, we use the Jones polynomial as a general topological invariant to capture the global knot…
Unveiling hidden symmetries within Feynman diagrams is crucial for achieving more efficient computations in high-energy physics. In this paper, we study the symmetries underlying the causal Loop-Tree Duality (LTD) representations through a…
We investigate the increasingly prominent task of jointly inferring multiple networks from nodal observations. While most joint inference methods assume that observations are available at all nodes, we consider the realistic and more…
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
This work is dedicated to the consideration of the construction of a representation of braid group generators from vertex models with $N$-states, which provides a great way to study the knot invariant. An algebraic formula is proposed for…
We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…
Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…
The `spider theorem' for a general Frobenius algebra $A$, classifies all maps $A^{\otimes m}\to A^{\otimes n}$ that are built from the operations and, in a graphical representation, represented by a {\it connected} diagram. Here the algebra…
We study the exponential map of connected symmetric spaces and characterize, in terms of midpoints and of infinitesimal conditions, when it is a diffeomorphism, generalizing the Dixmier-Saito theorem for solvable Lie groups. We then give a…
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs…
Using determinant representations for partition functions of the corresponding square ice models and the method proposed recently by one of the authors, we investigate refined enumerations of vertically symmetric alternating-sign matrices,…
A classical spin network consists of a ribbon graph (i.e., an abstract graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The standard evaluation of a spin network is…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…