The number of Moore families on n=6

DOI10.1016/J.DISC.2004.11.010zbMATH Open1083.06003OpenAlexW2089684061MaRDI QIDQ1781981FDOQ1781981

Authors: M. 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

Recommendations

• Algorithms for counting Moore families: application to the case \(n=7\)
• Counting of Moore families for \(n=7\)
• Generation of union-closed sets and Moore families
• Recursive decomposition and bounds of the lattice of Moore co-families.
• Recursive decomposition tree of a Moore co-family and closure algorithm.

zbMATH Keywords

Moore familyClosure systemColored posetsUpper locally distributive lattices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Title not available (Why is that?)
• Lattices of closure operators
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On-line algorithms for orders
• On the lattice of conceptual measurements
• Enumeration of closed families of finite sets
• Recursive decomposition tree of a Moore co-family and closure algorithm.
• Generation of Union Closed Sets and Moore families
• Representation of lattices via set-colored posets
• Recursive decomposition and bounds of the lattice of Moore co-families.
• Algorithms for \(k\)-meet-semidistributive lattices
• Succinctness and tractability of closure operator representations
• Counting of Moore families for \(n=7\)

This page was built for publication: The number of Moore families on \(n=6\)

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