arXiv (OAI Expanded)
open access
Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo
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 loc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On (n,k)-Simple Random Integer Lattices.#315711
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- Information-Theoretic Foundations of the AaroNet Multi-Scale Detector#237194
- (p,q)- Stirling Numbers of Type B via Signed Restricted Growth Functions and Rook Theory#369645
- Omega bound for the Piltz divisor problem#1118893
Record · ID 1109074
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive