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

Physical review. E

Recurrence relations in one-dimensional Ising models

C. M. S. da Conceição, Raphael N. P. Maia

Published Sep 13, 2017• 5 citations
Publisher

Abstract

The exact finite-size partition function for the nonhomogeneous one-dimensional (1D) Ising model is found through an approach using algebra operators. Specifically, in this paper we show that the partition function can be computed through a trace from a linear second-order recurrence relation with nonconstant coefficients in matrix form. A relation between the finite-size partition function and the generalized Lucas polynomials is found for the simple homogeneous model, thus establishing a recursive formula for the partition function. This is an important property and it might indicate the possible existence of recurrence relations in higher-dimensional Ising models. Moreover, assuming quenched disorder for the interactions within the model, the quenched averaged magnetic susceptibility displays a nontrivial behavior due to changes in the ferromagnetic concentration probability.

DOI
10.1103/physreve.96.032121

Related papers

Recursion relations for the partition function of the two-dimensional Ising model

Michael Kästner

The partition function of the two-dimensional Ising model on a square lattice with nearest-neighbour interactions and periodic boundary conditions is investigated. Kaufman [Phys. Rev. 76, 1232--1243 (1949)] gave a solution for this function consisting of four summands. The summands are rewritten as functions of a low-temperature expansion variable, resulting in polynomials with integer coefficients. Considering these polynomials for system sizes $2^m\times 2^n$ ($m,n\in\N$), a variety of recursion relations in $m,n$ are found. The recursions reveal a rich structure of the partition function and can be employed to render the computer algebra calculation of the microcanonical partition function more efficient.

arXiv:cond-mat/0605568•May 23, 2006•0 citations

Recursive method in one-dimensional Ising model

Ezio Marchi, Jorge A. Vila

The authors introduce a new recursive method which allows one to solve exactly one-dimensional Ising problems with higher-order interactions. The new method presents some important features, for example its exactness and the computational ease of its solution. They present a new method for evaluating the partition function. Moreover an application of this to the general approach is given and an analytic solution is found.

Journal of Physics A Mathematical and General•Jul 1, 1980•4 citations

An exact solution to the partition function of the finite-size Ising Model

Rong Wei

There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using an elementary but rigorous method, we obtain an exact solution to the partition function of the Ising model with $N$ lattice sites. It is a sum of $2^N$ exponential functions and holds for $D$-dimensional ($D=1,2,3,...$) Ising model with or without the external field. This solution provides a new insight into the problem of the Ising model and the related difficulties, and new understanding of the classic exact solutions for one-dimensional (1D) (Kramers and Wannier, 1941) or 2D Ising model (Onsager, 1944). With this solution, the specific heat and magnetisation of a simple 3D Ising model are calculated, which are consistent with the results from experiments and/or numerical simulations. Furthermore, the solution here and the related approaches, can also be available to other models like the percolation and/or the Potts model.

arXiv:1805.01366•May 2, 2018•1 citation

Many-Neighbored Ising Chain

John F. Dobson

Using a method suggested by Montroll, we extend the well-known matrix formulation of the nearest-neighbor one-dimensional Ising problem to allow for interactions with an arbitrary finite range n, general spin l, and an applied magnetic field B. We exhibit the relevant matrix element explicitly and hence formally obtain the partition function via an eigenvalue problem of order (2l + 1)n. For the case B = 0, l = ½ we introduce a change of variable which simplifies the partition function while still allowing a matrix formulation. Using this approach we have computed specific-heat curves for infinite, ferromagnetic Ising chains with interactions of range n (n ≤ 7). We prove in an appendix that open and cyclic boundary conditions are equivalent for the system under consideration.

Journal of Mathematical Physics•Jan 1, 1969•51 citations

Estimation of Magnetization, Susceptibility and Specific heat for the two-dimensional Ising Model in a Non-zero Magnetic field

G. Nandhini, Kumar, M. Vinoth, M.V. Sangaranarayanan

The partition functions for two-dimensional nearest neighbour Ising model in a non-zero magnetic field have been derived for finite square lattices with the help of graph theoretical procedures, show-bit algorithm, enumeration of configurations and transfer matrix methods. A new recurrence relation valid for all lattice sizes is proposed. A novel method of computing the critical temperature has been demonstrated. The magnetization and susceptibility for infinite lattices in the presence of magnetic field is estimated. The critical exponent δ pertaining to the magnetization has also been computed.

arXiv:1006.0351•Jun 2, 2010•1 citation

Statistics of the Two-Dimensional Ferromagnet. Part I

H. A. Kramers, Gregory H. Wannier

