arXiv (All)
open access
Engel's Interval Packing Problem in the Boolean Lattice
Let \(\mathcal{B}_n\) be the Boolean lattice of all subsets of \([n]\) and let \(\mathcal{P}_{n;\ell,u}\) be the subposet of \(\mathcal{B}_n\) induced by the consecutive levels \(\ell,\ell+1,\ldots,u\). We determine $ν_{n;\ell,u}$, the maximum size of a family of pairwise disjoint maximal intervals
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
- Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$#31204
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- Arithmetic Progressions in a Random Binary Subset-Sum Set#1117779
- Ehrhart positivity for lattice path matroids#926041
- Algorithmic obstructions in the random number partitioning problem#357741
Record · ID 1050907
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