MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Geometry © 2000 Springer-Verlag New York Inc. On the Cocircuit Graph of an Oriented Matroid ∗

Download:
pdf
by R. Cordovil, K. Fukuda, A. Guedes De Oliveira
http://www.math.ist.utl.pt/~rcordov/CGOM.pdf
Add To MetaCart

Abstract:

Abstract. In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not determined by GM. However, we show that if the vertex set (resp. edge set) of GM is properly labeled by the hyperplanes (resp. colines) of M,GM determines W. Also we prove that, when M is uniform, the cocircuit graph together with all antipodal pairs of vertices being marked determines W. These results can be considered as variations of Blind–Mani’s theorem that says the 1-skeleton of a simple convex polytope determines its face lattice.

Citations

42 Las Vergnas: Orientability of Matroids – Bland, M - 1978
30 A simple way to tell a simple polytope from its graph – Kalai - 1988
20 Arrangements and spreads – Grünbaum - 1972
19 Semispaces of configurations, cell complexes of arrangements – Goodman, Pollack - 1984
16 Hyperplane arrangements with a lattice of regions, Discrete Comput – Björner, Edelman, et al. - 1990
7 Combinatorial face enumeration in arrangements and oriented matroids – Fukuda, Saito, et al. - 1991
6 Extensions ponctuelles d'une geometrie combinatoire oriente, in Probl emes combinatoires et th eorie des graphes – VERGNAS - 1976
5 Fukuda: Oriented matroids and combinatorial manifolds – Cordovil, Fukuda - 1993
3 U.; Veoso da Costa, A.: On the cube problem of Las Vergnas. Geometriae Dedicata 63 – Bokowski, Oliveira, et al. - 1996
3 Reconstruction of the orientation class of an oriented matroid – Roudneff - 1988
1 P.: Puzzles and polytope isomorphisms, Aequationes Math – Blind, Mani-Levitska - 1987
1 and in revised form March 2 – August - 1998