Skip to main content
SpringerLink
Log in

A computation of the eighth Dedekind number

  • Published:
Order Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Thinking Machines Corporation, 245 First Street, 02142, Cambridge, Massachusetts, USA

    Doug Wiedemann

Authors
  1. Doug Wiedemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by I. Rival

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

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

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00385808

AMS subject classification (1991)

Key words

Search

Navigation