Totally frustrated states in the chromatic theory of gain graphs

We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of 'qualities' or 'spins' that is permuted by the gain group. In standard coloring the group acts trivially or regularly on each orbit (an example is the Potts model), but in the generalization the action is unrestricted. We show that the number of totally frustrated states satisfies a deletion-contraction law. It is not matroidal except in standard coloring, but it does have a formula in terms of fundamental groups of edge subsets. One can generalize chromatic polynomials by constructing spin sets out of repeated orbits. The dichromatic and Whitney-number polynomials of standard coloring generalize to evaluations of an abstract partition function that lives in the edge ring of the gain graph.

[1]  Thomas Zaslavsky.  Biased Graphs .III. Chromatic and Dichromatic Invariants , 1995, J. Comb. Theory, Ser. B.

[2]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[3]  Michelle L. Wachs,et al.  On geometric semilattices , 1985 .

[4]  F. Guerra.  Spin Glasses , 2005, cond-mat/0507581.

[5]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[6]  P. Doreian,et al.  A partitioning approach to structural balance , 1996 .

[7]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[8]  William T. Tutte.  A Ring in Graph Theory , 1947 .

[9]  Jonathan L. Gross,et al.  Generating all graph coverings by permutation voltage assignments , 1977, Discret. Math..

[10]  Dominic Welsh,et al.  The Tutte polynomial , 1999, Random Struct. Algorithms.

[11]  H. Crapo,et al.  The Tutte polynomial , 1969, 1707.03459.

[12]  Martin Grötschel,et al.  Calculating exact ground states of spin glasses: A polyhedral approach , 1987 .

[13]  G. Rota.  On the Foundations of Combinatorial Theory , 2009 .

[14]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[15]  Thomas Zaslavsky,et al.  Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry , 2002, Discret. Comput. Geom..

[16]  Thomas Zaslavsky,et al.  Biased graphs. II. The three matroids , 1991, J. Comb. Theory, Ser. B.

[17]  Curtis Greenl,et al.  On the Möbius algebra of a partially ordered set , 1973 .

[18]  Thomas Zaslavsky,et al.  Biased graphs. I. Bias, balance, and gains , 1989, J. Comb. Theory, Ser. B.

[19]  S. S. Ryshko,et al.  The Theory of Quality Translations with Applications to Tilings , 1997 .

[20]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[21]  B. S Webb,et al.  Surveys in combinatorics 2005 , 2005 .

[22]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[23]  T. Zaslavsky,et al.  Se p 20 03 Criteria for Balance in Abelian Gain Graphs , with an Application to Piecewise-Linear Geometry ∗ , 2003 .

[24]  Gerard Toulouse,et al.  Theory of the frustration effect in spin glasses: I , 1986 .

[25]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[26]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[27]  Thomas Zaslavsky,et al.  Combinatorial Geometries: The Möbius Function and the Characteristic Polynomial , 1987 .