The number of Moore families on \(n=6\)
From MaRDI portal
Publication:1781981
DOI10.1016/j.disc.2004.11.010zbMath1083.06003OpenAlexW2089684061MaRDI QIDQ1781981
Michel A. Habib, Lhouari Nourine
Publication date: 10 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.010
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (8)
Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ On-line algorithms for orders ⋮ On the lattice of conceptual measurements ⋮ Succinctness and tractability of closure operator representations ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ Representation of lattices via set-colored posets ⋮ Generation of Union Closed Sets and Moore families
Cites Work
This page was built for publication: The number of Moore families on \(n=6\)
