Proof of the Alternating Sign Matrix Conjecture
| dc.creator | Zeilberger, Doron | |
| dc.date | 1994-07-02 | |
| dc.date.accessioned | 2026-07-07T09:15:09Z | |
| dc.date.available | 2026-07-07T09:15:09Z | |
| dc.description | 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! >... (3n-2)!]/[n!(n+1)! ... (2n-1)!]$, as conjectured by Mills, Robbins, and Rumsey. | |
| dc.description | Plain TeX | |
| dc.identifier | https://arxiv.org/abs/math/9407211 | |
| dc.identifier | http://arxiv.org/abs/math/9407211 | |
| dc.identifier | Elec. J. Comb. 3(2)(1996), R13 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152921 | |
| dc.subject | Combinatorics | |
| dc.title | Proof of the Alternating Sign Matrix Conjecture | |
| dc.type | text |