Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 209 tok/s Pro
GPT OSS 120B 458 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Exact Results on Potts Model Partition Functions in a Generalized External Field and Weighted-Set Graph Colorings (1009.1182v1)

Published 7 Sep 2010 in cond-mat.stat-mech

Abstract: We present exact results on the partition function of the $q$-state Potts model on various families of graphs $G$ in a generalized external magnetic field that favors or disfavors spin values in a subset $I_s = {1,...,s}$ of the total set of possible spin values, $Z(G,q,s,v,w)$, where $v$ and $w$ are temperature- and field-dependent Boltzmann variables. We remark on differences in thermodynamic behavior between our model with a generalized external magnetic field and the Potts model with a conventional magnetic field that favors or disfavors a single spin value. Exact results are also given for the interesting special case of the zero-temperature Potts antiferromagnet, corresponding to a set-weighted chromatic polynomial $Ph(G,q,s,w)$ that counts the number of colorings of the vertices of $G$ subject to the condition that colors of adjacent vertices are different, with a weighting $w$ that favors or disfavors colors in the interval $I_s$. We derive powerful new upper and lower bounds on $Z(G,q,s,v,w)$ for the ferromagnetic case in terms of zero-field Potts partition functions with certain transformed arguments. We also prove general inequalities for $Z(G,q,s,v,w)$ on different families of tree graphs. As part of our analysis, we elucidate how the field-dependent Potts partition function and weighted-set chromatic polynomial distinguish, respectively, between Tutte-equivalent and chromatically equivalent pairs of graphs.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)