On Dedekind's Problem: The Number of Isotone Boolean Functions. II

DOI10.2307/1998052zbMath0321.05010OpenAlexW4230867298WikidataQ59446776 ScholiaQ59446776MaRDI QIDQ4083667

George Markowsky, Daniel J. Kleitman

Publication date: 1975

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1998052

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structure and representation theory of distributive lattices (06D05) Structure theory of Boolean algebras (06E05)

Related Items

The number of monotone and self-dual Boolean functions., Forcing posets with large dimension to contain large standard examples, Free Completely Distributive Lattices, Polynomial-time algorithms for regular set-covering and threshold synthesis, Cooperation through social influence, Ordered dynamics in biased and cooperative Boolean networks, Dimension of restricted classes of interval orders, Finite algebras with large free spectra, Counting combinatorial choice rules, Dimension of CPT posets, Boolean lattices: Ramsey properties and embeddings, Maximal independent sets in bipartite graphs obtained from Boolean lattices, Maximal independent sets in the covering graph of the cube, Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures, Unnamed Item, On the number of maximal antichains in Boolean lattices for \(n\) up to 7, The level polynomials of the free distributive lattices, Partially unate Boolean functions: properties of their sum-of-products representations, On the foundations and extremal structure of the holographic entropy cone, The Number of Star Operations on Numerical Semigroups and on Related Integral Domains, Unnamed Item, Unnamed Item, A No-Go Theorem for One-Layer Feedforward Networks, Descriptional Complexity of the Forever Operator, Counting and enumerating aggregate classifiers, Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Star operations on numerical semigroups: antichains and explicit results, The complexity of monotone boolean functions, A simple upper bound on the number of antichains in \([t^n\)], Comparing Dushnik-Miller dimension, Boolean dimension and local dimension, From mathematical morphology to machine learning of image operators, Enumeration of intersecting families, The maximum number of edges in a graph of bounded dimension, with applications to ring theory, The order dimension of the complete graph, The dimension of two levels of the Boolean lattice, Unnamed Item, Ample simplicial complexes