Trace diagrams, signed graph colorings, and matrix minors

DOI10.2140/INVOLVE.2010.3.33zbMATH Open1221.05157arXiv0903.1373OpenAlexW3101240982MaRDI QIDQ992528FDOQ992528

Authors: Steven Morse, Elisha Peterson 

Publication date: 9 September 2010

Published in: Involve (Search for Journal in Brave)

Abstract: Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph coloring, and prove that they may be efficiently represented in terms of matrix minors. Using this viewpoint, we provide new proofs of several standard determinant formulas and a new generalization of the Jacobi determinant theorem.

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

Recommendations

• A graph theoretic proof of the fundamental trace identity
• Eulerian trace identities
• scientific article; zbMATH DE number 6708194
• Matrices, Digraphs, and Determinants
• On traces of tensor representations of diagrams

zbMATH Keywords

multilinear algebradeterminantgraph coloringmatrix minorscofactorplanar algebratensor diagramstrace diagrams

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Coloring of graphs and hypergraphs (05C15) Topological methods in group theory (57M07) Actions of groups and semigroups; invariant theory (associative rings and algebras) (16W22)

Cited In (3)

• Dimers, webs, and local systems
• A graph theoretic proof of the fundamental trace identity
• On traces of tensor representations of diagrams

This page was built for publication: Trace diagrams, signed graph colorings, and matrix minors

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