{
  "id": "1703.09196",
  "version": "v1",
  "published": "2017-03-27T17:28:14.000Z",
  "updated": "2017-03-27T17:28:14.000Z",
  "title": "Pattern Recognition on Oriented Matroids: Decompositions of Topes, and Orthogonality Relations",
  "authors": [
    "Andrey O. Matveev"
  ],
  "comment": "4 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for decompositions Q(T',R') and Q(T\",R\") with respect to symmetric cycles R' and R\" in the tope graphs of two simple oriented matroids, whose ground sets have the cardinalities of opposite parity, we have |Q(T',R')|>3 and |Q(T\",R\")|>3, then these decompositions satisfy a certain orthogonality relation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-03-27T17:28:14.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "orthogonality relation",
      "pattern recognition",
      "simple oriented matroid",
      "symmetric cycle",
      "tope graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}