Proof of the Alternating Sign Matrix Conjecture
Combinatorics
2008-02-03 v1
Abstract
The number of 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 , as conjectured by Mills, Robbins, and Rumsey.
Cite
@article{arxiv.math/9407211,
title = {Proof of the Alternating Sign Matrix Conjecture},
author = {Doron Zeilberger},
journal= {arXiv preprint arXiv:math/9407211},
year = {2008}
}
Comments
Plain TeX