Tensor networks and the enumerative geometry of graphs
From MaRDI portal
Publication:2146172
Recommendations
Cites work
- Enumeration of Grothendieck's dessins and KP hierarchy
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 1465768 (Why is no real title available?)
- scientific article; zbMATH DE number 3344105 (Why is no real title available?)
- Lie algebras and the four color theorem
- Simulating Quantum Computation by Contracting Tensor Networks
Cited in
(10)- Invariants of composite networks arising as a tensor product
- Tensor diagrams and cluster combinatorics at punctures
- On the closedness and geometry of tensor network state sets
- The tensor network theory library
- Contraction of matchgate tensor networks on non-planar graphs
- Duality of graphical models and tensor networks
- Generalization of the Bollobás-Riordan polynomial for tensor graphs
- Some characterizations of \(M\)-tensors via digraphs
- \(W\)-graph versions of tensoring with the \(\mathcal S_n\) defining representation.
- Tensor network states and geometry
This page was built for publication: Tensor networks and the enumerative geometry of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146172)