### Abstract

We classify self‐avoiding polygons on the square lattice according to a concavity measure, m, where 2m is the difference between the number of steps in the polygon and the perimeter of the minimal rectangle bounding the polygon. We generate series expansions for the perimeter generating functions S_{m}(x) for polygons of concavity m. We analyze the series S_{m}(x) for m = 0 to 3. If N_{m,n} denotes the number of polygons of perimeter 2n and concavity m, with m = o(n^{1/2}), we prove that N_{m,n} ˜ 2^{2n−m−7}n^{m+1}/m!, and that the radius of convergence of the series counting all polygons with m = o(n) is equal to 1/4. Our numerical data leads us to conjecture that in fact (Formula Presented.) for m = o(n^{1/2}), a result confirmed for m = 0 and 1.

Original language | English |
---|---|

Pages (from-to) | 445-461 |

Number of pages | 17 |

Journal | Random Structures & Algorithms |

Volume | 3 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1992 |

Externally published | Yes |

## Cite this

*Random Structures & Algorithms*,

*3*(4), 445-461. https://doi.org/10.1002/rsa.3240030407