Pattern Recognition on Oriented Matroids: Three-Tope Committees

Simple item page
dc.creatorMatveev, Andrey O.
dc.date2008-11-30
dc.date2008-12-08
dc.date.accessioned2026-07-07T12:09:44Z
dc.date.available2026-07-07T12:09:44Z
dc.descriptionA three-tope committee K* for a simple oriented matroid M is a 3-subset of its maximal covectors such that every positive halfspace of M contains at least two topes from K*. We consider three-tope committees as the vertex sets of triangles in graphs associated with the topes and enumerate them making use of the properties of the poset of convex subsets of the ground set of M.
dc.description7 pages; v.2 - minor improvements
dc.identifierhttps://arxiv.org/abs/0812.0156
dc.identifierhttp://arxiv.org/abs/0812.0156
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209727
dc.subjectCombinatorics
dc.subject52C40
dc.titlePattern Recognition on Oriented Matroids: Three-Tope Committees
dc.typetext

Files

Collections

arXiv