Characterizing partition functions of the vertex model

DOI10.1016/J.JALGEBRA.2011.10.030MaRDI QIDQ420721zbMATHOpenAlexFDO

Authors Dion Gijswijt, Guus Regts, Jan Draisma, László Lovász, Alexander Schrijver

Publication date 23 May 2012

Published in Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

graph invariantorthogonal grouppartition functioninvariant theoryvertex modelfirst fundamental theoremsecond fundamental theorem

Mathematics Subject Classification ID

Graph polynomials (05C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We moreover characterize when the vertex model can be taken so that its moment matrix has finite rank.

Recommendations

• Partition functions from orthogonal and symplectic group invariants
• Mixed partition functions and exponentially bounded edge-connection rank
• A characterization of edge-reflection positive partition functions of vertex-coloring models
• On partition functions for 3-graphs
• Graph parameters from symplectic group invariants

Cites work

• scientific article; zbMATH DE number 3908560 (Why is no real title available?)
• A little statistical mechanics for the graph theorist
• Edge coloring models and reflection positivity
• Edge coloring models as singular vertex coloring models
• Graph invariants in the spin model
• Graph invariants related to statistical mechanical models: Examples and problems
• Hilbert's Nullstellensatz in Infinite-Dimensional Space
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Symmetry, Representations, and Invariants
• The Potts model and the Tutte polynomial.
• The multivariate Tutte polynomial (alias Potts model) for graphs and matroids

Cited in

(20)

• On Lie algebra weight systems for 3-graphs
• Edge-reflection positivity and weighted graph homomorphisms
• Characterizing partition functions of the spin model by rank growth
• Zero-freeness and approximation of real Boolean Holant problems
• Connection matrices and Lie algebra weight systems for multiloop chord diagrams
• Graph parameters from symplectic group invariants
• On traces of tensor representations of diagrams
• Characterizing partition functions of the edge-coloring model by rank growth
• Mixed partition functions and exponentially bounded edge-connection rank
• Graph invariants in the spin model
• Tensor invariants for certain subgroups of the orthogonal group
• Character decomposition of Potts model partition functions. II: Toroidal geometry
• Zero-free regions of partition functions with applications to algorithms and graph limits
• Compact orbit spaces in Hilbert spaces and limits of edge-colouring models
• Edge coloring models as singular vertex coloring models
• Partition functions from orthogonal and symplectic group invariants
• FKT is not universal -- a planar holant dichotomy for symmetric constraints
• Perfect matchings, rank of connection tensors and graph homomorphisms
• On partition functions for 3-graphs
• The rank of edge connection matrices and the dimension of algebras of invariant tensors

This page was built for publication: Characterizing partition functions of the vertex model

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