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

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

2009-04-27

arxiv.org/abs/0904.4010v1

New J. Phys. 11:023001 (2009); freely available online

Physics

Condensed Matter

Statistical Mechanics

7 pages, 4 figures

Scientific paper

10.1088/1367-2630/11/2/023001

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.

Affiliated with

Also associated with

No associations

Rating

Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321973