Proof of the alternating sign matrix conjecture
The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2
The number of $n \times n$ matrices whose entries are either $-1$, $0$, or $1$, whose row- and column- sums are all $1$, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $$[1!4! \dots (3n-2)!] \over [n!(n+1)! \dots (2n-1)!],$$ as conjectured by Mills, Robbins, and Rumsey.
DOI :
10.37236/1271
Classification :
05B20, 05A15, 15B36
Mots-clés : alternating sign matrix conjecture, conjecture by Mills, Robbins, and Rumsey
Mots-clés : alternating sign matrix conjecture, conjecture by Mills, Robbins, and Rumsey
@article{10_37236_1271,
author = {Doron Zeilberger},
title = {Proof of the alternating sign matrix conjecture},
journal = {The electronic journal of combinatorics},
year = {1996},
volume = {3},
number = {2},
doi = {10.37236/1271},
zbl = {0858.05023},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1271/}
}
Doron Zeilberger. Proof of the alternating sign matrix conjecture. The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2. doi: 10.37236/1271
Cité par Sources :