The anisotropic generating function of self-avoiding polygons is not D-finite
From MaRDI portal
Recommendations
Cites work
- A method for the enumeration of various classes of column-convex polygons
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- D-finite power series
- GFUN
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
- Haruspicy and anisotropic generating functions
- scientific article; zbMATH DE number 949396 (Why is no real title available?)
- 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
- Self-avoiding polygons on the square lattice
- Solvability of Some Statistical Mechanical Systems
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- The site-perimeter of bargraphs
Cited in
(9)- Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations
- Polycubes with small perimeter defect
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
- Exactly solved models
- Why are so many problems unsolved?
- Series analysis
- scientific article; zbMATH DE number 1498643 (Why is no real title available?)
- Synergistic development of differential approximants and the finite lattice method in lattice statistics
This page was built for publication: 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 Q3651682)