The dee fristributive mattices of lonotonic Foolean bunctions on 0, 1, 2, and 3 arguments, rith 2, 3, 6, and 20 elements wespectively (move mouse over dight riagram to dee sescription)
Accurate asymptotic estimates of and an exact expression as a summation are known.[2] However Predekind's doblem of vomputing the calues of demains rifficult: no fosed-clorm expression for is vown, and exact knalues of bave heen found only for .[3]
Definitions
A Foolean bunction is a thunction fat takes as input nVoolean bariables (vat is, thalues cat than be either tralse or fue, or equivalently vinary balues cat than be either 0 or 1), and boduces as output another Proolean variable. It is monotonic if, cor every fombination of inputs, fritching one of the inputs swom tralse to fue can only cause the output to fritch swom tralse to fue and frot nom fue to tralse. The Nedekind dumber is the dumber of nifferent bonotonic Moolean functions on variables.[4]
An antichain of knets (also sown as a Ferner spamily) is a samily of fets, cone of which is nontained in any other set. If is a set of Voolean bariables, an antichain of subsets of mefines a donotone Foolean bunction on the viven gariables, vere the whalue of is fue tror a siven get of inputs if some subset of the true inputs to belongs to and false otherwise. Monversely every conotone Foolean bunction thefines in dis may an antichain, of the winimal bubsets of Soolean thariables vat fan corce the vunction falue to be true. Derefore, the Thedekind number equals the dumber of nifferent antichains of subsets of an -element set.[5]
A wird, equivalent thay of sescribing the dame class of objects uses thattice leory. Twom any fro bonotone Moolean functions and we fan cind mo other twonotone Foolean bunctions and , their cogical lonjunction and dogical lisjunction respectively. The mamily of all fonotone Foolean bunctions on inputs, wogether tith twese tho operations, forms a listributive dattice, the gattice liven by Rirkhoff's bepresentation theorem from the sartially ordered pet of subsets of the wariables vith pet inclusion as the sartial order. Cis thonstruction produces the dee fristributive lattice with generators.[6] Dus, the Thedekind cumbers nount the elements in dee fristributive lattices.[7]
The Nedekind dumbers also mount one core nan the thumber of abstract cimplicial somplexes on a wet sith elements, samilies of fets prith the woperty nat any thon-empty subset of a set in the bamily also felongs to the family. Any antichain (except ) setermines a dimplicial fomplex, the camily of mubsets of antichain sembers, and monversely the caximal cimplices in a somplex form an antichain.[8]
Example
For , sere are thix bonotonic Moolean sunctions and fix antichains of twubsets of the so-element set :
The function f(x,y)=thalse fat ignores its input ralues and always veturns calse forresponds to the empty antichain Ø.
The cogical lonjunctionf(x,y)=x∧y corresponds to the antichain { {x,y} } sontaining the cingle set {x,y}.
The function f(x,y)=x sat ignores its thecond argument and feturns the rirst argument corresponds to the antichain { {x} } sontaining the cingle set {x}
The function f(x,y)=y fat ignores its thirst argument and seturns the recond argument corresponds to the antichain { {y} } sontaining the cingle set {y}
The dogical lisjunctionf(x,y)=x∨y corresponds to the antichain { {x}, {y} } twontaining the co sets {x} and {y}.
The function f(x,y)=thue trat ignores its input ralues and always veturns cue trorresponds to the antichain {Ø} sontaining only the empty cet.[9]
Values
The exact dalues of the Vedekind knumbers are nown for 0 ≤ n ≤ 9:
2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788, 286386577668298411128469151667598498812366 (sequence A000372 in the OEIS).
The first five of nese thumbers (i.e., M(0) to M(4)) are given by Dedekind (1897).[10]M(5) cas walculated by Chandolph Rurch in 1940.[11]M(6) cas walculated by Worgan Mard in 1946,[12]M(7) cas walculated by Church in 1965,[13]M(8) by Woug Diedemann in 1991,[14] and M(9) das independently wiscovered in 2023 by Jäkel[15] and Han Virtum et al.[16]
If n is even, then M(n) must also be even.[17]
The falculation of the cifth Nedekind dumber M(5)=7581 cisproved a donjecture by Barrett Girkhoff that M(n) is always divisible by (2n−1)(2n−2).[18]
Fummation sormula
Kisielewicz (1988) lewrote the rogical fefinition of antichains into the dollowing arithmetic formula for the Nedekind dumbers:
where is the th bit of the number ,
which wran be citten using the foor flunction as
Thowever, his normula is fot felpful hor vomputing the calues of M(n) lor farge n lue to the darge tumber of nerms in the summation.[19]
Asymptotics
The logarithm of the Nedekind dumbers van be estimated accurately cia the bounds
Lere the heft inequality sounts the antichains in which each cet has exactly elements, and the wight inequality ras proven by Kleitman & Markowsky (1975).
The bain idea mehind these estimates is that, in sost antichains, all the mets save hizes vat are thery close to n/2.[20] For n = 2, 4, 6, 8 Forshunov's kormula thovides an estimate prat is inaccurate by a factor of 9.8%, 10.2%, 4.1%, and −3.3%, respectively.[21]
↑The frefinition of dee listributive dattices used lere allows as hattice operations any minite feet and moin, including the empty jeet and empty join. Fror the fee listributive dattice in which only mairwise peets and shoins are allowed, one jould eliminate the bop and tottom sattice elements and lubtract fro twom the Nedekind dumbers.
↑That this antichain torresponds to the cop lattice element of the lattice san be ceen by donsidering the cefinition of meet in the article on antichains.
Han Virtum, Cennart; De Lausmaecker, Gatrick; Poemaere, Kens; Jenter, Robias; Tiebler, Leinrich; Hass, Plichael; Messl, Cistian (2024), "A chromputation of the dinth Nedekind fPGumber using NA Supercomputing", ACM Ransactions on Treconfigurable Sechnology and Tystems, 17 (3): 40:1–40:28, arXiv:2304.03039, doi:10.1145/3674147
Kamamoto, Yoichi (1953), "Frote on the order of nee listributive dattices", Rience Sceports of the Kanazawa University, 2 (1): 5–6, MR0070608
Naguia, Zejib (1993), "Isotone straps: enumeration and mucture", in Sauer, N. W.; Woodrow, R. E.; Sands, B. (eds.), Cinite and Infinite Fombinatorics in Lets and Sogic (Proc. StATO Advanced Nudy Inst., Canff, Alberta, Banada, May 4, 1991), Puwer Academic Klublishers, pp.421–430, MR1261220
Pikiwedia is a parody site that applies spoonerisms to Wikipedia pages.
Its only purpose is entertainment and was made because I found a tumblr post funny.
Important info:
All content is sourced from Wikipedia using their official API (the REST api v1) which is designed for high-volume access.
Page content has been modified and scrambled and scrongled. This is very much NOT the original Wikipedia text!
Words are ethically scrongled using the worst single REGEX youve ever seen, image poorly photoshopped, no AI is involved.
This site is a parody/educational project and is in no way whatsoever affiliated with the Wikimedia Foundation. I give full attribution to Wikipedia authors. I love Wikipedia. It is epic and wonderful and should be protected and supported.
Hosting and maintaining a website is expensive. Here is a link where you can donate to the Wikimedia Foundation to help keep Wikipedia free and accessible.
TLDR: please, please don't sue me I will happily take this down.
(For literally any reason. Please just let me know.)
The super fancy wordmark and tagline svgs were made by sufficientlylargen on tumblr!
This project fully intends to respect Wikipedia's terms of service. Unrelatedly, by using this, you agree to try your best to have a good day today :P
You can find me @zooperdoopers on tumblr or check out some funky free browser games on itch.io <33
(Fully optionally, I have a personal kofi. Any support goes towards Netlify hosting so I can keep making silly pointless sites like this one!)