scientific article; zbMATH DE number 1424473
A meander is defined as a set of \(k\) non-intersecting closed loops which have a total of \(2n\) intersections with a straight line. The problem is to enumerate the number of such topologically distributed diagrams. This problem is solved by several methods and is related to the polymer and protein folding problem, and also to the map-folding problem. Several methods are used, mostly based on recurrence relations and numerical and analytic data are given for values of \(k\) up to four and the paper ends with a conjectured universality principle similar to those encountered in statistical mechanics. Reviewer's note: The author does not mention the extensive work done on enumeration of non-self-intersecting random walks on a lattice, though it is a closely related problem. The reviewer's [Discrete Appl. Math. 19, 367-379 (1988; Zbl 0633.05036)] and [Phys. A 206, No. 3-4, 350-358 (1994)] give new analytic and numerical results and references to earlier work. For the entire collection see [Zbl 0932.00043].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945720)