A computation of the eighth Dedekind number

Abstract

We compute the eighth Dedekind number, or the number of monotone collections of subsets of a set with eight elements. The number obtained is 56, 130, 437, 228, 687, 557, 907, 788.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    J.Berman and P.Köhler (1976) Cardinalities of finite distributive lattices, Mitt. Math. Sem. Griessen 121, 103–124.

    Google Scholar 

  2. 2.

    GarrettBirkhoff (1967) Lattice Theory, Amer. Math. Soc., Providence, third ed.

    Google Scholar 

  3. 3.

    R.Church (1965) Enumeration by rank of the free distributive lattice with 7 generators, Notices Amer. Math. Soc. 11, 724.

    Google Scholar 

  4. 4.

    A. D.Korshunov (1981) Probl. Kibern. 38, 5–108.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

Work done while the author was with IDA-CCR, Princeton, New Jersey.

Communicated by I. Rival

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wiedemann, D. A computation of the eighth Dedekind number. Order 8, 5–6 (1991). https://doi.org/10.1007/BF00385808

Download citation

AMS subject classification (1991)

  • 06D99

Key words

  • Dedekind number
  • free distributive lattice
  • monotone