2014/06/06 by Barvinok, Alexander, Soberón, Pablo · 2 citations
#15A15 #60C05 #68C25 #68W25 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.1406.1771
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as an efficient procedure to distinguish pairs of edge-colored graphs with many color-preserving homomorphisms G --> H from pairs of graphs that need to be substantially modified to acquire a color-preserving homomorphism G --> H.