Problems / combinatorics
combinatorics / Latin squares; determinant divisibility
Parity obstruction in the minimum-determinant problem for Latin squares
For even n, let q(L)=det(L)/bn. The work proves that q(L) is even exactly when the stronger centered divisibility n2∣det(Estd) holds. For n≡2(mod4), this is equivalent to rankF2(Amod2)<n−1; for n≡0(mod4), it is equivalent to adj(Amod2)1=0. An explicit family gives odd q(L) for every n≡2(mod4), n≥6. This removes a universal extra-factor-two obstruction, but it does not prove ∣q(L)∣=1. Exact minimum attainment and the separate singularity question remain open.