AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems, and, sometimes, useful explanations or interpretations of results that do not concern duality explicitly. We present a common characterization of the duality relations associated with matroids, clutters (Sperner families), oriented matroids, and weakly oriented matroids. The same conditions characterize the orthogonality relation on certain families of vector spaces. This leads to a notion of abstract duality
AbstractOur paper presents a new finite crisscross method for oriented matroids. Starting from a nei...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
AbstractWe present a notion of abstract duality that provides a common characterization of several c...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
summary:In this paper we investigate a class of problems permitting a good characterisation from the...
AbstractIn this paper we define oriented matroids and develop their fundamental properties, which le...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractWe state and prove two rather direct linear algebra results and show how they are the basis ...
In this thesis we comment on six papers, three from matroid theory and three from cooperative game t...
This book presents an elementary introduction to the theory of oriented matroids. The way oriented m...
AbstractIn hopes of better understanding graph-theoretic duality, a syntactical ‘duality principle’ ...
Matroids capture an abstraction of independence in mathematics, and in doing so, connect discrete ma...
Abstract. We introduce a notion of duality (due to Brylawski) that gener-alizes matroid duality to a...
AbstractOur paper presents a new finite crisscross method for oriented matroids. Starting from a nei...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
AbstractWe present a notion of abstract duality that provides a common characterization of several c...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...
summary:In this paper we investigate a class of problems permitting a good characterisation from the...
AbstractIn this paper we define oriented matroids and develop their fundamental properties, which le...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractWe state and prove two rather direct linear algebra results and show how they are the basis ...
In this thesis we comment on six papers, three from matroid theory and three from cooperative game t...
This book presents an elementary introduction to the theory of oriented matroids. The way oriented m...
AbstractIn hopes of better understanding graph-theoretic duality, a syntactical ‘duality principle’ ...
Matroids capture an abstraction of independence in mathematics, and in doing so, connect discrete ma...
Abstract. We introduce a notion of duality (due to Brylawski) that gener-alizes matroid duality to a...
AbstractOur paper presents a new finite crisscross method for oriented matroids. Starting from a nei...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
AbstractIn this paper, the basic properties of oriented matroids are examined. A topological represe...