{
  "id": "math/0509521",
  "version": "v2",
  "published": "2005-09-22T15:44:57.000Z",
  "updated": "2005-09-30T00:30:05.000Z",
  "title": "Cylindrical lattice paths and the Loehr-Warrington 10^n conjecture",
  "authors": [
    "Jonas Sjostrand"
  ],
  "comment": "This is a strongly revised version with the same mathematical content but a more attractive presentation",
  "categories": [
    "math.CO"
  ],
  "abstract": "The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2. We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice paths.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2005-09-30T00:30:05.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "05C38"
    ],
    "keywords": [
      "cylindrical lattice paths",
      "conjecture",
      "loehr-warrington",
      "zero-sum words",
      "simple bijective proof"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......9521S"
    }
  }
}