Algorithms for counting Moore families: application to the case n=7

MaRDI QIDQ4907347zbMATH OpenFDO

Authors Pierre Colomb, Olivier Raynaud, Alexis Irlande

Publication date 1 February 2013

zbMATH Keywords

symmetryenumerationMoore family

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)

Recommendations

• Counting of Moore families for \(n=7\)
• The number of Moore families on \(n=6\)
• 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.

Cited in

(5)

• Counting of Moore families for \(n=7\)
• Recursive decomposition tree of a Moore co-family and closure algorithm.
• Recursive decomposition and bounds of the lattice of Moore co-families.
• Generation of union-closed sets and Moore families
• The number of Moore families on \(n=6\)

This page was built for publication: Algorithms for counting Moore families: application to the case \(n=7\)

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