Square-root cancellation for the signs of Latin squares

preprint2014arXivOpen access

Abstract

Let L(n)L(n) be the number of Latin squares of order nn, and let Leven(n)L^{\textrm{even}}(n) and Lodd(n)L^{\textrm{odd}}(n) be the number of even and odd such squares, so that L(n)=Leven(n)+Lodd(n)L(n) = L^{\textrm{even}}(n) + L^{\textrm{odd}}(n). The Alon-Tarsi conjecture states that Leven(n)≠Lodd(n)L^{\textrm{even}}(n)\neq L^{\textrm{odd}}(n) when nn is even (when nn 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),|L^{\textrm{even}}(n) - L^{\textrm{odd}}(n)|\leq L(n)^{\frac{1}{2} + 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)\mathrm{SU}(n). The method is inspired by a recent result of Kumar-Landsberg.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.