{
  "id": "math/0409244",
  "version": "v1",
  "published": "2004-09-15T08:13:51.000Z",
  "updated": "2004-09-15T08:13:51.000Z",
  "title": "Packing sets of patterns",
  "authors": [
    "Alexander Burstein",
    "Peter Hästö"
  ],
  "comment": "14 pages, LaTeX",
  "categories": [
    "math.CO"
  ],
  "abstract": "Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permutations and study permutation and pattern co-occurrence.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-09-15T08:13:51.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A16",
      "05A20"
    ],
    "keywords": [
      "packing sets",
      "packing density",
      "permutation occurrence statistic",
      "first systematic study",
      "special sets"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......9244B"
    }
  }
}