Alternating sign matrix

From Wikipedia, the free encyclopedia

In mathematics, an alternating sign matrix is a square matrix of 0s, 1s, and −1s such that the non-zero entries of each row begin and end with 1 and alternate in sign, and the non-zero entries of each column have the same property. 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

\begin{bmatrix}  0&0&1&0\\ 1&0&0&0\\ 0&1&-1&1\\ 0&0&1&0 \end{bmatrix}

The alternating sign matrix conjecture states that the number of n\times n alternating sign matrices is

\frac{1! 4! 7! \cdots (3n-2)!}{n! (n+1)! \cdots (2n-1!)}

This conjecture was first proved by Doron Zeilberger in 1992. In 1995, Greg Kuperberg gave a short proof that uses the Yang-Baxter equation, and a determinant formula due to Anatoli Izergin and Vladimir Korepin, applied to the square ice interpretation.

[edit] References and further reading

[edit] External links