Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:hep-lat/9301017 · Physical review. B, Condensed matter

Low-temperature expansions for Potts models

Gyan Bhanot, Michael J. Creutz, Uwe Glässner, Ivan Horváth A, Jan Lacki, Klaus Schilling, John D. Weckel

Published Sep 1, 1993• 21 citations
arXivHTMLPDF

Abstract

On simple-cubic lattices, we compute low-temperature series expansions for the energy, magnetization, and susceptibility of the three-state Potts model in D=2 and D=3 to 45 and 39 excited bonds, respectively, and the eight-state Potts model in D=2 to 25 excited bonds. We use a recursive procedure that enumerates states explicitly. We analyze the series with Dlog Pad\'e analysis and inhomogeneous differential approximants.

DOI
10.1103/physrevb.48.6183

Related papers

Low temperature expansion for the Ising model

Gyan Bhanot, Michael J. Creutz, Jan Lacki

On simple cubic lattices, we compute the low-temperature expansion for the energy of the Ising model through 50 excited bonds in three dimensions and 44 excited bonds in four dimensions. We also give the magnetization through 42 excited bonds. Our method is a recursive enumeration of states with given energies on a set of finite lattices with generalized helical boundary conditions. A linear combination of such lattices cancels finite volume effects.

arXiv:hep-lat/9206020•Physical Review Letters•Sep 28, 1992•56 citations

Series studies of the Potts model: III. The 3-state model on the simple cubic lattice

Anthony John Guttmann, Ian Graham Enting

For paper II, see ibid, vol. 27, p.1503 (1994). The finite-lattice method of series expansion has been used to extend low-temperature series for the partition function, order parameter and susceptibility of the 3-state Potts model on the simple cubic lattice to order z 43 and the high-temperature expansion of the partition function to order v 21 . We use the numerical data to show that the transition is first-order, and estimate the latent heat, the discontinuity in the magnetization, and a number of other critical parameters.

arXiv:hep-lat/9312083•Journal of Physics A Mathematical and General•Sep 7, 1994•31 citations

Series studies of the Potts model. I. The simple cubic Ising model

A J Guttmann, I G Enting

The finite-lattice method of series expansion is generalized to the q-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained, unlike two-dimensional lattices where the computational requirements grow exponentially with the number of terms. For the Ising (q=2) case the authors have extended the low-temperature series for the partition functions, magnetization and zero-field susceptibility to u 26 from u 20 . The high-temperature series for the zero-field partition function is extended from nu 18 to nu 22 . Subsequent analysis gives critical exponents in agreement with those from field theory.

arXiv:hep-lat/9212032•Journal of Physics A Mathematical and General•Feb 21, 1993•47 citations

Low-temperature series for the square lattice Potts model using the improved finite-lattice method

H. Arisue, Kanehito Tabata

The low-temperature series are calculated for the free energy, magnetization and susceptibility in the Q-state Potts model on the square lattice, using the improved algorithm of the finite lattice method. The series are obtained to the order of for each of Q = 5 - 50, and the result of their Padé-type analysis is compared with those of the large-Q expansion and the Monte Carlo simulations.

arXiv:cond-mat/9704148•Journal of Physics A Mathematical and General•May 21, 1997•6 citations

State counting and low-temperature series

Michael J. Creutz

I present a simple numerical technique for evaluating the low-temperature expansion for discrete statistical systems. I begin with a recursive procedure on finite lattices to count the states of a given energy. Comparing these numbers on different lattice sizes, I extract coefficients for the infinite-volume series. I test the method with the three-dimensional Ising model, obtaining the expansion of the average energy through terms involving 34 excited bonds.

Physical review. B, Condensed matter•May 1, 1991•39 citations

Yet another way to obtain low temperature expansions for discrete spin systems

Claus Vohwinkel, Hamburg (Germany). Projekttraeger ''Erforschung der Kondensierten Materie: Synchrotronstrahlung'' Deutsches Elektronen-Synchrotron (DESY)

I present a modification of the shadow-lattice technique, which allows one to derive low temperature series for discrete spin models to high orders. Results are given for the 3-d Ising model up to 64 excited bonds, for the 4-d Ising model up to 96 excited bonds and the 3-d Potts model up to 56 excited bonds. Series expansions are a major tool to obtain critical properties of statistical systems and to test Monte Carlo programs. Usually series are derived using graphical techniques, but recently a method using direct enumeration of the relevant configurations on the lattice has been proposed [1]. Whereas the diagrammatic techniques have the disadvantage that they are hard to port to parallel or vector machines, the direct enumeration relies heavily on fast machines, taking full advantage of parallel architecture, but is computationally too demanding to be implemented on smaller machines. One advantage of direct enumeration is that it is done automatically, i.e. once the program is set up it can in principle calculate the series to any given order. In this paper I shall sketch a method which is a variant of the shadow method (see for

•Jan 1, 1992•16 citations
On simple-cubic lattices, we compute low-temperature series expansions for the energy, magnetization, and susceptibility of the three-state Potts model in D=2 and D=3 to 45 and 39 excited bonds, respectively, and the eight-state Potts model in D=2 to 25 excited bonds. We use a recursive procedure that enumerates states explicitly. We analyze the series with Dlog Pad'e analysis and inhomogeneous differential approximants.
For paper II, see ibid, vol. 27, p.1503 (1994). The finite-lattice method of series expansion has been used to extend low-temperature series for the partition function, order parameter and susceptibility of the 3-state Potts model on the simple cubic lattice to order z 43 and the high-temperature expansion of the partition function to order v 21 . We use the numerical data to show that the transition is first-order, and estimate the latent heat, the discontinuity in the magnetization, and a number of other critical parameters.
The finite-lattice method of series expansion is generalized to the q-state Potts model on the simple cubic lattice. It is found that the computational effort grows exponentially with the square of the number of series terms obtained, unlike two-dimensional lattices where the computational requirements grow exponentially with the number of terms. For the Ising (q=2) case the authors have extended the low-temperature series for the partition functions, magnetization and zero-field susceptibility to u 26 from u 20 . The high-temperature series for the zero-field partition function is extended from nu 18 to nu 22 . Subsequent analysis gives critical exponents in agreement with those from field theory.
I present a modification of the shadow-lattice technique, which allows one to derive low temperature series for discrete spin models to high orders. Results are given for the 3-d Ising model up to 64 excited bonds, for the 4-d Ising model up to 96 excited bonds and the 3-d Potts model up to 56 excited bonds. Series expansions are a major tool to obtain critical properties of statistical systems and to test Monte Carlo programs. Usually series are derived using graphical techniques, but recently a method using direct enumeration of the relevant configurations on the lattice has been proposed [1]. Whereas the diagrammatic techniques have the disadvantage that they are hard to port to parallel or vector machines, the direct enumeration relies heavily on fast machines, taking full advantage of parallel architecture, but is computationally too demanding to be implemented on smaller machines. One advantage of direct enumeration is that it is done automatically, i.e. once the program is set up it can in principle calculate the series to any given order. In this paper I shall sketch a method which is a variant of the shadow method (see for