Counting of Moore Families for n=7

DOI10.1007/978-3-642-11928-6_6zbMath1274.05013OpenAlexW1550279910MaRDI QIDQ3552281

Olivier Raynaud, Pierre Colomb, Alexis Irlande

Publication date: 14 April 2010

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11928-6_6

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) 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 the lattice of conceptual measurements ⋮ Isolated sublattices and their application to counting closure operators ⋮ Succinctness and tractability of closure operator representations ⋮ 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 ⋮ Semistar Operations on Dedekind Domains

This page was built for publication: Counting of Moore Families for n=7