combinatorics / Latin squares; determinant divisibility

Parity obstruction in the minimum-determinant problem for Latin squares

For even nn, let q(L)=det(L)/bnq(L)=\det(L)/b_n. The work proves that q(L)q(L) is even exactly when the stronger centered divisibility n2det(Estd)n^2\mid\det(E_{\mathrm{std}}) holds. For n2(mod4)n\equiv2\pmod4, this is equivalent to rankF2(Amod2)<n1\operatorname{rank}_{\mathbb F_2}(A\bmod2)<n-1; for n0(mod4)n\equiv0\pmod4, it is equivalent to adj(Amod2)1=0\operatorname{adj}(A\bmod2)\mathbf1=0. An explicit family gives odd q(L)q(L) for every n2(mod4)n\equiv2\pmod4, n6n\ge6. This removes a universal extra-factor-two obstruction, but it does not prove q(L)=1|q(L)|=1. Exact minimum attainment and the separate singularity question remain open.

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsApr 22, 2026Significance 10/100Registry: unreviewed

Parity obstruction in the minimum-determinant problem for Latin squares

Prior state unknownproved

For even nn, let q(L)=det(L)/bnq(L)=\det(L)/b_n. The work proves that q(L)q(L) is even exactly when the stronger centered divisibility n2det(Estd)n^2\mid\det(E_{\mathrm{std}}) holds. For n2(mod4)n\equiv2\pmod4, this is equivalent to rankF2(Amod2)<n1\operatorname{rank}_{\mathbb F_2}(A\bmod2)<n-1; for n0(mod4)n\equiv0\pmod4, it is equivalent to adj(Amod2)1=0\operatorname{adj}(A\bmod2)\mathbf1=0. An explicit family gives odd q(L)q(L) for every n2(mod4)n\equiv2\pmod4, n6n\ge6. This rem…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

For even nn, let q(L)=det(L)/bnq(L)=\det(L)/b_n. The work proves that q(L)q(L) is even exactly when the stronger centered divisibility n2det(Estd)n^2\mid\det(E_{\mathrm{std}}) holds. For n2(mod4)n\equiv2\pmod4, this is equivalent to rankF2(Amod2)<n1\operatorname{rank}_{\mathbb F_2}(A\bmod2)<n-1; for n0(mod4)n\equiv0\pmod4, it is equivalent to adj(Amod2)1=0\operatorname{adj}(A\bmod2)\mathbf1=0. An explicit family gives odd q(L)q(L) for every n2(mod4)n\equiv2\pmod4, n6n\ge6. This removes a universal extra-factor-two obstruction, but it does not prove q(L)=1|q(L)|=1. Exact minimum attainment and the separate singularity question remain open.

For even nn, let q(L)=det(L)/bnq(L)=\det(L)/b_n. The work proves that q(L)q(L) is even exactly when the stronger centered divisibility n2det(Estd)n^2\mid\det(E_{\mathrm{std}}) holds. For n2(mod4)n\equiv2\pmod4, this is equivalent to rankF2(Amod2)<n1\operatorname{rank}_{\mathbb F_2}(A\bmod2)<n-1; for n0(mod4)n\equiv0\pmod4, it is equivalent to adj(Amod2)1=0\operatorname{adj}(A\bmod2)\mathbf1=0. An explicit family gives odd q(L)q(L) for every n2(mod4)n\equiv2\pmod4, n6n\ge6. This removes a universal extra-factor-two obstruction, but it does not prove q(L)=1|q(L)|=1. Exact minimum attainment and the separate singularity question remain open.

Recorded attempts

Evidence graph

Connected research record

Parity obstruction in the minimum-determinant problem for Latin squares — Mathematical Frontier Network