OFFSET
2,3
COMMENTS
The extended Alon-Tarsi conjecture states AT(n)<>0 for every positive integer n. Several cases have been proved - see references.
LINKS
Jochem Berndsen, Three problems in algebraic combinatorics, Student thesis: Master, Eindhoven University of Technology, 2012.
A. Drisko, Proof of the Alon-Tarsi Conjecture for n=(2^r)*p, Electronic Journal of Combinatorics, Volume 5 (1998).
David G. Glynn, The Conjectures of Alon-Tarsi and Rota in Dimension Prime Minus One, SIAM Journal on Discrete Mathematics, 24 (2010), 394-399.
Eric Weisstein's World of Mathematics, Alon-Tarsi Conjecture
P. Zappa, The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture, Advances in Applied Mathematics, 19 (1997), 31-44. [Contains an error: see Glynn.]
FORMULA
AT(n)=(fdels(n)-fdols(n))/(n-1)!, where fdels(n) and fdols(n) are the numbers of fixed diagonal even and fixed diagonal odd Latin squares, respectively.
CROSSREFS
KEYWORD
hard,sign,more
AUTHOR
Jan Siwanowicz (jansiwanowicz(AT)yahoo.com), Dec 04 2001
EXTENSIONS
Terms a(9) and a(10) added by Jochem Berndsen, Jun 05 2012
STATUS
approved