English

3-enumerated alternating sign matrices

Mathematical Physics 2007-05-23 v1 Combinatorics math.MP

Abstract

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

Cite

@article{arxiv.math-ph/0304004,
  title  = {3-enumerated alternating sign matrices},
  author = {Yu. G. Stroganov},
  journal= {arXiv preprint arXiv:math-ph/0304004},
  year   = {2007}
}

Comments

13 pages