On the number of maximal antichains in Boolean lattices for \(n\) up to 7

DOI10.1134/s1995080223010158OpenAlexW4377003528MaRDI QIDQ6040344

Dmitry I. Ignatov

Publication date: 25 May 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223010158

zbMATH Keywords

formal concept analysismaximal antichainsDedekind numbersclosed itemset miningDedekind-McNeil completion

Mathematics Subject Classification ID

Computer science (68-XX) Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• The jump number and the lattice of maximal antichains
• Finite distributive concept algebras
• The level polynomials of the free distributive lattices
• A computation of the eighth Dedekind number
• Finding all closed sets: A general approach
• On Shapley value interpretability in concept-based learning with formal concept analysis
• Counting maximal antichains and independent sets
• Conceptual Exploration
• Two Basic Algorithms in Concept Analysis
• A solution of Dedekind's problem on the number of isotone Boolean functions.
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Comparing performance of algorithms for generating concept lattices