Mathematics – Combinatorics
Scientific paper
1994-07-02
Elec. J. Comb. 3(2)(1996), R13
Mathematics
Combinatorics
Plain TeX
Scientific paper
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.
No associations
LandOfFree
Proof of the Alternating Sign Matrix Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof of the Alternating Sign Matrix Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of the Alternating Sign Matrix Conjecture will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-273092