Generation of Oriented Matroids - A Graph Theoretical Approach

We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discuss the single element extensions in terms of localizations which can be viewed as partitions of the vertex sets of the graphs. Whereas localizations of the cocircuit graph are well characterized, there is no graph theoretical characterization known for localizations of the tope graph. In this paper we prove a connectedness property for tope graph localizations and use this for the design of algorithms for the generation of single element extensions by use of tope graphs. Furthermore we discuss similar algorithms which use the cocircuit graph. The characterization of localizations of cocircuit gra...

• Type: Journal
• Year: 2002
• Where: DCG
• Authors: Lukas Finschi, Komei Fukuda
• Keywords: Cocircuit Graphs, DCG 2002, Oriented Matroids, Single Element Extensions