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

DOI10.1134/S1995080223010158MaRDI QIDQ6040344zbMATH OpenOpenAlexFDO

Authors 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

closed itemset miningDedekind numbersDedekind-McNeil completionformal concept analysismaximal antichains

Mathematics Subject Classification ID

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

Recommendations

• Erratum to: ``On the number of maximal antichains in Boolean lattices for \(n\) up to 7
• Maximal Chains and Antichains in Boolean Lattices
• On the size of maximal antichains and the number of pairwise disjoint maximal chains
• On the number of minimal completely separating systems and antichains in a Boolean lattice
• On the size of maximal chains and the number of pairwise disjoint maximal antichains
• The jump number and the lattice of maximal antichains
• A simple upper bound on the number of antichains in \([t]^n\)
• scientific article; zbMATH DE number 3952833
• Maximum-sized antichains in minimal posets
• An upper bound for the size of the largest antichain in the poset of partitions of an integer

Cites work

• A computation of the eighth Dedekind number
• A solution of Dedekind's problem on the number of isotone Boolean functions.
• Comparing performance of algorithms for generating concept lattices
• Conceptual exploration
• Counting maximal antichains and independent sets
• Finding all closed sets: A general approach
• Finite distributive concept algebras
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1560547 (Why is no real title available?)
• Introduction to lattice theory with computer science applications
• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On Shapley value interpretability in concept-based learning with formal concept analysis
• The jump number and the lattice of maximal antichains
• The level polynomials of the free distributive lattices
• Two basic algorithms in concept analysis

Cited in

(1)

• A computation of the ninth Dedekind number

This page was built for publication: On the number of maximal antichains in Boolean lattices for \(n\) up to 7

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040344)