About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On dedekind’s problem: The number of isotone boolean functions. II
Abstract
It is shown that ψ(n), the size of the free distributive lattice on n generators (which is the number of isotone Boolean functions on subsets of an n element set), satisfies (FORMAL PRESENTED)This result is an improvement by a factor √n in the 0 term of a previous result of Kleitman. In the course of deriving the main result, we analyze thoroughly the techniques used here and earlier by Kleitman, and show that the result in this paper is “best possible” (up to constant) using these techniques. © 1975 American Mathematical Society.