In an effort to make statistical methods available for the treatment of cooperational phenomena, the Ising model of ferromagnetism is treated by rigorous Boltzmann statistics. A method is developed which yields the partition function as the largest eigenvalue of some finite matrix, as long as the manifold is only one dimensionally infinite. The method is carried out fully for the linear chain of spins which has no ferromagnetic properties. Then a sequence of finite matrices is found whose largest eigenvalue approaches the partition function of the two-dimensional square net as the matrix order gets large. It is shown that these matrices possess a symmetry property which permits location of the Curie temperature if it exists and is unique. It lies at $\frac{J}{k{T}_{c}}=0.8814$ if we denote by $J$ the coupling energy between neighboring spins. The symmetry relation also excludes certain forms of singularities at ${T}_{c}$, as, e.g., a jump in the specific heat. However, the information thus gathered by rigorous analytic methods remains incomplete.

Physical Review•Aug 1, 1941•1,810 citations
The exact finite-size partition function for the nonhomogeneous one-dimensional (1D) Ising model is found through an approach using algebra operators. Specifically, in this paper we show that the partition function can be computed through a trace from a linear second-order recurrence relation with nonconstant coefficients in matrix form. A relation between the finite-size partition function and the generalized Lucas polynomials is found for the simple homogeneous model, thus establishing a recursive formula for the partition function. This is an important property and it might indicate the possible existence of recurrence relations in higher-dimensional Ising models. Moreover, assuming quenched disorder for the interactions within the model, the quenched averaged magnetic susceptibility displays a nontrivial behavior due to changes in the ferromagnetic concentration probability.
The partition function of the two-dimensional Ising model on a square lattice with nearest-neighbour interactions and periodic boundary conditions is investigated. Kaufman [Phys. Rev. 76, 1232--1243 (1949)] gave a solution for this function consisting of four summands. The summands are rewritten as functions of a low-temperature expansion variable, resulting in polynomials with integer coefficients. Considering these polynomials for system sizes 2m×2n2^m\times 2^n2m×2n (m,n∈Nm,n\in\Nm,n∈N), a variety of recursion relations in m,nm,nm,n are found. The recursions reveal a rich structure of the partition function and can be employed to render the computer algebra calculation of the microcanonical partition function more efficient.
There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using an elementary but rigorous method, we obtain an exact solution to the partition function of the Ising model with NNN lattice sites. It is a sum of 2N2^N2N exponential functions and holds for DDD-dimensional (D=1,2,3,...D=1,2,3,...D=1,2,3,...) Ising model with or without the external field. This solution provides a new insight into the problem of the Ising model and the related difficulties, and new understanding of the classic exact solutions for one-dimensional (1D) (Kramers and Wannier, 1941) or 2D Ising model (Onsager, 1944). With this solution, the specific heat and magnetisation of a simple 3D Ising model are calculated, which are consistent with the results from experiments and/or numerical simulations. Furthermore, the solution here and the related approaches, can also be available to other models like the percolation and/or the Potts model.
Using a method suggested by Montroll, we extend the well-known matrix formulation of the nearest-neighbor one-dimensional Ising problem to allow for interactions with an arbitrary finite range n, general spin l, and an applied magnetic field B. We exhibit the relevant matrix element explicitly and hence formally obtain the partition function via an eigenvalue problem of order (2l + 1)n. For the case B = 0, l = ½ we introduce a change of variable which simplifies the partition function while still allowing a matrix formulation. Using this approach we have computed specific-heat curves for infinite, ferromagnetic Ising chains with interactions of range n (n ≤ 7). We prove in an appendix that open and cyclic boundary conditions are equivalent for the system under consideration.
The partition functions for two-dimensional nearest neighbour Ising model in a non-zero magnetic field have been derived for finite square lattices with the help of graph theoretical procedures, show-bit algorithm, enumeration of configurations and transfer matrix methods. A new recurrence relation valid for all lattice sizes is proposed. A novel method of computing the critical temperature has been demonstrated. The magnetization and susceptibility for infinite lattices in the presence of magnetic field is estimated. The critical exponent δ pertaining to the magnetization has also been computed.
In an effort to make statistical methods available for the treatment of cooperational phenomena, the Ising model of ferromagnetism is treated by rigorous Boltzmann statistics. A method is developed which yields the partition function as the largest eigenvalue of some finite matrix, as long as the manifold is only one dimensionally infinite. The method is carried out fully for the linear chain of spins which has no ferromagnetic properties. Then a sequence of finite matrices is found whose largest eigenvalue approaches the partition function of the two-dimensional square net as the matrix order gets large. It is shown that these matrices possess a symmetry property which permits location of the Curie temperature if it exists and is unique. It lies at JkTc=0.8814\frac{J}{k{T}_{c}}=0.8814kTc​J​=0.8814 if we denote by JJJ the coupling energy between neighboring spins. The symmetry relation also excludes certain forms of singularities at Tc{T}_{c}Tc​, as, e.g., a jump in the specific heat. However, the information thus gathered by rigorous analytic methods remains incomplete.