Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite (Q2368656): Difference between revisions

Self-avoiding polygons were introduced by \textit{H. N. V. Temperley} [``Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules'', Phys. Rev. 103, 1--16 (1956; Zbl 0075.20502)] in a work on lattice models of the phase transitions of magnets and polymers. \textit{A. J. Guttmann} [``Indicators of solvability for lattice models'', Discrete Math. 217, 167-189 (2000; Zbl 1005.82008)] and \textit{A. J. Guttmann} and \textit{I. G. Enting} [``Solvability of some statistical mechanical systems'', Phys. Rev. Lett. 76, 344--347 (1996; Zbl 0977.82014)] suggested a numerical procedure for testing the ``solvability'' of lattice models based on the study of the singularities of their anisotropic generating functions. In this paper the author proves two conjectures of Guttmann and Guttman and Enting: 1) the anisotropic generating function of self-avoiding polygons is not a D-finite function; 2) the form of the coefficients of the anisotropic generating functions. The first result is also generalized to self-avoiding polygons on hypercubic lattices.