Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids

We consider the cocircuit graph GM of an oriented matroid M, which is the 1-skeleton of the cell complex formed by the span of the cocircuits of M. As a result of Cordovil, Fukuda, and Guedes de Oliveira, the isomorphism class of M is not determined by GM, but it is determined if M is uniform and the vertices in GM are paired if they are associated to negative cocircuits; furthermore the reorientation class of an oriented matroid M with rank(M) 2 is determined by GM if every vertex in GM is labeled by the zero support of the associated cocircuit. In this paper we show that the isomorphism class of a uniform oriented matroid is determined by the cocircuit graph, and we present polynomial algorithms which provide constructive proofs to all these results. Furthermore it is shown that the correctness of the input of the algorithms can be verified in polynomial time.

Published in:
European Journal of Combinatorics, 22, 5, 587-600
PRO 2001.19
Other identifiers:

 Record created 2006-02-13, last modified 2018-10-07

Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
(Not yet reviewed)