Call cube-free if no triple has all seven of , , , , , , inside . The triple is unconstrained, so a degenerate one counts. Write for the largest size of a cube-free subset.
The conjecture. for every .
This is Conjecture 5.1 of Jason Long and Adam Zsolt Wagner, The largest projective cube-free subsets of , arXiv:1810.01225. It has been open since October 2018, and a 2026 journal paper still names it as conjectured: Yuchen Meng, On Cube-Free Problems, Electron. J. Combin. 33(1) (2026) #P1.16.
The bound is sharp, and the extremal set is explicit: , the odd residues together with those congruent to 4 mod 8. Its size is . In the layer language of Long and Wagner this is .
The conjecture holds for unions of layers. That is Long-Wagner Theorem 1.10 at , and it is the largest class on which the conjectured constant is proved.
For arbitrary sets the best published unconditional bound is . Meng calls this bound "quite trivial" and gives it in one paragraph for every cyclic group, so it should not be read as progress toward . The residual gap is exactly , that is elements.
Small values are , , , , , , , matching from on.
State those values honestly. They come from solver searches, Gurobi in Long and Wagner for and an independent SAT reproduction. The SAT half that matters, the unsatisfiability of "a cube-free set of size 81 exists at ", is a solver claim with no proof certificate checked and no kernel check behind it. The witness half is verified: a set of exactly 80 elements was produced and re-checked cube-free. So is solid and is not certified. Nothing in this mission rests on either.
The goal item is the conjecture itself, for , and it is open. Every other item is a milestone that is proved mathematics, and the two closed instances and are stated separately because they are the only cases of the goal that a proof assistant has actually settled here.
The chain runs: the base case mod 8 by exhaustion, monotonicity under subsets, the bridge between the membership form and the Finset form of the forbidden configuration, sharpness, the odd-residue tight case, the layer-union theorem, the two-thirds bound, and then and .
Six definitions live in one definition item, Def_Z2nCubeFreeLayers: HasCube, CubeFree, config, ConfigFree, layerIdx and IsLayerUnion. layerIdx is written through the 2-adic valuation rather than through a congruence, because the congruence form leaves in no layer at all and needs the last layer special-cased.
CubeFree and ConfigFree are two encodings of the same condition and they are not definitionally equal, because config collapses duplicates on a degenerate triple. Their equivalence is a milestone rather than an assumption.
namespace Z2nFiveEighths
theorem cubeFree_card_le_five_eighths (n : ℕ) (hn : 4 ≤ n)
(A : Finset (ZMod (2 ^ n))) (hA : CubeFree A) :
8 * A.card ≤ 5 * 2 ^ n := by sorry
end Z2nFiveEighths
For every and every containing no configuration , we have , that is .
This is open. It is Conjecture 5.1 of Long and Wagner, stated in October 2018 and still named as conjectured in a 2026 journal paper.
The triple is unconstrained, so a degenerate triple counts and the condition is genuinely about affine 3-cubes rather than about distinct generators. The constant is attained by , so it cannot be improved.
No open leaves. Every sub-goal is proved or awaiting decomposition.