AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems are considered in this paper
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
This paper introduces combinatorial representations, which generalise the notion of linear represent...
This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combin...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
The matroid matching problem (also known as matroid parity problem) has been intensively studied by ...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
A theorem of Birkhoff which states that there is a bijection between the class of all geometric latt...
AbstractIn this paper we introduce polynomials associated with uniform oriented matroids whose coeff...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
We initiate the study of group actions on (possibly infinite) semimatroids and geometric semilattic...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractGeometric representations of data are of main interest in data analysis. Generalizing the id...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
This paper introduces combinatorial representations, which generalise the notion of linear represent...
This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combin...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
The matroid matching problem (also known as matroid parity problem) has been intensively studied by ...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
A theorem of Birkhoff which states that there is a bijection between the class of all geometric latt...
AbstractIn this paper we introduce polynomials associated with uniform oriented matroids whose coeff...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
We initiate the study of group actions on (possibly infinite) semimatroids and geometric semilattic...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractGeometric representations of data are of main interest in data analysis. Generalizing the id...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
This paper introduces combinatorial representations, which generalise the notion of linear represent...
This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combin...
DOI
Add to ORKG