Is there a simple/efficient way of enumerating the elements of a free distributive lattice?
(I'm doing some computations with them, and listing their elements in what's probably the least efficient way possible...)
Asked
Active
Viewed 378 times
1
-
I think https://math.stackexchange.com/questions/4984971 might answer your question. – Martin Brandenburg Oct 15 '24 at 16:38
1 Answers
1
It's equivalent to enumerating monotone Boolean functions, e.g. see Fidytek et al. Algorithms counting monotone Boolean functions
Bill Dubuque
- 282,220
-
Notice I don't what their number but the actual list of formulas. – Mariano Suárez-Álvarez Nov 06 '10 at 04:35