Proof of the Alon-Tarsi conjecture for \(n=2^rp\) (Q1386553): Difference between revisions

A Latin square \(L\) of order \(n\) is an \(n\times n\) matrix whose rows and columns are permutations of \(\{0,1,\dots,n-1\}\). Denote by \(\text{els}(n)\) and \(\text{ols}(n)\) respectively the number of even and odd Latin squares of order \(n\). The Alon-Tarsi conjecture states that \(\text{els}(n)= \text{ols}(n)\) for even \(n\). In this paper, the author shows that the conjecture is true for \(n= 2^r(p+ 1)\) where \(p\) is an odd prime.