Báo cáo toán học: "Around the Razumov–Stroganov conjecture: proof of a multi-parameter sum rule" pot

Around the Razumov–Stroganov conjecture: proof of a multi-parameter sum rule P. Di Francesco Service de Physique Th´eorique de Saclay, CEA/DSM/SPhT, URA 2306 du CNRS C.E.A Saclay, F-91191 Gif sur Yvette Cedex, France P. Zinn-Justin LIFR–MIIP, Independent University, 119002, Bolshoy Vlasyevskiy Pereulok 11, Moscow, Russia and Laboratoire de Physique Th´eorique et Mod`eles Statistiques, UMR 8626 du CNRS Universit´e Paris-Sud, Bˆatiment 100, F-91405 Orsay Cedex, France Submitted: Nov 9, 2004; Accepted: Dec 21, 2004; Published: Jan 11, 2005 Mathematics Subject Classification: Primary 05A19; Secondary 52C20, 82B20 Abstract We prove that the sum of entries of the suitably normalized groundstate vector of the O(1) loop model with periodic boundary conditions on a periodic strip of size 2n is equal to the total number of n×n alternating sign matrices. This is done by identifying the state sum of a multi-parameter inhomogeneous version of the O(1) model with the partition function of the inhomogeneous six-vertex model on a n × n square grid with domain wall boundary conditions. 1. Introduction Alternating Sign Matrices (ASM), i.e. matrices with entries 0, 1, −1, such that 1 and −1’s alternate along each row and column, possibly separated by arbitrarily many 0’s, and such that row and column sums are all 1, have attracted much attention over the years and seem to be a Leitmotiv of modern combinatorics, hidden in many apparently unrelated problems, involving among others various types of plane partitions or the rhombus tilings of domains of the plane (see the beautiful book by Bressoud [1] and references therein). The intrusion first of physics and then of physicists in the subject was due to the fundamental remark that the ASM of size n × n may be identified with configurations of the six-vertex model, that consist of putting arrows on the edges of a n × n square grid, subject to the ice rule (there are exactly two incoming and two outgoing arrows at each vertex of the grid), with so-called domain wall boundary conditions. This remark was instrumental in Kuperberg’s alternative proof of the ASM the electronic journal of combinatorics 12 (2005), #R6 1 conjecture [2]. The latter relied crucially on the integrability property of this model, that eventually allowed for finding closed determinantal expressions for the total number A n of ASM of size n × n, and some of its refinements. This particular version of the six-vertex model has been extensively studied by physicists, culminating in a multi- parameter determinant formula for the partition function of the model, due to Izergin and Korepin [3] [4]; some of its specializations were more recently studied by Okada [5] and Stroganov [6]. An interesting alternative formulation of the model is in terms of Fully Packed Loops (FPL). The configurations of this model are obtained by occupying or not the edges of the grid with bonds, with the constraint that exactly two bonds are incident to each vertex of the grid. The model is moreover subject to the boundary condition that every other external edge around the grid is occupied by a bond. These are then labeled 1, 2, ,2n. A given configuration realizes a pairing of these external bonds via non-intersecting paths of consecutive bonds, possibly separated by closed loops. On an apparently disconnected front, Razumov and Stroganov [7] discovered a re- markable combinatorial structure hidden in the groundstate vector of the homogeneous O(1) loop model, surprisingly also related to ASM numbers. The latter model may be expressed in terms of a purely algebraic Hamiltonian, which is nothing but the sum of generators of the Temperley–Lieb algebra, acting on the Hilbert space of link patterns π, i.e. planar diagrams of 2n points around a circle connected by pairs via non-intersecting arches across the disk. These express the net connectivity pattern of the configurations of the O(1) loop model on a semi-infinite cylinder of perimeter 2n (i.e. obtained by im- posing periodic boundary conditions). Razumov and Stroganov noticed that the entry of the suitably normalized groundstate vector Ψ n corresponding to the link pattern π was nothing but the partition function of the FPL model in which the external bonds are connected via the same link pattern π. A weaker version of this conjecture, which we refer to as the sum rule, is that the sum of entries of Ψ n is equal to the total number A n of ASM. The sum rule was actually conjectured earlier in [8]. Both sides of this story have been generalized in various directions since the original works. In particular, it was observed that some choices of boundary conditions in the O(1) model are connected in analogous ways to symmetry classes of ASM [9,10]. Con- centrating on periodic boundary conditions, it was observed recently that the Razumov– Stroganov conjecture could be extended by introducing anisotropies in the O(1) loop model, in the form of extra bulk parameters [11,12]. The aim of this paper is to prove the sum rule conjecture of [8] in the case of periodic boundary conditions, and actually a generalization thereof that identifies the partition function of the six-vertex model with domain wall boundary conditions with the sum of entries of the groundstate vector of a suitably defined multi-parameter inhomogeneous version of the O(1) loop model. This proves in particular the generalizations of the sum rule conjectured in [11,12]. Our proof, like Kuperberg’s proof of the ASM conjecture, is non-combinatorial in nature and relies on the integrability of the model under the form of Yang–Baxter and related equations. The paper is organized as follows. In Sect. 2 we recall some known facts about the the electronic journal of combinatorics 12 (2005), #R6 2 partition function Z n of the inhomogeneous six-vertex model with domain wall boundary conditions, including some simple recursion relations that characterize it completely. In Sect. 3, we introduce the multi-parameter inhomogeneous version of the O(1) loop model and compute its transfer matrix (Sect. 3.1), and make a few observations on the corresponding groundstate vector Ψ n (Sect. 3.2), in particular that the sum of entries of this vector, once suitably normalized, coincides with Z n . This section is completed by appendix A, where we display the explicit groundstate vector of the O(1) loop model for n = 2, 3. Section 3.3 is devoted to the proof of this statement: we first show that the entries Ψ n,π of the vector Ψ n obey some recursion relations relating Ψ n,π to Ψ n−1,π  , when two consecutive spectral parameters take particular relative values, and where π  is obtained from π by erasing a “little arch” connecting two corresponding consecutive points. As eigenvectors are always defined up to multiplicative normalizations, we have to fix precisely the relative normalizations of Ψ n and Ψ n−1 in the process. This is done by computing the degree of Ψ n as a homogeneous polynomial of the spectral parameters of the model, and involves deriving an upper bound for this degree (the calculation, based on the Algebraic Bethe Ansatz formulation of Ψ n , is detailed in appendix B), and showing that no extra non-trivial polynomial normalization is allowed by this bound. This is finally used to prove that the sum of entries of Ψ n is a symmetric homogeneous polynomial of the spectral parameters and that it obeys the same recursion relations as the six-vertex partition function Z n . The sum rule follows. Further recursion properties are briefly discussed. Section 3.4 displays a few applications of these results, including the proof of the conjecture on the sum of components, and some of its recently conjectured generalizations. A few concluding remarks are gathered in Sect. 4. 2. Six Vertex model with Domain Wall Boundary Conditions The configurations of the six vertex (6V) model on the square lattice are obtained by orienting each edge of the lattice with arrows, such that at each vertex exactly two arrows point to (and two from) the vertex. These are weighted according to the six possible vertex configurations below aabbcc with a, b, c given by a = q −1/2 w − q 1/2 zb= q −1/2 z − q 1/2 wc=(q −1 − q)(zw) 1/2 (2.1) and where w, z are the horizontal and vertical spectral parameters of the vertex. q is an additional global parameter, independent of the vertex. 1 1 Note that we use a slightly unusual sign convention for q, which is however con venient here. the electronic journal of combin atorics 12 (2005), #R6 3 A case of particular interest is when the model is defined on a square n×n grid, with so-called domain wall boundary conditions (DWBC), namely with horizontal external edges pointing inwards and vertical external edges pointing outwards. Moreover, we consider the fully inhomogeneous case where we pick n arbitrary horizontal spectral parameters, one for each row say z 1 , ,z n and n arbitrary vertical spectral parameters, one for each column say z n+1 , ,z 2n . The partition function Z n (z 1 , ,z 2n ) of this model was computed by Izergin [3] using earlier work of Korepin [4] and takes the form of a determinant (IK determinant), which is symmetric in the sets z 1 , ,z n and z n+1 , ,z 2n . It is a remarkable property, first discovered by Okada [5], that when q =e 2iπ/3 , the partition function is actually fully symmetric in the 2n horizontal and vertical spectral parameters z 1 ,z 2 , ,z 2n .It can be identified [6,5], up to a factor (−1) n(n−1)/2 (q −1 − q) n  2n i=1 z 1/2 i whichinthe present work we absorb in the normalization of the partition function, as the Schur function of the spectral parameters corresponding to the Young diagram Y n with two rows of length n − 1, two rows of length n − 2, , two rows of length 2 and two rows of length 1: Z n (z 1 , ,z 2n )=s Y n (z 1 , ,z 2n ) . (2.2) The study of the cubic root of unity case has been extremely fruitful [2,6], allowing for instance to find various generating functions for (refined) numbers of alternating sign matrices (ASM), in bijection with the 6V configurations with DWBC. In particular, when all parameters z i = 1, the various vertex weights are all equal and we recover simply the total number of such configurations 3 −n(n−1)/2 Z n (1, 1, ,1) = A n = n−1  i=0 (3i +1)! (n + i)! (2.3) while by taking z 1 =(1+qt)/(q + t), z 2 =(1+qu)/(q + u), and all other parameters to 1, one gets the doubly-refined ASM number generating function  q 2 (q + t)(q + u)  n−1 3 n(n−1)/2 Z n  1+qt q + t , 1+qu q + u , 1 ,1  = A n (t, u)= n  j=1 t j−1 u k−1 A n,j,k (2.4) where A n,j,k denotes the total number of n × n ASM with a 1 in position j on the top row (counted from left to right) and k on the bottom row counted from right to left). Many equivalent characterizations of the IK determinant are available. Here we will make use of the recursion relations obtained in [6] for the particular case q =e 2iπ/3 , to which we restrict ourselves from now on, namely that Z n (z 1 , ,z 2n )   z i+1 =qz i = 2n  j=1 j=i,i+1 (q 2 z i − z j ) Z n−1 (z 1 , ,z i−1 ,z i+2 , ,z 2n ) . (2.5) This recursion relation and the fact that Z n is a symmetric homogeneous polynomial in its 2n variables with degree ≤ n − 1 in each variable and total degree n(n − 1) are sufficient to completely fix Z n . the electronic journal of combin atorics 12 (2005), #R6 4 3. Inhomogeneous O(1) loop model 3.1. Model and transfer matrix We now turn to the O(1) loop model. It is defined on a semi-infinite cylinder of square lattice, with even perimeter 2n whose edge centers are labelled 1, 2, ,2n counterclockwise. The configurations of the model are obtained by picking any of the two possible face configurations or at each face of the lattice. We moreover associate respective probabilities t i and 1 − t i to these face configurations when they sit in the i-th row, corresponding to the top edge center labelled i. We see that the configurations of the model form either closed loops or open curves joining boundary points by pairs, without any intersection beteen curves. In fact, each configuration realizes a planar pairing of the boundary points via a link pattern, namely a diagram in which 2n labelled and regularly spaced points of a circle are connected by pairs via non-intersecting straight segments.Note that one does not pay attention to which way the loops wind around the cylinder, so that the semi-infinite cylinder should really be thought of as a disk (by adding the point at infinity). The set of link patterns over 2n points is denoted by LP n , and its cardinality is c n =(2n)!/(n!(n + 1)!). We may also view π ∈ LP n as an involutive planar permutation of the symmetric group S 2n with only cycles of length 2. We may now ask what is the probability P n (t 1 , ,t 2n |π) in random configurations of the model that the boundary points be pair-connected according to a given link pattern π ∈ LP n . Forming the vector P n (t 1 , ,t 2n )={P n (t 1 , ,t 2n |π)} π∈LP n ,we immediately see that it satisfies the eigenvector condition T n (t 1 , ,t 2n )P n (t 1 , ,t 2n )=P n (t 1 , ,t 2n )(3.1) where the transfer matrix T n expresses the addition of an extra row to the semi-infinite cylinder, namely T n (t 1 , ,t 2n )= 2n  i=1  t i +(1− t i )  (3.2) with periodic boundary conditions around the cylinder. Let us parameterize our probabilities via t i = qz i −t qt−z i ,1− t i = q 2 (z i −t) qt−z i ,wherewe recall that q =e 2iπ/3 . Note that for z i = t e −iθ i , θ i ∈]0, 2π/3[, the weights satisfy 0 < t i < 1 and one can easily check that T n satisfies the hypotheses of the Perron–Frobenius theorem, P n being the Perron–Frobenius eigenvector. In particular, the corresponding eigenvalue (1) is non-degenerate for such values of the z i . Let us also introduce the R-matrix R(z, w)= z w = qz− w qw− z + q 2 (z − w) qw− z . (3.3) We shall often need a “dual” graphical depiction, in which the R-matrix corresponds to the crossing of two oriented lines, where the left (resp. right) incoming line carries the parameter z (resp. w). the electronic journal of combin atorics 12 (2005), #R6 5 z 1 z 2 z 2n . . . t Fig. 1: Transfer matrix as a product of R-matrices. Then, denoting by the index 0 an auxiliary space (propagating horizontally on the cylinder), and i the i-th vertical space, we can rewrite (3.2) into the purely symbolic expression (see Fig. 1) T n ≡ T n (t|z 1 , ,z 2n )=Tr 0 (R 2n,0 (z 2n ,t) ···R 1,0 (z 1 ,t)) (3.4) where the order of the matrices corresponds to following around the auxiliary line, and the trace represents closure of the auxiliary line. To avoid any possible confusion, we note that if one “unrolls” the transfer matrix of Fig. 1 so that the vertices are numbered in increasing order from left to right (with periodic boundary conditions), then the flow of time is downwards (i.e. the semi-infinite cylinder is infinite in the “up” direction). 3.2. Groundstate vector: empirical observations Solving the above eigenvector condition (3.1) numerically (see appendix A for the explicit values of n = 2, 3), we have observed the following properties. (i) when normalized by a suitable overall multiplicative factor α n , the entries of the probability vector Ψ n ≡ α n P n are homogeneous polynomials in the variables z 1 , ,z 2n , independent of t, with degree ≤ n − 1 in each variable and total degree n(n − 1). (ii) The factor α n may be chosen so that, in addition to property (i), the sum of entries of Ψ n be exactly equal to the partition function Z n (z 1 , ,z 2n ) of Sect. 2 above. (iii) With the choice of normalization of property (ii), the entries Ψ n,π of Ψ n are such that the symmetrized sum of monomials  σ∈S n n  k=1 (z i k z j k ) σ(k)−1 (3.5) where π =(i 1 j 1 ) ···(i n j n ), occurs with coefficient 1 in Ψ n,π , and does not occur in any Ψ n,π  , π  = π. the electronic journal of combin atorics 12 (2005), #R6 6 1 z 2 z 2n z t i,j t T T ’ j i Fig. 2: The transfer matrix T commutes with that, T  , of the tilted n- dislocation O(1) loop model on a semi-infinite cylinder. The transfer ma- trix of the latter is made of n rows of tilted face operators, followed by a global rotation of one half-turn. Each face receives the probability t i,j given by Eq. (3.6) at the intersection of the diagonal lines i and j, carrying the spectral parameters z i and z j respectively as indicated. The commuta- tion between T and T  (free sliding of the black horizontal line on the blue and red ones across all of their mutual intersections) is readily obtained by repeated application of the Yang–Baxter equation. Note that the entries of Ψ n are not symmetric polynomials of the z i , as opposed to their sum. The entries Ψ n,π thus form a new family of non-symmetric polynomials, based on a monomial germ only depending on π ∈ LP n , according to the property (iii). The fact that the entries of Ψ n do not depend on t is due to the standard prop- erty of commutation of the transfer matrices (3.4) at two distinct values of t, itself a direct consequence of the Yang–Baxter equation. It is also possible to make the contact between the present model and a multi-parameter version of the O(1) loop model on a semi-infinite cylinder with maximum number of dislocations introduced in [12]. In the latter, we simply tilt the square lattice by 45 ◦ , but keep the cylinder vertical. This results in a zig-zag shaped boundary, with 2n edges still labelled 1, 2, ,2n counter- clockwise, with say 1 in the middle of an ascending edge (see Fig.2). The two (tilted) face configurations of the O(1) loop model are still drawn randomly with inhomoge- neous probabilities t i,j for all the faces lying at the intersection of the diagonal lines issued from the points i (i odd) and j (j even) of the boundary (these diagonal lines are the electronic journal of combin atorics 12 (2005), #R6 7 wrapped around the cylinder and cross infinitely many times). If we now parametrize t i,j ≡ t(z i ,z j )= qz i − z j qz j − z i (3.6) we see immediately that the transfer matrix of this model commutes with that of ours, as a direct consequence of the Yang–Baxter equation = . As no reference to t is made in the latter model, we see that Ψ n must be independent of t. The tilted version of the vertex weight operator is usually understood as acting vertically on the tensor product of left and right spaces say i, i + 1, and reads ˇ R i,i+1 (z, w)= w z = t(z, w) +  1 − t(z, w)  = t(z, w)I +  1 − t(z, w)  e i (3.7) where t(z, w)isasin(3.6),ande i is the Temperley–Lieb algebra generator that acts on any link pattern π by gluing the curves that reach the points i and i + 1, and inserting a “little arch” that connects the points i and i + 1. Formally, one has ˇ R = PR where P is the operator that permutes the factors of the tensor product. In the next sections, we shall set up a general framework to prove these empirical observations. 3.3. Main properties and lemmas For the sake of simplicity, we rewrite the main eigenvector equation (3.1) in a form manifestly polynomial in the z i and t, by multiplying it by all the denominators qt− z i , i =1, 2, ,2n. By a slight abuse of notation, we still denote by R and ˇ R = PR all the vertex weight operators in which the denominators have been suppressed: R(z, w)= z w =(qz− w) + q 2 (z − w) . (3.8) In these notations, we now have the main equation  T n (t|z 1 , ,z 2n ) − 2n  i=1 (qt− z i )I  Ψ n (z 1 , ,z 2n )=0 (3.9) where T n is still given by Eq. (3.4) but with R as in (3.8). As mentioned before, for certain ranges of parameters Eq. (3.9) is a Perron–Frobenius eigenvector equation, in which case Ψ n is uniquely defined up to normalization. We conclude that the locus of degeneracies of the eigenvalue is of codimension greater than zero and that Ψ n is gener- ically well-defined. We may always choose the overall normalization of the eigenvector to ensure that it is a homogeneous polynomial of all the z i (the entries Ψ n,π of Ψ n are proportional to minors of the matrix that annihilates Ψ n , and therefore homogeneous the electronic journal of combin atorics 12 (2005), #R6 8 polynomials). We may further assume that all the components of Ψ n are coprime, upon dividing out by their GCD. There remains an arbitrary numerical constant in the normalization of Ψ n , which will be fixed later. Note finally that, using cyclic covariance of the problem under rotation around the cylinder, one can easily show that Ψ n,π (z 1 ,z 2 , ,z 2n−1 ,z 2n )=Ψ n,rπ (z 2n ,z 1 , ,z 2n−2 ,z 2n−1 )(3.10) where r is the cyclic shift by one unit on the point labels of the link patterns (rπ(i+1) = π(i) + 1 with the convention that 2n +1≡ 1). Our main tools will be the following three equations. First, the Yang–Baxter equa- tion: t z w = z w t (3.11) is insensitive to the above redefinitions. The unitarity condition, however, is inhomoge- neous: w z =(qz− w)(qw− z) z w (3.12) so that for example, ˇ R i,i+1 (z, w) ˇ R i,i+1 (w, z)=(qz− w)(qw− z)I. Finally, note the crossing relation: w z = −q w q z (3.13) In some figures below, orientation of lines will be omitted when it is unambiguous. We now formulate the following fundamental lemmas: Lemma 1. The transfer matrices T n (t|z 1 , ,z i ,z i+1 , ,z 2n ) and T n (t|z 1 , ,z i+1 , z i , ,z 2n ) are interlaced by ˇ R i,i+1 (z i ,z i+1 ),namely: T n (t|z 1 , ,z i ,z i+1 , ,z 2n ) ˇ R i,i+1 (z i ,z i+1 ) = ˇ R i,i+1 (z i ,z i+1 )T n (t|z 1 , ,z i+1 ,z i , ,z 2n )(3.14) This is readily proved by a simple application of the Yang–Baxter equation: z i+1 z i z i z i+1 = the electronic journal of combin atorics 12 (2005), #R6 9 To prepare the ground for recursion relations, we note that the space of link patterns LP n−1 is trivially embedded into LP n by simply adding a little arch say between the points i − 1andi in π ∈ LP n−1 , and then relabelling j → j +2 the points j = i, i +1, ,2n − 2. Let us denote by ϕ i the induced embedding of vector spaces. In the augmented link pattern ϕ i π ∈ LP n , the additional little arch connects the points i and i +1. Wenowhave: Lemma 2. If two neighboring parameters z i and z i+1 are such that z i+1 = qz i ,then T n (t|z 1 , ,z i ,z i+1 = qz i , ,z 2n ) ϕ i =(qt− z i )(qt− qz i ) ϕ i T n−1 (t|z 1 , ,z i−1 ,z i+2 ,z 2n )(3.15) The lemma is a direct consequence of unitarity and inversion relations (Eqs. (3.12)– (3.13)). It is however instructive to prove it “by hand”. We let the transfer matrix T n (t|z 1 , ,z 2n ) act on a link pattern π ∈ LP n with a little arch joining i and i+1. Let us examine how T n locally acts on this arch, namely via R i+1,0 (qz i ,t)R i,0 (z i ,t). We have i i+1 = v i u i+1 + v i v i+1 + u i u i+1 + u i v i+1 with u i = qz i − t and v i = q 2 (z i − t). The last three terms contribute to the same diagram, as the loop may be safely erased (weight 1), and the total prefactor u i u i+1 + v i v i+1 +u i v i+1 = 0 precisely at z i+1 = qz i . We are simply left with the first contribution in which the little arch has gone across the horizontal line, while producing a factor v i u i+1 = q 2 (z i − t)(q 2 z i − t)=(qt− z i )(qt− qz i )asq 3 = 1. In the process, the transfer matrix has lost the two spaces i and i + 1, and naturally acts on LP n−1 , while the addition of the little arch corresponds to the operator ϕ i . 3.4. Recursion and factorization of the groundstate vector We are now ready to translate the lemmas 1 and 2 into recursion relations for the entries of Ψ n . For a given pattern π, define E π to be the partition of {1, ,2n} into sequences of consecutive points not separated by little arches (see Fig. 3). We order cyclically each sequence s ∈ E π . Theorem 1. The entries Ψ n,π of the groundstate eigenvector satisfy: Ψ n,π (z 1 , ,z 2n )=   s∈E π  i,j∈s i<j (qz i − z j )  Φ n,π (z 1 , ,z 2n )(3.16) where Φ n,π is a polynomial which is symmetric in the set of variables {z i ,i∈ s} for each s ∈ E π . We start the proof with the case of two consecutive points i, i + 1 within the same sequence s in a given π ∈ LP n , i.e. not connected by a little arch. We use Lemma 1, in the electronic journal of combin atorics 12 (2005), #R6 10 [...]... as the partial degree property forbids distinct degrees for zik and zjk Applying iteratively Theorem 6 leads us to the evaluation of a certain diagram naturally associated to the ik and jk If we further assume that ik = π(jk ), k = 1, 2, , n for some (planar) link pattern π, then the diagram can be transformed by use of Yang–Baxter and unitarity equations to the link pattern π, and the weight of. .. the eigenvector Pn of Eq (3.1) (up to multiplication by a scalar) Let us now examine the dependence of the coefficients of Pn as (rational) functions of the zi Noting that the coefficients of the change of basis from the arches to the spin up/spin down are constants and in particular independent of the zi , we define the degree of a vector-valued polynomial (in any given set of variables) to be the (maximum)... unit These are necessary to ensure the cyclic covariance of these partial sums, eventually identified with the corresponding sums of partition functions in the 6V DWBC model, that connect the external bonds according to π or any of its cyclically rotated versions This shows in the simplest case that multi-parameter generalizations of the full Razumov–Stroganov conjecture, if any exist, must be subtle The. .. (B.5) and identifying e with the usual Temperley–Lieb generator, we see that the R-matrix reproduces, up to a factor of −q 2 , the R-matrix introduced in the text (cf Eq (3.8)) It can then be easily shown that Tn leaves the subspace generated by the π stable, and that via the embedding above its restriction is exactly q −4n times our transfer matrix (3.2) The Algebraic Bethe Ansatz is the following Ansatz... when all the parameters zj = 1, which is simply a numerical constant compared to the normalization 1 picked in earlier papers [8,7] Futhermore, we deduce: Theorem 4 The components of Ψn are homogeneous polynomials of total degree n(n − 1), and of partial degree at most n − 1 in each variable zi The total degree has already been proved, since all components are homogeneous of the same degree and Ψn,π0... [5] S Okada, Enumeration of Symmetry Classes of Alternating Sign Matrices and Characters of Classical Groups, math.CO/0408234 [6] Yu.G Stroganov, A new way to deal with Izergin–Korepin determinant at root of unity, math-ph/0204042, and Izergin–Korepin determinant reloaded, mathph/0409072 [7] A. V Razumov and Yu.G Stroganov, Combinatorial nature of ground state vector of O(1) loop model, Theor Math Phys... little arches The application of recursion relations (Theorems 3 and 6) to the actual computation of components will be described in more detail in future work 3.5 Applications An immediate corollary of Theorem 5 obtained by taking the homogeneous limit where all the zj = 1 proves the conjecture that concerns the sum of entries of Ψn [8], namely that 3−n(n−1)/2 Zn (1, 1, , 1) = An is the sum of all... )Ψ2, (A. 3) 1 2 which is nothing but Eq (3.24) for i = 5 Appendix B Algebraic Bethe Ansatz and upper bound on the degree of Ψn In this appendix we construct the eigenvector Pn using the Algebraic Bethe Ansatz As a corollary, we show that with a proper normalization, its components Ψn,π are polynomials of the inhomogeneities zi of total degree less or equal to 2n3 To introduce the Algebraic Bethe Ansatz,... as a sum of products of e’s and I’s with polynomial coefficients of the zi , we find that ˇ because one of the R terms is proportional to ei , all the link patterns contributing to the image of Pi,k have at least one little arch in between the points i and i + k (either at the first place j ≤ i + k, j > i, where a term ej is picked in the above expansion, or at the place i, with ei , if only terms I have... spectral parameters zi and zi+1 are related by zi+1 = q zi What happens when zj = q zi for arbitrary locations i and j? Of course, it does not make any difference for the sum of components since it is a symmetric function of all parameters The components themselves, however, are not symmetric But lemma 1 allows us, as we have already done many times, to permute parameters The most general recursion obtained . separated by arbitrarily many 0’s, and such that row and column sums are all 1, have attracted much attention over the years and seem to be a Leitmotiv of modern combinatorics, hidden in many apparently unrelated. degrees for z i k and z j k . Applying itera- tively Theorem 6 leads us to the evaluation of a certain diagram naturally associated to the i k and j k . If we further assume that i k = π(j k ),. ,nfor some (planar) link pattern π, then the diagram can be transformed by use of Yang–Baxter and unitarity equations to the link pattern π, and the weight of the monomial is easily computed