{
  "id": "2010.02389",
  "version": "v1",
  "published": "2020-10-05T23:12:39.000Z",
  "updated": "2020-10-05T23:12:39.000Z",
  "title": "Automated Counting of Restricted Motzkin Paths",
  "authors": [
    "AJ Bu"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Motzkin paths are simple yet important combinatorial objects. In this paper, we consider families of Motzkin paths with restrictions on peak heights, valley heights, upward-run lengths, downward-run lengths, and flat-run lengths. This paper presents two fully automated methods for enumerating the paths of such families. The first method uses numeric dynamic programming. While this method often times works, it can be slow and may not work for larger problems. The second method uses symbolic dynamic programming to solve such problems. These methods are implemented in the maple packages accompanying this article.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-10-05T23:12:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "restricted motzkin paths",
      "automated counting",
      "important combinatorial objects",
      "flat-run lengths",
      "second method"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}