Classification lattices are geometric for complete atomistic lattices
We characterize complete atomistic lattices whose classification lattices are geometric. This implies an proper solution to a problem raised by S. Radeleczki in 2002.
We characterize complete atomistic lattices whose classification lattices are geometric. This implies an proper solution to a problem raised by S. Radeleczki in 2002.
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
Page 1