Related papers: Skein relations for spin networks, modified
The local minima (inherent structures) of a system and their associated transition links give rise to a network. Here we consider the topological and distance properties of such a network in the context of spin glasses. We use steepest…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
This article presents a survey of some recent results in the theory of spatial graphs. In particular, we highlight results related to intrinsic knotting and linking and results about symmetries of spatial graphs. In both cases we consider…
Following the program of investigation of alternative spinor duals potentially applicable to fermions beyond the standard model, we demonstrate explicitly the existence of several well-defined spinor duals. Going further we define a mapping…
The spaces of invariants of tensor powers of the defining representation of Sp(2n) are provided with the bases parametrized by symplectic wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris,…
The $sp(2M)$ invariant unfolded system is considered in the periodic twistor-like spinor space. Complete set of non-trivial charges corresponding to the global symmetry compatible with the periodicity conditions is constructed. Residual…
The space of invariants of a tensor product of representations of SL(n) is provided with the basis parametrized by wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris, named here L-tris.
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…
In this paper, we compute the graph skein algebra of the punctured disk with two holes. Then, we apply the graph skein techniques developed here to establish necessary conditions for a spatial graph to have a symmetry of order $p$, where…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…
Spin network technique is usually generalized to relativistic case by changing $SO(4)$ group -- Euclidean counterpart of the Lorentz group -- to its universal spin covering $SU(2)\times SU(2)$, or by using the representations of $SO(3,1)$…
The family of planar graphs is a particularly important family and models many real-world networks. In this paper, we propose a principled framework based on the widely-known Apollonian packing process to generate new planar network, i.e.,…
We study the problem of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted a lot of attention. For list packing the setup is similar but we seek a…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
We compute the Schur indices in the presence of some line operators based on our con- jectural formula introduced in [1]. In particular, we focus on the rank 1 superconformal field theories with the enhanced global symmetry and the free…
We define supersymmetric spin networks, which provide a complete set of gauge invariant states for supergravity and supersymmetric gauge theories. The particular case of Osp(1/2) is studied in detail and applied to the non-perturbative…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…
This paper extends the Birman-Wenzl category by including a spin representation and then developing the recoupling theory, following Cvitanovic. In particular this gives a q-analogue of the chromatic evaluation of a spin network. The…