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

DOI10.1016/j.jcta.2005.04.010zbMath1090.82014arXivmath/0406450OpenAlexW2159375648MaRDI QIDQ2368656

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

solvabilityenumerationself-avoiding polygonsdifferentiably finite power series

Mathematics Subject Classification ID

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

Related Items

Two non-holonomic lattice walks in the quarter plane, Haruspicy and anisotropic generating functions, On the tiling system recognizability of various classes of convex polyominoes, Exact solution of two classes of prudent polygons, Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite, Exactly Solved Models, The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite, Limit Distributions and Scaling Functions

Cites Work

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