Square-root cancellation for the signs of Latin squares
Abstract
Let L(n) be the number of Latin squares of order n, and let Leven(n) and Lodd(n) be the number of even and odd such squares, so that L(n) = Leven(n) + Lodd(n). The Alon-Tarsi conjecture states that Leven(n)≠ Lodd(n) when n is even (when n is odd the two are equal for very simple reasons). In this short note we prove that |Leven(n) - Lodd(n)|≤ L(n)12 + o(1), thus establishing the conjecture that the number of even and odd Latin squares, while conjecturally not equal in even dimensions, are equal to leading order asymptotically. Two proofs are given: both proceed by applying a differential operator to an exponential integral over SU(n). The method is inspired by a recent result of Kumar-Landsberg.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.