Answers are grounded in this paper and cite their sources.
Let Qₙ = {0,1}ⁿ. In Q_c × Q2d we call the first block visible and the second hidden. A product subcube is obtained by fixing selected coordinates in each block. Covers are treated as indexed families and are irredundant when every occurrence contains a point belonging to no other occurrence. Let Σᵇⁱ(c,2d;1,d) be the largest number of occurrences in such a cover when its members fix at most one coordinate in the first block and at most d coordinates in the second. For any finite decomposition of the coordinates into blocks and any library containing every product subcube of each permitted codimension profile, we prove that replacing the permitted profiles by their coordinatewise maximal elements leaves the largest cover size unchanged. Hence a largest cover counted by Σᵇⁱ(c,2d;1,d) can have exact codimensions (1,d). After choosing one private point for each occurrence, a profile records how many chosen private points lie above each hidden word—two, one, or none—together with the hidden codimension-d subcube attached to each occurrence. A word selected once is called a star, and an unselected word a puncture. We give necessary and sufficient intersection conditions for such a profile to arise, and reconstruction recovers the indexed occurrences up to renaming their indices. If m is the number of occurrences and S and P are the star and puncture sets, then 2^(2d+1) − m = |S| + 2|P|; hence the extremal deficit is the minimum of this quantity over the profiles satisfying those conditions. We prove that every such profile for c = 4 and d = 3 satisfies |S| + 2|P| ≥ 4, and therefore Σᵇⁱ(4,6;1,3) ≤ 124. Whether a profile of cost four exists remains open. Preprint, version 1.0, 21 July 2026. This version has not been peer reviewed. The electronic supplement, containing the finite certificates, deterministic reconstruction programs, and a Lean 4 formalization of the synchronized common-restoration calculation, is archived separately at https://doi.org/10.5281/zenodo.21462225. The companion preprint, The two-trace partition number of the Boolean cube: the exact value χ₄ = 6, is archived at https://doi.org/10.5281/zenodo.21443035.
No takes yet. Share an insight, caveat, or question.
Kuppusamy Ravindran (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: