Abstract:Let L be a finite lattice and E(L) be the set of join endomorphisms of L. We consider the problem of given L and f, g ∈ E(L), finding the greatest lower bound f E(L) g in the lattice E(L). (1) We show that if L is distributive, the problem can be solved in time O(n) where n = |L|. The previous upper bound was O(n 2 ). ( 2) We provide new algorithms for arbitrary lattices and give experimental evidence that they are significantly faster than the existing algorithm. (3) We characterize the standard notion of dis… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.