Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite

DOI10.1016/J.JCTA.2005.04.010MaRDI QIDQ2368656zbMATHOpenAlexFDO

Authors Andrew Rechnitzer

Publication date 28 April 2006

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0406450

zbMATH Keywords

enumerationsolvabilityself-avoiding polygonsdifferentiably finite power series

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Exact enumeration problems, generating functions (05A15)

Abstract: We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function - proving a conjecture of Guttmann and Enting. This result is also generalised to self-avoiding polygons on hypercubic lattices. Using the haruspicy techniques developed in an earlier paper we are also prove the form of the coefficients of the anisotropic generating function, which was first conjectured by Guttmann and Enting.

Recommendations

• The anisotropic generating function of self-avoiding polygons is not D-finite
• Haruspicy and anisotropic generating functions
• Square lattice
• Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
• Scaling function and universal amplitude combinations for self-avoiding polygons

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 742629 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• A combinatorial formula involving the Fredholm integral equation
• A method for the enumeration of various classes of column-convex polygons
• Cell Growth Problems
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• D-finite power series
• Haruspicy and anisotropic generating functions
• Indicators of solvability for lattice models
• Inversion relations, reciprocity and polyominoes
• Lattice animals and heaps of dimers
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Solvability of Some Statistical Mechanical Systems
• Some problems in the counting of lattice animals, polyominoes, polygons and walks
• The site-perimeter of bargraphs

Cited in

(11)

• The anisotropic generating function of self-avoiding polygons is not D-finite
• Series analysis
• Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
• Two non-holonomic lattice walks in the quarter plane
• Exact solution of two classes of prudent polygons
• Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations
• Limit distributions and scaling functions
• Haruspicy and anisotropic generating functions
• On the tiling system recognizability of various classes of convex polyominoes
• Exactly solved models
• Solvability of Some Statistical Mechanical Systems

This page was built for publication: Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368656)