Alternating sign matrix
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
Alternating sign matrix
In mathematics, an alternating sign matrix is a square matrix of 0s, 1s, and −1s such that the sum of each row and column is 1 and the nonzero entries in each row and column alternate in sign. These matrices arise naturally when using Dodgson condensation to compute a determinant. They are also closely related to the square ice model from statistical mechanics. They were first defined by William Mills, David Robbins, and Howard Rumsey in the former context. For example, the permutation matrices are alternating sign matrices, as is
The alternating sign matrix conjecture states that the number of n\times n alternating sign matrices is
This conjecture was first proved by Doron Zeilberger in 1992. In 1995, Greg Kuperberg gave a short proof based on the Yang-Baxter equation for the square ice model, that uses a determinant formula due to Anatoli Izergin (which solves recurrence relations due to Vladimir Korepin). References and further reading
External links
eo:Alterna signa matrico th:??????????????????????? Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement