Iwan Jensen
Published 1999-10-20Version 1
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n=24. The algorithm is easily modified to enumerate various systems of closed meanders, semi-meanders or open meanders.
Comments: 6 pages, 2 figures, using macros elsart and graphicx. Talk presented at StatPhys-Taipei 1999
A transfer matrix approach to the enumeration of plane meanders
Critical exponents of plane meanders
Enumeration of self-avoiding walks on the square lattice
