On traces of tensor representations of diagrams

DOI10.1016/J.LAA.2015.02.037MaRDI QIDQ2346609zbMATH OpenOpenAlexFDO

Authors Alexander Schrijver

Publication date 2 June 2015

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.04945

zbMATH Keywords

chord diagramdiagrampartition functiontensor representationtracevirtual link

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Geometric invariant theory (14L24) Vector and tensor algebra, theory of invariants (15A72)

Abstract: Let $T$ be a set, of {em types}, and let $iota,o:Too{Z}_{+}$. A {em $T$-diagram} is a locally ordered directed graph $G$ equipped with a function $au:V(G)oT$ such that each vertex $v$ of $G$ has indegree $iota(au(v))$ and outdegree $o(au(v))$. (A directed graph is {em locally ordered} if at each vertex $v$, linear orders of the edges entering $v$ and of the edges leaving $v$ are specified.) Let $V$ be a finite-dimensional $oF$-linear space, where $oF$ is an algebraically closed field of characteristic 0. A function $R$ on $T$ assigning to each $tinT$ a tensor $R(t)in{V}^{\ast otimesiota(t)}otimes{V}^{otimeso(t)}$ is called a {em tensor representation} of $T$. The {em trace} (or {em partition function}) of $R$ is the $oF$-valued function $p_R$ on the collection of $T$-diagrams obtained by `decorating' each vertex $v$ of a $T$-diagram $G$ with the tensor $R(au(v))$, and contracting tensors along each edge of $G$, while respecting the order of the edges entering $v$ and leaving $v$. In this way we obtain a {em tensor network}. We characterize which functions on $T$-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.

Recommendations

• The geometry of tensor calculus. I
• Traced monoidal categories
• A finite-tame-wild trichotomy theorem for tensor diagrams
• Trace diagrams, signed graph colorings, and matrix minors
• Invariant tensor formulas via chord diagrams

Cites work

• Algebraic structures on modules of diagrams
• Characterizing partition functions of the vertex model
• Computational Complexity of Projected Entangled Pair States
• Computations in quantum tensor networks
• Edge coloring models and reflection positivity
• Graph invariants related to statistical mechanical models: Examples and problems
• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• scientific article; zbMATH DE number 3344105 (Why is no real title available?)
• Introduction to Vassiliev knot invariants
• Introduction to virtual knot theory
• INVOLUTORY HOPF ALGEBRAS AND 3-MANIFOLD INVARIANTS
• Quantum computation and the evaluation of tensor networks
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Simulating Quantum Computation by Contracting Tensor Networks
• Symmetry, Representations, and Invariants
• Virtual knot theory
• Virtual knots. The state of the art

Cited in

(8)

• Mixed partition functions and exponentially bounded edge-connection rank
• Tensor diagrams and cluster combinatorics at punctures
• A finite-tame-wild trichotomy theorem for tensor diagrams
• Graph parameters from symplectic group invariants
• Tensor network complexity of multilinear maps
• Some characterizations of \(M\)-tensors via digraphs
• Invariant theory and wheeled PROPs
• Trace diagrams, signed graph colorings, and matrix minors

This page was built for publication: On traces of tensor representations of diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346609)