Nathalie Caspard ; Bernard Monjardet - Some lattices of closure systems on a finite set

dmtcs:309 - Discrete Mathematics & Theoretical Computer Science, January 1, 2004, Vol. 6 no. 2 -
Some lattices of closure systems on a finite set

Authors: Nathalie Caspard 1; Bernard Monjardet 2

  • 1 Laboratoire d'Algorithmique Complexité et Logique
  • 2 CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique

In this paper we study two lattices of significant particular closure systems on a finite set, namely the union stable closure systems and the convex geometries. Using the notion of (admissible) quasi-closed set and of (deletable) closed set, we determine the covering relation \prec of these lattices and the changes induced, for instance, on the irreducible elements when one goes from C to C' where C and C' are two such closure systems satisfying C \prec C'. We also do a systematic study of these lattices of closure systems, characterizing for instance their join-irreducible and their meet-irreducible elements.

Volume: Vol. 6 no. 2
Published on: January 1, 2004
Imported on: March 26, 2015
Keywords: quasi-closed set,Anti-exchange closure operator,closure system,convex geometry,(locally distributive) lattice,quasi-closed set.,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0012-365x(96)00196-3
  • 10.1016/s0012-365x(96)00196-3
On a dependence relation in finite lattices

1 Document citing this article

Consultation statistics

This page has been seen 227 times.
This article's PDF has been downloaded 267 times.