GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Dedekind Number -- from Wolfram MathWorld

Search

Dedekind Number


DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The nth Dedekind number d(n) is the number of monotone Boolean functions of n variables, for a nonnegative integer n. Equivalently, it counts the antichains, including the empty one, in the power set of an n-element set ordered by inclusion. For n=0, 1, ..., d(n) is given by 2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788, 286386577668298411128469151667598498812366, ... (OEIS A000372).

The numbers and their discoverers are summarized in the following table (Yusun 2011, Jäkel 2023). The last of these values was found by Jäkel (2023) using 5311 GPU-hours and 4257682565 matrix multiplications on Nvidia A100 GPUs.

nd(n)source
02Dedekind (1897)
13Dedekind (1897)
26Dedekind (1897)
320Dedekind (1897)
4168Dedekind (1897)
57581Church (1940)
67828354Ward (1946)
72414682040998Church (1965)
856130437228687557907788Wiedemann (1991)
9286386577668298411128469151667598498812366Jäkel (2023)

The determination of these numbers is known as Dedekind's problem.

Pawelski et al. (2026) obtained the congruences

 d(10)=106  (mod210), d(11)=117  (mod210), d(12)=12  (mod30).

In particular, d(11) is odd. The computation counts fixed points of actions of finite p-groups on monotone Boolean functions. These congruences do not determine the exact values of the three Dedekind numbers.


See also

Antichain, Boolean Function, Dedekind's Problem

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • 3.14159265
  • circle through (0,0), (1,0), (0,1)
  • Hankel matrices

References

Church, R. "Numerical Analysis of Certain Free Distributive Structures." Duke Math. J. 6, 732-733, 1940.Church, R. "Enumeration by Rank of the Elements of the Free Distributive Lattice with Seven Generators." Not. Amer. Math. Soc. 12, 724, 1965.Dedekind, R. "Über Zerlegungen von Zahlen durch ihre grössten gemeinsamen Theiler." In Festschrift der Technischen Hochschule zu Braunschweig bei Gelegenheit der 69. Versammlung Deutscher Naturforscher und Ärzte. Braunschweig, Germany: Meyer, pp. 1-40, 1897. https://doi.org/10.1007/978-3-663-07224-9_1. Reprinted in Gesammelte mathematische Werke, Bd. 2 (Ed. R. Fricke, E. Noether, and Ø. Ore). Braunschweig, Germany: Vieweg, pp. 103-147, 1931. https://gdz.sub.uni-goettingen.de/id/PPN235693928.Jäkel, C. "A Computation of the Ninth Dedekind Number." J. Comput. Algebra 6-7, 100006, 2023. https://doi.org/10.1016/j.jaca.2023.100006.Sloane, N. J. A. Sequence A000372/M0817 in "The On-Line Encyclopedia of Integer Sequences."Pawelski, B.; Szepietowski, A.; and Szepietowski, B. "Congruences for Dedekind Numbers." 10 Nov 2026. https://arxiv.org/abs/2611.13887v1.Ward, M. "Note on the Order of the Free Distributive Lattice." Bull. Amer. Math. Soc. 52, 423, 1946.Wiedemann, D. "A Computation of the Eighth Dedekind Number." Order 8, 5-6, 1991.Yusun, T. J. L. "Dedekind Numbers and Related Sequences." Master's thesis. Burnaby, British Columbia, Canada: Simon Fraser University, 2011. https://summit.sfu.ca/item/12001.

Referenced on Wolfram|Alpha

Dedekind Number

Cite this as:

Weisstein, Eric W. "Dedekind Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DedekindNumber.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.