The number of three-choice polygons

A polynomial time enumeration method for the three-choice polygon model in two dimensions is given together with numerical analysis of the enumerated series and an argument supporting the asymptotic behaviour of the number of imperfect staircase polygons.

Saved in:
Bibliographic Details
Published in:Mathematical and computer modelling 1997-10, Vol.26 (8), p.51-58
Main Authors: Conway, A., Guttmann, A.J., Delest, M.
Format: Article
Language:English
Subjects:
Polygons
Series expansions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A polynomial time enumeration method for the three-choice polygon model in two dimensions is given together with numerical analysis of the enumerated series and an argument supporting the asymptotic behaviour of the number of imperfect staircase polygons.
ISSN:0895-7177
1872-9479
DOI:10.1016/S0895-7177(97)00199-4