Finite-n Estimate of Dedekind
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo
Announce Type: cross Abstract: Dedekind's problem counts monotone Boolean functions, equivalently downsets of a Boolean lattice. We recast this enumeration as a finite layer-ratio reconstruction problem for the Whitney numbers of the ranked ideal lattice. An exact adjacent-layer double count expresses each layer ratio through local averages of the number of addable elements and the number of removable elements.