Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions

Abstract

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in mathematical graph theory, and in computer science. Counting problems, however, are among the hardest problems to access computationally. Here, we suggest a novel method to access a benchmark counting problem, finding chromatic polynomials of graphs. We develop a vertex-oriented symbolic pattern matching algorithm that exploits the equivalence between the chromatic polynomial and the zero-temperature partition function of the Potts antiferromagnet on the same graph. Implementing this bottom-up algorithm using appropriate computer algebra, the new method outperforms standard top-down methods by several orders of magnitude, already for moderately sized graphs. As a first application, we compute chromatic polynomials of samples of the simple cubic lattice, for the first time computationally accessing three-dimensional lattices of physical relevance. The method offers straightforward generalizations to several other counting problems.

7 pages, 4 figures

References in corpus (12)

• The analytical value of the electron (g-2) at order alpha^3 in QED
• The number of guards needed by a museum: A phase transition in vertex covering of random graphs
• Three-loop matching of the dipole operators for b -> s gamma and b -> s g
• Pinch Points and Kasteleyn Transitions: How Spin Ice Changes its Entropy
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models I. General Theory and Square-Lattice Chromatic Polynomial
• Chromatic Polynomials for Families of Strip Graphs and their Asymptotic Limits
• Chromatic Polynomials, Potts Models and All That
• Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models II. Extended Results for Square-Lattice Chromatic Polynomial
• Complex-Temperature Phase Diagrams for the q-State Potts Model on Self-Dual Families of Graphs and the Nature of the $q\to \infty$ Limit
• Reliability Polynomials and their Asymptotic Limits for Families of Graphs
• Exact T=0 Partition Functions for Potts Antiferromagnets on Sections of the Simple Cubic Lattice

Cited by in corpus (2)

• The Multithreaded version of FORM
• Chromatic polynomials of random graphs