The analytic structure of lattice models — why can’t we solve most models?
- 26 Downloads
We investigate the solvability of a variety of well-known problems in lattice statistical mechanics. We provide a new numerical procedure which enables one to conjecture whether the solution falls into a class of functions calleddifferentiably finite functions. Almost all solved problems fall into this class. The fact that one can conjecture whether a given problem is or is not D-finite then informs one as to whether the solution is likely to be tractable or not. We also show how, for certain problems, it is possible to prove that the solutions are notD-finite, based on the work of Rechnitzer [1–3].
KeywordsSolvability differentiably finite bond animal Ising model susceptibility self-avoiding walks self-avoiding polygons
PACS Nos05.50.+q 02.90.+p
Unable to display preview. Download preview PDF.
- A Rechnitzer, Haruspicy 2: The self-avoiding polygon generating function is not Definite, accepted for publication inJ. Combinatorial Theory-Series A Google Scholar
- A Rechnitzer, Haruspicy 3: The directed bond-animal generating function is not D-finite, to appear inJ. Combinatorial Theory-Series A Google Scholar
- GFUN, a program developed by B Salvy, P Zimmerman, F Chyzak and colleagues at INRIA, France. Available from http://pauillac.inria.fr/algoGoogle Scholar
- A J Guttmann, Asymptotic Analysis of Power Series Expansions, inPhase transitions and critical phenomena, edited C Domb and J Lebowitz (Academic Press, 1989) vol. 13, pp. 1–234Google Scholar
- I G Enting,Nucl. Phys. B47, 180 (1996)Google Scholar
- R P Stanley,Enumerative combinatorics Vol. 2, volume 62 ofCambridge Studies in Advanced Mathematics (Cambridge University Press, Cambridge, 1999)Google Scholar
- A J Guttmann and I Jensen (in preparation)Google Scholar
- R J Baxter, inFundamental Problems in Statistical Mechanics edited by E G D Cohen (North Holland, Amsterdam 1981) vol. 5, pp. 109–41Google Scholar