Pattern Recognition on Oriented Matroids: The Existence of a Tope Committee
arXiv:math/0607570
Abstract
Oriented matroids can serve as a tool of modeling of collective decision-making processes in contradictory problems of pattern recognition. We present a generalization of the committee techniques of pattern recognition to oriented matroids. A tope committee for an oriented matroid is a subset of its maximal covectors such that every positive halfspace contains more than half of the maximal covectors from this subset. For a large subfamily of oriented matroids their committee structure is quite rich; for example, any maximal chains in their tope posets provide one with information sufficient to construct a committee.
40 pages, 12 figures; v.2 - corrections in Section 5.2, references added; v.3,4,5 - minor improvements and reorganization
References in corpus (2)
Cited by in corpus (6)
- Pattern Recognition on Oriented Matroids: Layers of Tope Committees
- Neighboring Fractions in Farey Subsequences
- Pattern Recognition on Oriented Matroids: Three-Tope Committees
- Pattern Recognition on Oriented Matroids: K*-Vectors and Reorientations
- Pattern Recognition on Oriented Matroids: Halfspaces, Convex Sets and Tope Committees
- Pattern Recognition on Oriented Matroids: Topes and Critical Committees