{
  "id": "1302.1883",
  "version": "v2",
  "published": "2013-02-07T21:20:04.000Z",
  "updated": "2013-08-27T13:20:20.000Z",
  "title": "Mesh patterns with superfluous mesh",
  "authors": [
    "Bridget Eileen Tenner"
  ],
  "comment": "changed terminology; to appear in Advances in Applied Mathematics",
  "categories": [
    "math.CO"
  ],
  "abstract": "Mesh patterns are a generalization of classical permutation patterns that encompass classical, bivincular, Bruhat-restricted patterns, and some barred patterns. In this paper, we describe all mesh patterns whose avoidance is coincident with classical avoidance, in a sense declaring that the additional data of a mesh was unnecessary for these patterns. We also describe the permutations having the fewest superfluous meshes, and the permutations having the most, enumerating the superfluous meshes in each case.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-08-27T13:20:20.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "05A15"
    ],
    "keywords": [
      "mesh patterns",
      "additional data",
      "fewest superfluous meshes",
      "classical permutation patterns",
      "bruhat-restricted patterns"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1302.1883T"
    }
  }
}