Pattern Recognition on Oriented Matroids: Layers of Tope Committees
From MaRDI portal
Association schemes, strongly regular graphs (05E30) Farey sequences; the sequences (1^k, 2^k, dots) (11B57) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Oriented matroids in discrete geometry (52C40) Pattern recognition, speech recognition (68T10) Combinatorial optimization (90C27)
Abstract: A tope committee K* for a simple oriented matroid M is a subset of its maximal covectors such that every positive halfspace of M contains more than half of the covectors from K*. The structures of the family of all committees for M, and of the family of its committees that contain no pairs of opposites, are described. A Farey subsequence associated with the elements of the m-th layer of the Boolean lattice of rank 2m is explored.
This page was built for publication: Pattern Recognition on Oriented Matroids: Layers of Tope Committees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478426)
