A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Counting complex disordered states by efficient pattern matching: chromatic polynomials and Potts partition functions
2009
New Journal of Physics
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
doi:10.1088/1367-2630/11/2/023001
fatcat:c72vsa5mxredlcrnz5fzznofmi