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

Journal of Physics A Mathematical and General

Recursive method in one-dimensional Ising model

Ezio Marchi, Jorge A. Vila

Published Jul 1, 1980• 4 citations
Publisher

Abstract

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.

DOI
10.1088/0305-4470/13/7/028

Related papers

Recurrence relations in one-dimensional Ising models

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

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.

Physical review. E•Sep 13, 2017•5 citations

Easy Applications of Renormalization Group to Simple Models

W D McComb

Abstract We start with a one-dimensional magnet, in which the individual, microscopic magnets either point up or down but not in any other direction. In physics this is known as the one-dimensional Ising model. The problem it poses is something of a “cheat,” because not only can it be solved exactly but the approximate RG method is readily converted to an exact solution! Nevertheless, it is a nice introduction to how one may calculate the partition function recursively.

•Dec 11, 2003•0 citations

Combinatorial approach to exactly solve the 1D Ising model

Swarnadeep Seth

Abstract The Ising model is a well known statistical model which can be solved exactly by various methods. The most familiar one is the transfer matrix method. Sometimes it can be difficult to approach the open boundary case rather than periodic boundary ones in higher dimensions. But physically it is more intuitive to study the open boundary case, as it gives a closer view of the real system. We have introduced a new method called the pairing method to determine the exact partition function for the simplest case, a 1D Ising lattice. This method simplifies the problem's complexities and reduces it to a pure combinatorial problem. The study also reveals that it is possible to apply this pairing method in the case of a 2D square lattice. The obtained results agree perfectly with the values in the literature and this new approach provides an algorithmic insight to deal with such problems.

European Journal of Physics•Dec 13, 2016•9 citations

Approximate Solutions

Giuseppe Mussardo

Abstract The exact solutions of one-dimensional systems discussed in the previous chapter are particularly simple and mathematically elegant. Unfortunately, they are more an exception than a rule: for higher dimensional lattices, the computation of the partition functions of statistical models usually poses a formidable problem from a mathematical point of view. For that reason, it is of the utmost importance to develop some approximate methods that permit us to analyze the most relevant physical aspects and to extract an estimate of critical exponents or other thermodynamic quantities. In this chapter we will discuss several approximate solutions of the Ising model and its generalizations.

•Aug 27, 2009•0 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

On the use of different matrix products to solve finite three-dimensional Ising systems

Ph. Audit

A new matrix product is defined and used in connection with three other well-known matrix products in order to derive analytical solutions of finite three-dimensional Ising systems. As an example, the exact partition function of the periodic anisotropic 2 x 2 x 2 lattice in a field is evaluated from which analytical expressions for the magnetization and the specific heat of this system follow.

Journal de physique•Jan 1, 1986•2 citations
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.
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.
Abstract The Ising model is a well known statistical model which can be solved exactly by various methods. The most familiar one is the transfer matrix method. Sometimes it can be difficult to approach the open boundary case rather than periodic boundary ones in higher dimensions. But physically it is more intuitive to study the open boundary case, as it gives a closer view of the real system. We have introduced a new method called the pairing method to determine the exact partition function for the simplest case, a 1D Ising lattice. This method simplifies the problem's complexities and reduces it to a pure combinatorial problem. The study also reveals that it is possible to apply this pairing method in the case of a 2D square lattice. The obtained results agree perfectly with the values in the literature and this new approach provides an algorithmic insight to deal with such problems.
Abstract The exact solutions of one-dimensional systems discussed in the previous chapter are particularly simple and mathematically elegant. Unfortunately, they are more an exception than a rule: for higher dimensional lattices, the computation of the partition functions of statistical models usually poses a formidable problem from a mathematical point of view. For that reason, it is of the utmost importance to develop some approximate methods that permit us to analyze the most relevant physical aspects and to extract an estimate of critical exponents or other thermodynamic quantities. In this chapter we will discuss several approximate solutions of the Ising model and its generalizations.
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.