Families of Graphs with Wr(G,q) Functions That Are Nonanalytic at 1/q=0
Robert Shrock, Shan-Ho Tsai
Abstract
Denoting P(G,q) as the chromatic polynomial for coloring an n-vertex graph G with q colors, and considering the limiting function W(\G\,q) = n ∞P(G,q)1/n, a fundamental question in graph theory is the following: is Wr(\G\,q) = q-1W(\G\,q) analytic or not at the origin of the 1/q plane? (where the complex generalization of q is assumed). This question is also relevant in statistical mechanics because W(\G\,q)=(S0/kB), where S0 is the ground state entropy of the q-state Potts antiferromagnet on the lattice graph \G\, and the analyticity of Wr(\G\,q) at 1/q=0 is necessary for the large-q series expansions of Wr(\G\,q). Although Wr is analytic at 1/q=0 for many \G\, there are some \G\ for which it is not; for these, Wr has no large-q series expansion. It is important to understand the reason for this nonanalyticity. Here we give a general condition that determines whether or not a particular Wr(\G\,q) is analytic at 1/q=0 and explains the nonanalyticity where it occurs. We also construct infinite families of graphs with Wr functions that are non-analytic at 1/q=0 and investigate the properties of these functions. Our results are consistent with the conjecture that a sufficient condition for Wr(\G\,q) to be analytic at 1/q=0 is that \G\ is a regular lattice graph Λ. (This is known not to be a necessary condition).
Create a lesson
Related papers
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits