A computation of the eighth Dedekind number

From MaRDI portal
Publication:1182033


DOI10.1007/BF00385808zbMath0736.06017WikidataQ59446778 ScholiaQ59446778MaRDI QIDQ1182033

Doug Wiedemann

Publication date: 27 June 1992

Published in: Order (Search for Journal in Brave)


06D99: Distributive lattices


Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The Number of Star Operations on Numerical Semigroups and on Related Integral Domains, Adinkras for mathematicians, Unnamed Item, On the number of maximal antichains in Boolean lattices for \(n\) up to 7, Speedup the optimization of maximal closure of a node-weighted directed acyclic graph, On the enumeration of some inequivalent monotone Boolean functions, A multi-tree committee to assist port-of-entry inspection decisions, Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice, Enumerating orientations of the free spikes, Counting combinatorial choice rules, The order dimension of the complete graph, A map from the lower-half of the \(n\)-cube onto the \((n-1)\)-cube which preserves intersecting antichains, Optimal resource allocation enables mathematical exploration of microbial metabolic configurations, There are more strategy-proof procedures than you think, Computers and universal algebra: Some directions, General theory for interactions in sufficient cause models with dichotomous exposures, Counting families of mutually intersecting sets, The central decomposition of \(FD_{01}(n)\), Free monoids and generalized metric spaces, Counting inequivalent monotone Boolean functions., Identification of fuzzy measures from sample data with genetic algorithms, Some combinatorics of imperfect information, On the inverse power index problem, Injective envelopes of transition systems and Ferrers languages, The Polytope of Fuzzy Measures and Its Adjacency Graph