Graph parameters from symplectic group invariants
From MaRDI portal
Publication:345132
DOI10.1016/j.jctb.2016.10.002zbMath1350.05065arXiv1602.02026OpenAlexW2964031030MaRDI QIDQ345132
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.02026
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Partition functions from orthogonal and symplectic group invariants ⋮ Mixed partition functions and exponentially bounded edge-connection rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing partition functions of the vertex model
- Characterizing partition functions of the edge-coloring model by rank growth
- Graph invariants related to statistical mechanical models: Examples and problems
- Connection matrices and Lie algebra weight systems for multiloop chord diagrams
- On the decomposition of Brauer's centralizer algebras
- Graph invariants in the spin model
- Identities for circuit partition polynomials, with applications to the Tutte polynomial
- On the second fundamental theorem of invariant theory for the orthosymplectic supergroup
- Evaluations of the circuit partition polynomial
- On traces of tensor representations of diagrams
- Combinatorics of symplectic invariant tensors
- Introduction to Vassiliev Knot Invariants
- Computational Complexity of Holant Problems
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Edge coloring models and reflection positivity
- Contractors and connectors of graph algebras
- Symmetry, Representations, and Invariants
- Simulating Quantum Computation by Contracting Tensor Networks
- The Computational Complexity of Tutte Invariants for Planar Graphs
- A complete dichotomy rises from the capture of vanishing signatures
This page was built for publication: Graph parameters from symplectic group invariants
