{
  "id": "cond-mat/9910313",
  "version": "v1",
  "published": "1999-10-20T23:53:42.000Z",
  "updated": "1999-10-20T23:53:42.000Z",
  "title": "Enumerations of plane meanders",
  "authors": [
    "Iwan Jensen"
  ],
  "comment": "6 pages, 2 figures, using macros elsart and graphicx. Talk presented at StatPhys-Taipei 1999",
  "categories": [
    "cond-mat.stat-mech"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-10-20T23:53:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "enumeration",
      "infinite line 2n times",
      "closed meanders",
      "transfer matrix methods",
      "open meanders"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999cond.mat.10313J"
    }
  }
}