Proof of the Alternating Sign Matrix Conjecture

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-273092

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.