Abstract
AbstractWe study isotone self-maps of complete lattices and their fixed point sets, which are complete lattices contained as suborders, but not necessarily as subsemilattices. We develop a representation of such maps by means of relations and show how to navigate their fixed point lattices using a modification of the standard Next closure algorithm. Our approach is inspired by early work of Shmuely [8] and Crapo [1]. We improve and substantially extend our earlier publication [4].
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory,Discrete Mathematics and Combinatorics
Reference9 articles.
1. Crapo, H.: Ordered sets: retracts and connections. J. Pure Appl. Algebra 23(1), 13–28 (1982)
2. Duffus, D., Rival, I.: Retracts of partially ordered sets. J. Aust. Math. Soc. 27(4), 495–506 (1979)
3. Ganter, B.: Two basic algorithms in concept analysis. FB4–Preprint 831, TH Darmstadt. In: Kwuida, L., Sertkaya, B. (eds.) Formal concept analysis. Proceedings ICFCA 2010, Lecture Notes in Computer Science, vol. 5986. Springer, Berlin (1984)
4. Ganter, B.: Order-embedded complete lattices. In: CLA, pp 153–165 (2018)
5. Ganter, B., Obiedkov, S.: Conceptual exploration. Springer, Berlin (2016)