Skip to main content
QUICK REVIEW

[Paper Review] Exactly Soluble Models for Surface Partition

K. A. Bugaev, J. B. Elliott|ArXiv.org|Jan 29, 2005
Computational Geometry and Mesh Generation3 citations
TL;DR

This paper develops exactly soluble models for surface partition in large clusters using the Hills and Dales Model (HDM), applying Laplace-Fourier transformation to derive exact grand canonical, canonical, and semi-grand canonical surface partitions. It establishes upper and lower bounds for the surface entropy coefficient ω, showing that ω ≈ 1.06009 (upper bound) and ω ≈ 0.283572 (lower bound), with Ising model values falling between these limits.

ABSTRACT

The surface partition of large clusters is studied analytically within a frame-work of the ``Hills and Dales Model''. Three formulations are solved exactly by using the Laplace-Fourier transformation method. In the limit of small amplitude deformations, the ``Hills and Dales Model'' gives upper and lower bounds for the surface entropy coefficient of large clusters. A comparison with the 2- and 3-dimensional Ising model surface entropy coefficients is made.

Motivation & Objective

  • To develop exact analytical solutions for surface partition in finite and large clusters under volume conservation.
  • To derive upper and lower bounds for the surface entropy coefficient ω in the HDM framework.
  • To compare the HDM’s ω bounds with those of 2- and 3-dimensional Ising models.
  • To establish the canonical and semi-grand canonical ensembles as exact formulations for surface deformations with exact volume conservation.
  • To investigate whether the lower ω bound is an infimum for Ising models in higher dimensions.

Proposed method

  • Formulates three ensembles: grand canonical, canonical, and semi-grand canonical, for surface deformations under volume conservation.
  • Applies the Laplace-Fourier transformation technique to solve the surface partition functions exactly for arbitrary cluster size.
  • Uses the excluded volume approximation to model non-overlapping deformations via a geometric degeneracy factor.
  • Derives general analytical expressions for surface partitions in terms of isochoric ensemble singularities.
  • Evaluates asymptotic behavior in the limit of vanishing deformations to extract leading-order corrections and ω coefficients.
  • Solves transcendental equations for singularities to determine the dominant contributions to the partition function.

Experimental results

Research questions

  • RQ1What are the exact analytical expressions for the surface partition functions in the canonical, grand canonical, and semi-grand canonical ensembles under volume conservation?
  • RQ2What are the upper and lower bounds for the surface entropy coefficient ω in the HDM for large clusters?
  • RQ3How do the HDM’s ω bounds compare with the surface entropy coefficients of 2D and 3D Ising models?
  • RQ4Is the lower ω bound from the canonical ensemble an infimum for Ising models in dimensions d > 3?
  • RQ5Can the derived bounds be used to estimate upper and lower limits for the critical temperature of Ising lattices?

Key findings

  • The upper bound for the surface entropy coefficient ω in the grand canonical ensemble is ω ≈ 1.06009, exceeding Fisher’s postulate by about 6%.
  • The lower bound for ω in the canonical ensemble is ω ≈ 0.283572, which is proposed as a candidate infimum for Ising models in higher dimensions.
  • All 2D and 3D Ising model surface entropy coefficients lie strictly between the HDM’s upper and lower ω bounds.
  • The semi-grand canonical ensemble provides an intermediate formulation between the grand canonical and canonical ensembles, with analytically solvable partition functions.
  • The leading-order asymptotic behavior of the canonical and semi-grand canonical surface partitions is derived analytically for large clusters.
  • The critical temperature of Ising lattices is bounded by Tc/J ≤ 3.5264 × (q/d), based on the lower ω bound, suggesting a universal upper limit for Tc in higher dimensions.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.