Prudent walks and polygons
Prudent walks and polygons
We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O(n5), for a series of n-step polygons. For prudent polygons in two dimensions we find the growth constant to be smaller than that for the corresponding walks, and by considering three distinct subclasses …