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

DOI10.1016/J.JCTA.2005.04.010zbMATH Open1090.82014OpenAlexW2159375648MaRDI QIDQ2368656FDOQ2368656

Authors: Andrew Rechnitzer 

Publication date: 28 April 2006

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

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.

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

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

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)

Cites Work

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

Cited In (11)

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

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)