A method for the enumeration of various classes of column-convex polygons
Discrete Mathematics
Indicators of solvability for lattice models
Discrete Mathematics
The number of three-choice polygons
Mathematical and Computer Modelling: An International Journal
Haruspicy 2: the anisotropic generating function of self-avoiding polygons is not D-finite
Journal of Combinatorial Theory Series A
Haruspicy 3: the anisotropic generating function of directed bond-animals is not D-finite
Journal of Combinatorial Theory Series A
Some New Self-avoiding Walk and Polygon Models
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Hi-index | 0.00 |
Guttmann and Enting [Phys. Rev. Lett. 76 (1996) 344-347] proposed the examination of anisotropic generating functions as a test of the solvability of models of bond animals. In this article we describe a technique for examining some properties of anisotropic generating functions. For a wide range of solved and unsolved families of bond animals, we show that the coefficients of yn is rational, the degree of its numerator is at most that of its denominator, and the denominator is a product of cyclotomic polynomials. Further we are able to find a multiplicative upper bound for these denominators which, by comparison with numerical studies [Jensen, personal communication; Jensen and Guttmann, personal communication], appears to be very tight. These facts can be used to greatly reduce the amount of computation required in generating series expansions. They also have strong and negative implications for the solvability of these problems.