pith. sign in

arxiv: 1503.00337 · v2 · pith:DZXB72UGnew · submitted 2015-03-01 · 🧮 math.QA · math.CO· math.RT

On partition functions for 3-graphs

classification 🧮 math.QA math.COmath.RT
keywords cyclicfunctionsgraphgraphstheorycubicpartitiontheorem
0
0 comments X
read the original abstract

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model (P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, Journal of Combinatorial Theory, Series B 57 (1993) 207--227). They are characterized by `weak reflection positivity', which amounts to the positive semidefiniteness of matrices based on the `$k$-join' of cubic cyclic graphs (for all $k\in\oZ_+$). Basic tools are the representation theory of the symmetric group and geometric invariant theory, in particular the Hanlon-Wales theorem on the decomposition of Brauer algebras and the Procesi-Schwarz theorem on inequalities defining orbit spaces.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.