We present two systems of closure axioms for a matroid with the assistance of Galois connections. These axioms give a mathematical foundation for the connections between matroids, Galois connections and concept lattices. We deal with some relationship between matroids and geometric lattices by the above axioms. We also discuss some applications between matroids and concept lattices with the above two closure axioms for a matroid
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...
AbstractThis paper introduces the notion of connectedness with respect to a closure operator on a co...
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
Using the closure operator axioms for a matroid presented here, for all the matroids defined on the ...
AbstractGeometric representations of data are of main interest in data analysis. Generalizing the id...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractOur main result describes how to extend a matroid so that its ground set is a modular hyperp...
This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combin...
For any minor-closed class of matroids over a fixed finite field, we state an exact structural chara...
For any minor-closed class of matroids over a fixed finite field, we state an exact structural chara...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
AbstractThis paper studies structural aspects of lattice path matroids. Among the basic topics treat...
OSCAR is an innovative new computer algebra system which combines and extends the power of its four ...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...
AbstractThis paper introduces the notion of connectedness with respect to a closure operator on a co...
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
Using the closure operator axioms for a matroid presented here, for all the matroids defined on the ...
AbstractGeometric representations of data are of main interest in data analysis. Generalizing the id...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractOur main result describes how to extend a matroid so that its ground set is a modular hyperp...
This chapter discusses the bouquets of geometric lattices. Matroid theory is in the center of Combin...
For any minor-closed class of matroids over a fixed finite field, we state an exact structural chara...
For any minor-closed class of matroids over a fixed finite field, we state an exact structural chara...
This paper deals with Galois connections between two partially ordered sets (posets) A, B. The first...
AbstractThis paper studies structural aspects of lattice path matroids. Among the basic topics treat...
OSCAR is an innovative new computer algebra system which combines and extends the power of its four ...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...
AbstractThis paper introduces the notion of connectedness with respect to a closure operator on a co...
AbstractFor a finite nonempty set E we associate in a canonical way to every antichain B⊆P(E) a matr...