{
  "id": "1501.07354",
  "version": "v1",
  "published": "2015-01-29T06:47:44.000Z",
  "updated": "2015-01-29T06:47:44.000Z",
  "title": "Parikh Matrices and Strong M-Equivalence",
  "authors": [
    "Wen Chean Teh"
  ],
  "comment": "14 pages. Under review",
  "categories": [
    "math.CO"
  ],
  "abstract": "Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M-equivalence is proposed as a canonical alternative to M-equivalence to get rid of this undesirable property. This new combinatorial property proves to be natural and interesting on its own. Some characterization results for $M$-equivalence as well as strong $M$-equivalence are obtained. Finally, the opposite notion of weak $M$-equivalence will be presented.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-01-29T06:47:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15",
      "68Q45",
      "05A05"
    ],
    "keywords": [
      "parikh matrices",
      "strong m-equivalence",
      "combinatorial property",
      "characterization results",
      "opposite notion"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150107354C"
    }
  }
}