{
  "id": "0711.3387",
  "version": "v1",
  "published": "2007-11-21T15:05:18.000Z",
  "updated": "2007-11-21T15:05:18.000Z",
  "title": "Enumeration of some classes of words avoiding two generalized patterns of length three",
  "authors": [
    "Antonio Bernini",
    "Luca Ferrari",
    "Renzo Pinzani"
  ],
  "comment": "18 pages, 13 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "The method we have applied in \"A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162\" to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-11-21T15:05:18.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A15",
      "05A10"
    ],
    "keywords": [
      "generalized patterns",
      "words avoiding",
      "enumeration",
      "babson-steingrimsson patterns",
      "count pattern avoiding permutations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0711.3387B"
    }
  }
}