Relational Galois connections between transitive digraphs: Characterization and construction

 

Abstract

This paper focuses on a twofold relational generalization of the notion of Galois connection. It is twofold because it is defined between sets endowed with arbitrary transitive relations and, moreover, both components of the connection are relations, not necessarily functions. A characterization theorem of the notion of relational Galois connection is provided and, then, it is proved that a suitable notion of closure can be obtained within this framework. Finally, we state a necessary and sufficient condition that allows to build a relational Galois connection starting from a single transitive digraph and a single binary relation.

Funding

Projects funding this work

Citation

Please, cite this work as:

[Cab+20] I. P. Cabrera, P. Cordero, E. Muñoz-Velasco, et al. “Relational Galois connections between transitive digraphs: Characterization and construction”. In: Information Sciences 519 (2020). Cited by: 8; All Open Access, Green Open Access, p. 439 – 450. DOI: 10.1016/j.ins.2020.01.034. URL: [https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079160299&doi=10.1016

BibTeX

@ARTICLE{Cabrera2020439,
     author = {Cabrera, Inma P. and Cordero, Pablo and Muñoz-Velasco, Emilio and Ojeda-Aciego, Manuel and De Baets, Bernard},
     title = {Relational Galois connections between transitive digraphs: Characterization and construction},
     year = {2020},
     journal = {Information Sciences},
     volume = {519},
     pages = {439 – 450},
     doi = {10.1016/j.ins.2020.01.034},
     url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079160299&doi=10.1016%2fj.ins.2020.01.034&partnerID=40&md5=2d80ac2cb125c6e9326073eb92a4f5a4},
     type = {Article},
     publication_stage = {Final},
     source = {Scopus},
     note = {Cited by: 8; All Open Access, Green Open Access}
}