Some lattices of closure systems on a finite set

Discrete Mathematics and Theoretical Computer Science

Volumn 6, Issue 2, 2004, Pages 163-190

  Caspard, Nathalie ^a   Monjardet, Bernard ^b  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

(Locally distributive) lattice; Anti exchange closure operator; Closure system; Convex geometry; Quasi closed set

Indexed keywords

EID: 15044347296     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (40)

1. M. E. Adams, P. Dwinger and J. Schmid, Maximal sublattices of finite distributive lattices, Algebra Universalis 36, 488-504, 1996.
2. J. C. Arditti and R. Cori, Chaînes maximales de préordres, Aequationes Math. 15(1), 49-54, 1977.
3. W. W. Armstrong, Dependency structures of data base relationships, Information Processing 74, 580-583, North Holland, Amsterdam, 1974.
4. M. Barbut and B. Monjardet, Ordre et Classification, Algèbre et Combinatoire, tomes I and II, Hachette, Paris, 1970.
5. G. Birkhoff, Lattice Theory, American Mathematical Society, Providence, 1940 (1967, 3rd ed.).
6. G. H. Bordalo and B. Monjardet, Reducible classes of finite lattices, Order 13 (4), 379-390, 1996.
7. G. H. Bordalo and B. Monjardet, The lattice of strict completions of a finite poset, Algebra Universalis 47, 183-200, 2002.
8. G. Burosch, J. Demetrovics and G. Katona, The poset of closures as model of changing databases, Order 4, 30-59, 1987.
9. N. Caspard and B. Monjardet, The lattices of closure systems, closure operators and implicational systems on a finite set: a survey, Discrete Applied Mathematics, 127 (2), 241-269, 2003.
10. C. C. Chen, K. M. Koh and S. K. Tan, Frattini sublattices of distributive lattices, Algebra Universalis 3 (3), 294-303, 1973.
11. C. Chameni-Nembua and B. Monjardet, Les treillis pseudo- complémentés finis, Europ. J. Combinatorics vol. 13, 89-107, 1992.
12. B. A. Davey and H. A. Priestley, Introduction to lattices and order, Cambridge University Press, Cambridge, 1990.
13. A. Day, Characterization of finite lattices that are bounded-homomorphic images or sublattices of free lattices, Canad. J. Math. 31, 69-78, 1979.
14. J. Demetrovics, L. O. Libkin and I. B. Muchnik, Functional dependencies in relational databases: a lattice point of view, Discrete Applied Mathematics 40, 155-185, 1992.
15. P. H. Edelman and R. E. Jamison, The theory of convex geometries, Geometriae Dedicata 19, 247-270, 1985.
16. P. H. Edelman, Abstract convexity and meet-distributive lattices, Contemporary Mathematics 57, 127-150, 1986.
17. P. H. Edelman and M. E. Saks, Combinatorial representations and convex dimension of convex geometries, Order 5 (1), 23-32, 1988.
18. M. Erné and J. Rheinold, Intervals in Lattices of Quasiorders, Order 12, 375-403, 1995.
19. R. Freese, J. Jezek and J. B. Nation, Free lattices, Mathematical Surveys and Monographs, vol. 42, American Mathematical Society, 1991.
20. B. Ganter, Two basic algorithms in concept analysis, report 831 TH Darmstadt, FB Mathematik 1984;
21. published as Algorithmen zur formalen Begriffsanalyse, in Beitraege zur Begriffsanalyse, (B. Ganter, R. Wille and K.E. Wolff, eds), Wissenchaftverlag, Mannheim (1987) 241-254.
22. B. Ganter and R. Wille, Formal concept analysis, Mathematical foundations, Springer Verlag, Berlin (1999).
23. L. Guigues and V. Duquenne, Families minimales d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences humaines 95, 5-18, 1986.
24. M. R. Johnson and R. A. Dean, Construction of finite lower locally distributive lattices, preprint, 2002.
25. B. Korte, L. Lovasz and R. Schrader, Greedoids, Springer Verlag, Berlin, 1991.
26. G. A. Koshevoy, Choice functions and abstract convex geometries, Mathematical Social Sciences 38 (1), 35-44, 1999.
27. R. E. Larson and S. J. Andima, The lattice of topologies: a survey, Rocky Mountain Journal of Mathematics, 5 (2), 177-198, 1975.
28. B. Leclerc and B. Monjardet, Latticial Theory of Consensus, in Social Science, Welfare and Ethics, V. Barnett, H. Moulin, M. Salles and N. Schofiels, eds, Cambridge University Press, 145-160, 1995.
29. B. Monjardet, Treillis d'ordres, in Ordres, work for the seminary of Aix-en-Provence on the orders, Gauthier-Villars, Paris, 29-45, 1971.
30. B. Monjardet, The consequences of Dilworth's work on lattices with unique irreducible decompositions. In: K.P. Bogart, R. Freese and J. Kung, (Eds), The Dilworth theorems Selected papers of Robert P. Dilworth. Birkhäuser, Boston, 192-201, 1990.
31. B. Monjardet, Arrowian characterizations of latticial federation consensus functions, Mathematical Social Sciences 20 (1), 51-71, 1990.
32. B. Monjardet and N. Caspard, On a dependance relation in finite lattices, Discrete Mathematics 165/166, 497-505, 1997.
33. B. Monjardet and V. Raderanirina, The duality between the anti-exchange closure operators and the path independent choice operators on a finite set, Mathematical Social Sciences 41 (2), 131-150, 2001.
34. B. Monjardet and V. Raderanirina, Lattices of choice functions and consensus problems, 2003. To appear.
35. O. re, Some studies on closure relations, Duke Mathematical Journal 10, 761-785, 1983.
36. I. Rival, Maximal sublattices of finite distributive lattices, Proc. Amer. Math. Soc. 37, 417-420, 1973.
37. I. Rival, Maximal sublattices of finite distributive lattices II, Proc. Amer. Math. Soc. 44, 263-268, 1974.
38. J. Schmid, Quasiorders and sublattices of distributive lattices, Order 19, 11-34, 2002.
39. M. Stern, Semimodular lattices, Encyclopedia of Mathematics, Cambridge University Press, Cambridge, 1999.
40. M. Wild, A theory of finite closure spaces based on implications, Advances in Mathematics 108 (1) 118-139, 1994.