Counting and Computing Join-Endomorphisms in Lattices (Revisited)
share
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set ℰ(L) of all join-endomorphisms of a given finite lattice L. In particular, we show for 𝐌_n, the discrete order of n elements extended with top and bottom, | ℰ(𝐌_n) | =n!ℒ_n(-1)+(n+1)^2 where ℒ_n(x) is the Laguerre polynomial of degree n. We also study the following problem: Given a lattice L of size n and a set S⊆ℰ(L) of size m, find the greatest lower bound ⊓_ℰ(L) S. The join-endomorphism ⊓_ℰ(L) S has meaningful interpretations in epistemic logic, distributed systems, and Aumann structures. We show that this problem can be solved with worst-case time complexity in O(mn) for distributive lattices and O(mn + n^3) for arbitrary lattices. In the particular case of modular lattices, we present an adaptation of the latter algorithm that reduces its average time complexity. We provide theoretical and experimental results to support this enhancement. The complexity is expressed in terms of the basic binary lattice operations performed by the algorithm.
READ FULL TEXT
