Doubling convex sets in lattices: Characterizations and recognition algorithms

Order

Volumn 19, Issue 2, 2002, Pages 181-207

  Bertet, Karell ^a   Caspard, Nathalie ^b  

^a UNIVERSITY OF LA ROCHELLE   (France)

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

Author keywords

Algorithm; Arrow relations; Doublings; Lattice; Poset; Recognition

Indexed keywords

EID: 0141688477     PISSN: 01678094     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016524118566     Document Type: Article

References (21)

1. Aigner, M. (1979) Combinatorial Theory, Springer, Berlin.
2. Barbut, M. and Monjardet, B. (1970) Ordre et classification, Algèbre et Combinatoire, Hachette, Paris
3. Bertet, K. (1998) Sur quelques aspects structurels et algorithmiques des treillis, Thèse de Doctorat, Université Paris 7, Paris.
4. Birkhoff, G. (1967) Lattice Theory, 3rd edn, Amer. Math. Soc., Providence.
5. Blair, C. (1984) Every finite distributive lattice is a set of stable matchings, J. Combin. Theory (A) 37, 353-356.
6. Caspard, N. (1998) Etude structurelle et algorithmique de classes de treillis obtenus par duplications, Thèse de Doctorat, Université Paris 1, Paris.
7. Day, A. (1970) A simple solution of the word problem for lattices, Canad. Math. Bull. 13, 253-254.
8. Day, A. (1977) Splitting lattices generate all lattices, Algebra Universalis 7, 163-170.
9. Day, A. (1979) Distributive lattices with finite projective covers, Pacific J. Math. 81, 45-59.
10. Day, A. (1979) Characterizations of finite lattices that are bounded-homomorphic images or sublattices of free lattices, Canad. J. Math. 31, 69-78.
11. Day, A., Nation, J. B. and Tschanz, S. (1989) Doubling convex sets in lattices and a generalized semidistributivity condition, Order 6, 175-180.
12. Day, A. (1992) Doubling constructions in lattice theory, Canad. J. Math. 44, 252-269.
13. Day, A. (1994) Congruence normality: The characterization of the doubling class of convex sets, Algebra Universalis 31, 397-406.
14. Freese, R., Jezek, J. and Nation, J. B. (1991) Free Lattices, Math. Surveys Monogr. 42, Amer. Math. Soc., Providence.
15. Freese, R. and Nation, J. B. (1985) Covers in free lattices, Trans. Amer. Math. Soc. 228, 1-42.
16. Geyer, W. (1993) Generalizing semidistributivity, Order 10, 77-92.
17. Geyer, W. (1994) The generalized doubling construction and formal concept analysis, Algebra Universalis 32, 341-367.
18. Grätzer, G. (1978) General Lattice Theory, Birkhäuser, Stuttgart.
19. Habib, M. and Nourine, L. (1993) A linear time algorithm to recognize distributive lattices, Rapport de recherche no93-013, L.I.R.M.M., CNRS-Université Montpellier II.
20. Habib, M. and Nourine, L. (1996) Tree structure for distributive lattices and its applications, Theoret. Comput. Sci. A, 391-405.
21. Wille, R. (1983) Subdirect decomposition of concept lattices, Algebra Universalis 17, 275-287.