Mixed partition functions and exponentially bounded edge-connection rank

DOI10.4171/AIHPD/100zbMath1465.05068arXiv1807.04494OpenAlexW3134256012MaRDI QIDQ2031486

Guus Regts, Bart Sevenster

Publication date: 9 June 2021

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

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

zbMATH Keywords

symplectic grouporthogonal grouppartition functiongraph parameterconnection matrixcircuit partition polynomialorthosymplectic Lie super algebra

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On partition functions for 3-graphs
• Graph parameters from symplectic group invariants
• Tensor invariants for certain subgroups of the orthogonal group
• Characterizing partition functions of the vertex model
• Characterizing partition functions of the edge-coloring model by rank growth
• The first fundamental theorem of invariant theory for the orthosymplectic supergroup
• Spectra of graphs
• Graph invariants related to statistical mechanical models: Examples and problems
• Connection matrices and Lie algebra weight systems for multiloop chord diagrams
• Identities for circuit partition polynomials, with applications to the Tutte polynomial
• On the existence of real R-matrices for virtual link invariants
• Partition functions from orthogonal and symplectic group invariants
• Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras
• Evaluations of the circuit partition polynomial
• Mathematical foundations of supersymmetry
• On traces of tensor representations of diagrams
• Invariants of the orthosymplectic Lie superalgebra and super Pfaffians
• Introduction to Vassiliev Knot Invariants
• Computational Complexity of Holant Problems
• Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Edge coloring models and reflection positivity
• Simulating Quantum Computation by Contracting Tensor Networks

This page was built for publication: Mixed partition functions and exponentially bounded edge-connection rank