Abstract
Let be a set, of {\em types}, and let $ι,o:T\to\oZ_+$. A {\em -diagram} is a locally ordered directed graph equipped with a function such that each vertex of has indegree and outdegree . (A directed graph is {\em locally ordered} if at each vertex , linear orders of the edges entering and of the edges leaving are specified.) Let be a finite-dimensional $\oF$-linear space, where $\oF$ is an algebraically closed field of characteristic 0. A function on assigning to each a tensor is called a {\em tensor representation} of . The {\em trace} (or {\em partition function}) of is the $\oF$-valued function on the collection of -diagrams obtained by `decorating' each vertex of a -diagram with the tensor , and contracting tensors along each edge of , while respecting the order of the edges entering and leaving . In this way we obtain a {\em tensor network}. We characterize which functions on -diagrams are traces, and show that each trace comes from a unique `strongly nondegenerate' tensor representation. The theorem applies to virtual knot diagrams, chord diagrams, and group representations.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.