Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Some lattices of clo ...
Article

Some lattices of closure systems on a finite set

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
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2004
Last modified on
March 31, 2025
Volume 6
vol. 6:2
DOI
10.46298/dmtcs.309
License
https://about.hal.science/hal-authorisation-v1
Indicators
1092
Views
1535
Downloads

Some lattices of closure systems on a finite set

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
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • quasi-closed set
  • Anti-exchange closure operator
  • closure system
  • convex geometry
  • (locally distributive) lattice
  • quasi-closed set.
Cited by

Source: OpenCitations

  • Learning Spaces, and How to Build Them

    Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)

    Authors : Jean-Paul Doignon ORCID

    Journal reference : Volume , 2014, pp. 1-14

    DOI : 10.1007/978-3-319-07248-7_1
  • Going down in (semi)lattices of finite moore families and convex geometries

    Czech digital mathematics library

    Authors : Bordalo Gabriela, Caspard Nathalie, Monjardet Bernard

    Journal reference : Volume 59, 2009, pp. 249-271

    DOI : 10.1007/s10587-009-0018-2
  • Description lattices of generalised convex hulls

    International Journal of Approximate Reasoning

    Authors : Christophe Demko ORCID, Karell Bertet ORCID, Jean-François Viaud, Cyril Faucher ORCID, Damien Mondou ORCID

    Journal reference : Volume 174, 2024, pp. 109269

    DOI : 10.1016/j.ijar.2024.109269
  • Note on the description of join-distributive lattices by permutations

    arXiv (Cornell University)

    Authors : Kira Adaricheva ORCID, Gábor Czédli ORCID

    Journal reference : Volume 72, 2014, pp. 155-162

    DOI : 10.1007/s00012-014-0295-y
  • Finite convex geometries of circles

    Discrete Mathematics

    Authors : Gábor Czédli ORCID

    Journal reference : Volume 330, 2014, pp. 61-75

    DOI : 10.1016/j.disc.2014.04.017
Preview
Loading PDF preview...