On the number of even and odd Latin squares of order \(p+1\) (Q1362611)

Each row and column of a Latin square, \(L\), of order \(n\) can be thought of as a permutation of the elements of an \(n\)-set. The sign of a row or a column of \(L\) is the sign of the permutation. The sign \(\varepsilon(L)\) of \(L\) is the product of the signs of the \(2n\) rows and columns. The Alon-Tarsi conjecture states that for \(n\) an even integer, \(\sum\varepsilon(L)\neq 0\), where the sum is over all \(L\) of order \(n\). Previously, the conjecture had been verified for \(n=2, 4, 6\), and 8. The author establishes the conjecture for the special case of \(n=p+1\), where \(p\) is an odd prime. Specifically, he shows in this case that \[ \sum \varepsilon(L)\equiv(- 1)^{(p+ 1)/2} p^2\pmod{p^3}. \] Properties of isotopisms, cyclic neofields, and orthomorphisms of \(\mathbb{Z}_p\) are used in his proof.