On traces of tensor representations of diagrams
Alexander Schrijver

TL;DR
This paper characterizes functions on diagrams that are traces of tensor representations, providing a unique correspondence with strongly nondegenerate tensor representations, applicable to various diagram types like knots and group representations.
Contribution
It offers a complete characterization of trace functions on tensor diagram representations and establishes their unique correspondence with strongly nondegenerate tensor representations.
Findings
Characterizes which functions are traces of tensor representations.
Proves each trace corresponds uniquely to a strongly nondegenerate tensor representation.
Applicable to virtual knots, chord diagrams, and group representations.
Abstract
Let be a set, of {\em types}, and let . 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 -linear space, where 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 -valued function on the collection of -diagrams obtained by `decorating' each vertex of a -diagram with the tensor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Topological and Geometric Data Analysis
