Abstract
Given a set U n = {0,1,...,n − 1}, a collection \(\mathcal{M}\) of subsets of U n that is closed under intersection and contains U n is known as a Moore family. The set of Moore families for a given n, denoted by M n , increases very quickly with n, thus |M 3| is 61 and |M 4| is 2480. In [1] the authors determined the number for n = 6 and stated a 24h- computation-time. Thus, the number for n = 7 can be considered as an extremely difficult technical challenge. In this paper, we introduce a counting strategy for determining the number of Moore families for n = 7 and we give the exact value : 14 087 648 235 707 352 472. Our calculation is particularly based on the enumeration of Moore families up to an isomorphism for n ranging from 1 to 6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Habib, M., Nourine, L.: The number of moore family on n=6. Discrete Mathematics 294, 291–296 (2005)
Cohn, P.: Universal Algebra. Harper and Row, New York (1965)
Davey, B.A., Priestley, H.A.: Introduction to lattices and orders, 2nd edn. Cambridge University Press, Cambridge (1991)
Demetrovics, J., Libkin, L., Muchnik, I.: Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics 40(2), 155–185 (1992)
Duquenne, V.: Latticial structure in data analysis. Theoretical Computer Science 217, 407–436 (1999)
Ganter, B., Wille, R.: Formal concept analysis. Mathematical Foundation. Springer, Heidelberg (1999)
Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1967)
Moore, E.: Introduction to a form of general analysis. Yale University Press, New Haven (1910)
Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics 127, 241–269 (2003)
Burosh, G., Demetrovics, J., Katona, G., Kleitman, D., Sapozhenko, A.: On the number of databases and closure operations. Theoretical Computer Science 78, 377–381 (1991)
Higuchi, A.: Note:lattices of closure operators. Discrete Mathematics 179, 267–272 (1998)
Medina, R., Nourine, L.: Algorithme efficace de génération des ideaux d’un ensemble ordonné. Compte rendu de l’Académie des sciences, Paris T.319 série I, pp. 1115–1120 (1994)
McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306–324 (1998)
Ganter, B.: Finding closed sets Under Symmetry. FB4-PrePrint 1307, TH Darmstadt (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colomb, P., Irlande, A., Raynaud, O. (2010). Counting of Moore Families for n=7. In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-11928-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11927-9
Online ISBN: 978-3-642-11928-6
eBook Packages: Computer ScienceComputer Science (R0)