{
  "id": "2309.06518",
  "version": "v1",
  "published": "2023-09-12T18:50:15.000Z",
  "updated": "2023-09-12T18:50:15.000Z",
  "title": "Pattern Avoidance in Weak Ascent Sequences",
  "authors": [
    "Beáta Bényi",
    "Toufik Mansour",
    "José L. Ramírez"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we study the pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\\'imsson for ascent sequences. More precisely, we provide systematically the generating functions for the number of weak ascent sequences avoiding the patterns $012, 021, 001, 102$, and $011$. We also establish bijective connections between pattern-avoiding weak ascent sequences and other combinatorial objects, such as compositions, upper triangular 01-matrices, and ordered trees. We leave as an open question the enumeration of the remaining cases of length 3.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-09-12T18:50:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15",
      "05A19"
    ],
    "keywords": [
      "pattern avoidance",
      "pattern-avoiding weak ascent sequences",
      "weak ascent sequences avoiding",
      "open question",
      "combinatorial objects"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}