Mixed partition functions and exponentially bounded edge-connection rank

Regts, Guus; Sevenster, Bart

Annales de l’Institut Henri Poincaré D, Tome 8 (2021) no. 2, pp. 179-200.

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition functions. Mixed partition functions can be seen as a generalization of partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe and V. F. R. Jones, Graph invariants related to statistical mechanical models: examples and problems, J. Combin. Theory Ser. B 57 (1993), no. 2, 207–227.] and they are related to invariant theory of orthosymplectic supergroup. We moreover show that evaluations of the characteristic polynomial of a simple graph are examples of mixed partition functions, answering a question of de la Harpe and Jones. (NOTE. Some of the results of this paper were announced in an extended abstract: G. Regts and B. Sevenster, Partition functions from orthogonal and symplectic group invariants, Electron. Notes Discrete Math. 61 (2017), 1011–1017. Unfortunately that reference contains a mistake; we will comment on that below).

Classification : 05-XX, 15-XX
Mots-clés : Partition function, graph parameter, orthogonal group, symplectic group, orthosymplectic Lie super algebra, circuit partition polynomial, connection matrix