For m≥n, the antidiagonal ν-chain maximizes Σ_l min(c_l,mn−c_l), attaining D(m,n).
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For m≥n, the antidiagonal ν-chain maximizes Σ_l min(c_l,mn−c_l), attaining D(m,n). Open residue: Verified through 5×4.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
Exhaustive enumeration confirms all cases through 5×4; chains and the objective are finite and exactly enumerable.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Enumerate ν-chains with symmetry reduction or optimize via dynamic programming/ILP; output a better chain or proof certificate. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.