Displaying similar documents to “Some lattices of closure systems on a finite set.”

Going down in (semi)lattices of finite Moore families and convex geometries

Bordalo Gabriela, Caspard Nathalie, Monjardet Bernard (2009)

Czechoslovak Mathematical Journal

Similarity:

In this paper we first study what changes occur in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then we study the set of all convex geometries which have the same poset of join-irreducible elements. We show that this set—ordered by set inclusion—is a ranked join-semilattice...

Convex isomorphism of Q -lattices

Petr Emanovský (1993)

Mathematica Bohemica

Similarity:

V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic. He also gave a necessary and sufficient condition under which the lattice are convex isomorphic, in particular for modular, distributive and complemented lattices. The aim this paper is to generalize this concept to the q -lattices defined in [2] and to characterize the convex isomorphic q -lattices.