{
  "id": "2009.00122",
  "version": "v1",
  "published": "2020-08-31T22:01:59.000Z",
  "updated": "2020-08-31T22:01:59.000Z",
  "title": "Pattern Matching in Set Partitions is NP-Complete",
  "authors": [
    "Thomas Grubb"
  ],
  "comment": "4 pages, comments welcome",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-08-31T22:01:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A18",
      "03D15"
    ],
    "keywords": [
      "set partitions",
      "pattern matching",
      "np-complete"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}