Skip to content

3-enumerated alternating sign matrices

Yu. G. Stroganov

math-pharXiv:math-ph/0304004

Abstract

Let A(n,r;3) be the total weight of the alternating sign matrices of order n whose sole `1' of the first row is at the rth column and the weight of an individual matrix is 3k if it has k entries equal to -1. Define the sequence of the generating functions Gn(t)=Σr=1n A(n,r;3)tr-1. Results of two different kind are obtained. On the one hand I made the explicit expression for the even subsequence G2ν(t) in terms of two linear homogeneous second order recurrence in ν (Theorem 1). On the other hand I brought to light the nice connection between the neighbouring functions G2ν+1(t) and G2ν(t) (Theorem 2). The 3-enumeration A(n;3) Gn(1) which was found by Kuperberg is reproduced as well.

Create a lesson