Boundary matrices for the higher spin six vertex model
Vladimir V. Mangazeev, Xilin Lu

TL;DR
This paper derives explicit formulas for boundary K-matrices in the higher spin six vertex model, generalizing known cases and providing solutions for arbitrary spin using hypergeometric functions.
Contribution
It introduces a method to compute boundary K-matrices for any spin in the higher spin six vertex model, expanding beyond known low-spin solutions.
Findings
Explicit formulas for K-matrices for arbitrary spin s.
Solutions expressed in terms of hypergeometric functions.
Simplifications occur for triangular K-matrices, reducing to q-Pochhammer symbols.
Abstract
In this paper we consider solutions to the reflection equation related to the higher spin stochastic six vertex model. The corresponding higher spin -matrix is associated with the affine quantum algebra . The explicit formulas for boundary -matrices for spins are well known. We derive difference equations for the generating function of matrix elements of the -matrix for any spin and solve them in terms of hypergeometric functions. As a result we derive the explicit formula for matrix elements of the -matrix for arbitrary spin. In the lower- and upper- triangular cases, the -matrix simplifies and reduces to simple products of -Pochhammer symbols.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Boundary matrices for the higher spin six vertex model
Vladimir V. Mangazeev1 and Xilin Lu1
Abstract
In this paper we consider solutions to the reflection equation related to the higher spin stochastic six vertex model. The corresponding higher spin -matrix is associated with the affine quantum algebra . The explicit formulas for boundary -matrices for spins are well known. We derive difference equations for the generating function of matrix elements of the -matrix for any spin and solve them in terms of hypergeometric functions. As a result we derive the explicit formula for matrix elements of the -matrix for arbitrary spin. In the lower- and upper- triangular cases, the -matrix simplifies and reduces to simple products of -Pochhammer symbols.
1*Department of Theoretical Physics, Research School of Physics and Engineering,
Australian National University, Canberra, ACT 0200, Australia.
1 Introduction
In the last two decades years there was a significant growth of interest in applications of quantum integrable systems to KPZ universality [1], stochastic processes and non-equilibrium statistical mechanics [2, 3, 4]. The asymmetric simple exclusion process (ASEP) [5] is one of the most studied examples, both on a line and with open boundary conditions (see, for example, [6, 7, 8, 9]). It is intimately connected to the higher spin stochastic six vertex model which has been studied on a quadrant or a semi-infinite line with simple open boundary conditions [10, 11, 12]. The -matrix of the higher spin six vertex model is related to the higher weight representations of the algebra and the explicit formula was derived in [13].
One of the main approaches to quantum integrable systems with general open boundary conditions is Sklyanin’s method [14]. This method relies on solutions of the reflection equation [15, 14]. In principle, solutions of the reflection equation for higher spins can be obtained using the fusion procedure [16, 17] but such formulas are not explicit and quite complicated.
In this paper we attempt to find a general explicit expression for reflection matrices for the higher spin six vertex model in a stochastic gauge. Starting with the four-parametric solution of the reflection equation for the spin [18], we get explicit formulas for matrix elements of the -matrix for any higher spin.
The paper is organized as follows. In Section 2 we review the theory of reflection equations and the construction of commuting transfer-matrices with open boundary conditions. We also slightly generalize it to include models with -matrices lacking a difference property. In Section 3 we review the construction of the -matrix for the higher spin six vertex model and its factorization properties. In Section 4 we derive the recurrence relations for matrix elements of the higher spin -matrices. In Section 5 we solve these recurrence relations in special low- and upper- triangular cases. In Section 6 we introduce equations for the generating function of the matrix elements of the -matrix in a non-degenerate case. In Section 7 we solve these equations and find a solution for the generating function in terms of the terminating balanced series. We also obtain the explicit formula for matrix elements in the form of a double sum. Finally, in Conclusion we discuss the obtained results and outline directions for further research.
2 Reflection equation and commuting transfer-matrices
Reflection equation [15, 14] plays a fundamental role in constructing quantum integrable systems with open boundary conditions. For a given solution of the Yang-Baxter equation
[TABLE]
the reflection equation has the following form
[TABLE]
Here we assume that the -matrix is a linear operator acting nontrivially in the tensor product of vector spaces and acts nontrivially in , . In general, the -matrix does not have a difference property and the variables , are the “reflected” spectral parameters. For trigonometric -matrices we have
[TABLE]
and .
If the -matrix is regular, i.e.
[TABLE]
with being a permutation operator, then also satisfies the unitarity condition
[TABLE]
Using the -matrix and the boundary matrix we can construct a double row monodromy matrix acting in the tensor product
[TABLE]
with being the auxiliary space.
It is easy to show that as a consequence of (2.1-2.2) the double row monodromy matrix satisfies the relation
[TABLE]
Let us assume that is non-degenerate and define a linear operator [19]
[TABLE]
which implies
[TABLE]
We define the dual reflection equation by
[TABLE]
For a given solution of (2.10) and the monodromy matrix (2.6) we define a double row transfer matrix as
[TABLE]
Then double row transfer matrices (2.11) commute
[TABLE]
We notice that we do not require the crossing unitarity of the -matrix, only the existence of and .
The proof goes as follows
[TABLE]
where we used (2.5), (2.9) and the fact that for any matrix operators and .
Now using (2.7) and (2.10) we transform (2.13) to
[TABLE]
i.e. we showed a commutativity of two transfer-matrices (2.12).
If the -matrix satisfies the difference property (2.3) and the crossing unitarity condition
[TABLE]
for some and a constant matrix , then exists and is given by
[TABLE]
In general, (2.15) is a stronger condition than (2.8) even for -matrices with a difference property [19].
Using (2.16) we can map the dual reflection equation (2.10) to (2.2). If the matrix satisfies the property
[TABLE]
then we have a solution to (2.10)
[TABLE]
Notice that (2.18) can be used to construct solutions of (2.10) from any solution of (2.2) provided that is given by (2.16). There are other automorphisms between solutions of the reflection equation and its dual [14] but we will not consider them here.
3 The higher spin six vertex model
In this section we start with explicit formulas for the higher-spin -matrix related to the algebra following [13, 20].
For arbitrary complex weights we define a linear operator by its action on the basis , of
[TABLE]
where matrix elements are given by the following expression [20]
[TABLE]
Here we used standard notations for -Pochhammer symbol, -binomial coefficients and the basic hypergeometric function (see Appendix A).
The -matrix (3.2) satisfies the Yang-Baxter equation (2.1) with three arbitrary weights associated with . Let us notice that an apparent singularity coming from for in (3.2) never happens, since the sum terminates earlier either at or due to a conservation law . Therefore, the hypergeometric function in (3.2) does not require a regularization. The representation (3.2) is equivalent to (5.8) from [13] after a Sears’ transformation (A.11).
From now on we will assume that weights and are positive integers and the -matrix acts in the tensor product , where is a finite-dimensional module with the basis , . Therefore, we will be looking at finite-dimensional solutions of the Yang-Baxter and reflection equation unless explicitly stated otherwise.
The reason for this is that the Sklyanin approach to integrable systems with open boundaries [14] relies on the crossing relation. As shown in the previous section this can be relaxed to the existence of the operator in (2.8). A sufficient condition for the operator to exist is the crossing symmetry of the -matrix (or a weaker condition of the crossing unitarity).
To our knowledge the crossing symmetry for the -matrix (3.2) is only known when . To write it down it is convenient to define a symmetric version of (3.2)
[TABLE]
In particular, with is proportional to the -matrix of the symmetric 6-vertex model.
Let us use the standard notation for (3.3) and assume that the first and the second spaces correspond to representations with weights and , respectively.
Then we have two relations
[TABLE]
and
[TABLE]
with
[TABLE]
The relation (3.4) was proved in [13]. The second relation (3.5) with can be proved by using Sears’ transformation (A.11). It is done in three steps. First we apply to the RHS of (3.5) the transformation (A.11) with and the following choice of parameters , , , , , and . Second, we use relation (3.4) to interchange and and all indices between the first and the second spaces. The result coincides with (5.8) from [13] up to a certain factor. Applying Sears’ transformation again we come to the LHS of (3.5).
We can rewrite the relation (3.5) as a crossing relation
[TABLE]
where is a matrix with matrix elements
[TABLE]
As an immediate consequence of (3.7) and the inversion relation
[TABLE]
we have a crossing unitarity relation
[TABLE]
where
[TABLE]
The easiest way to see that the inversion factor in (3.9) is equal to is to rewrite it in terms of the stochastic -matrix (3.12) and use the relation (3.17) below.
Following [21, 20] we introduce a stochastic version of the higher-spin six-vertex model with the -matrix
[TABLE]
Using the conservation laws for all -matrices in (2.1) one can easily show that the twist in (3.12) does not affect the Yang-Baxter equation
Let us define the following function
[TABLE]
This function was introduced in [21] for an arbitrary rank of the algebra. Here we only consider the case .
The stochastic R-matrix (3.12) admits the following factorization [20] in terms of functions:
[TABLE]
The -matrix (3.14) satisfies the stochasticity condition [21, 20]
[TABLE]
The proof immediately follows from the identity
[TABLE]
which we apply twice to (3.14).
Let us notice that the inversion relation for
[TABLE]
follows from the Yang-Baxter equation and (3.15).
It is easy to see that the crossing unitarity relation (3.10) for the stochastic -matrix takes the following form
[TABLE]
where
[TABLE]
One can ask whether the relation (3.18) can be generalized to arbitrary , since the -matrix (3.14) is well defined in this case [21]. The answer is apparently negative. If we substitute (3.14) directly into (3.18), we get a triple sum, with two summations coming from (3.14) and a single sum coming from the summation over matrix indices in (3.18). After straightforward calculations one can see that this last sum is given again by a balanced series which terminates when either or is a positive integer. Then we can use Sears’ transformations to prove (3.18) directly. When both , no transformation between two non-terminating series exists. A simple numerical check shows that (3.18) does not hold in this case. However, the operator (2.8) may still exist and can be used to define the dual reflection equation.
Finally we notice that there are several choices of the spectral parameter , when the -matrix simplifies to a factorized form. First, it is easy to check two properties of the function
[TABLE]
Substituting and we obtain
[TABLE]
[TABLE]
[TABLE]
The reduction (3.21) was first noticed in [22] and then generalized to the higher rank case in [21]. The weights and can take complex values and play the role of spectral parameters. This case corresponds to the Povolotsky model [23].
Note that is no longer invertible in (3.21-3.22) and we can not define the dual reflection equation. This is similar to the TASEP model where we can still define integrable boundary conditions for TASEP as a limit from the more general ASEP model [24].
4 Recurrence relations for -matrices
We are interested in finding a general solution of the reflection equation (2.2) with the -matrix (3.12) for arbitrary higher weights.
The reflection equation (2.2) takes the form
[TABLE]
We are only interested in non-diagonal solutions of (4.1), since any diagonal -matrix satisfying (4.4) below will be proportional to the identity matrix.
It is well known that for the case of the equation (4.1) admits a 4-parametric solution of matrix [18]. In addition, compatibility conditions of (4.1) lead to the following restriction
[TABLE]
A general non-diagonal solution for has the following form
[TABLE]
where are arbitrary complex parameters. This parametrization of naturally appears from solving equations for , below.
A stochasticity condition for
[TABLE]
has two solutions and . It is easy to see that these two solutions are equivalent up to a reparametrization of the remaining parameters . It is convenient to choose a solution
[TABLE]
Later on we will see that the -matrix depends on the parameter in a simple way and one can set without loss of generality.
Let us notice that the stochastic -matrix (2.25) with parameters from [24] is obtained from (4.3) by a specialization
[TABLE]
Now we substitute into the reflection equation (4.1) and obtain
[TABLE]
This is a linear system of recurrence relations for the matrix with arbitrary . Moreover, we can keep as a complex parameter, since -operators and are well defined even for .
In principle, its solution for integer is known and given by the fusion procedure [16, 17]. However, we are interested in finding explicit formulas for matrix elements of or their generating function.
Whether the solution of (4.7) will satisfy (4.1) with both is not clear. Most likely the answer is negative because the equation (4.1) contains a double sum which is terminated either by or . If this double sum is infinite we can not use hypergeometric identities similar to Sears’ transformations. We have already seen this phenomenon with the crossing unitarity relation.
We note that a situation with the Yang-Baxter equation is different. Due to the conservation law in (3.2) internal sums in the Yang-Baxter equation are terminated by external indices. This is the reason why the solution (3.2) can be analytically continued to complex and [21].
To find equations for in (4.7) we need to derive formulas for the -operators and . Specifying and in (3.2) and using (3.12) one can obtain after straightforward calculations
[TABLE]
where all indices (or for integer ) and we used a notation
[TABLE]
Substituting (4.3, 4.11-4.15) into (4.7) we obtain a set of equations polynomial in . Decoupling with respect to we get 12 recurrence relations for matrix elements . After some algebra one can see that only two of them are linearly independent
[TABLE]
[TABLE]
A detailed analysis of these relations for arbitrary complex shows that any solution contains two arbitrary parameters and and we can consistently choose
[TABLE]
For any we impose a terminating condition
[TABLE]
The condition (4.20) determines in terms of the normalization factor . Once (4.20) is satisfied, a simple analysis of (4.17-4.18) shows that
[TABLE]
Let us notice that, in general, for , i.e. there is no termination with respect to the index . However, (4.21) already ensures that all sums in (4.7) are finite for .
In particular, for we reproduce a solution (4.3) and for explicit formulas for the -matrix are given in Appendix B. For the untwisted -matrix (3.2) the corresponding -matrix was first obtained in [25].
Now we will show that the condition (4.4) with is compatible with (4.17-4.18) for any .
First, we introduce two quantities
[TABLE]
Summing up (4.18) over and taking (4.19) and (4.21) into account we can express in terms of and . Summing up (4.17) over and substituting we observe that a constant solution exists provided that or independent of .
Indeed, we solved (4.17-4.18) for and checked that up to an overall normalization the -matrix is stochastic at .
5 Special solutions of the reflection equation
In this section we first analyze lower- and upper- triangular solutions of the reflection equation. Let us notice that the defining relations (4.17-4.18) become trivial for diagonal -matrices. So we assume that either or is not equal to [math].
First we set . Then it is easy to see that a solution to (4.17-4.18) has an upper-triangular form and a simple analysis shows that
[TABLE]
The parameter becomes an overall factor in (4.17-4.18) and can be set to . The solution (5.1) is well defined even for . When , both indices run the values . Due to the property (3.16), the matrix (5.1) at is stochastic
[TABLE]
where the sum terminates at .
Similarly, if we set , then the solution of (4.17-4.18) has a lower-triangular form
[TABLE]
where is the normalization factor. All matrix elements in (5.3) become zero for , due to the factor . If we choose
[TABLE]
then we obtain by using the definition (3.13) of the function. Applying the -Vandermonde summation formula (A.7) it is easy to check that
[TABLE]
i.e. the matrix (5.3) is also stochastic for any .
From (5.1-5.3) we can construct upper- and lower- triangular solutions of the dual reflection equation using the mapping (2.18).
One can specify spectral parameters and in the reflection equation (4.1) such that all -matrices degenerate to a single function as in (3.21-3.23). This is achieved by setting
[TABLE]
Under this specialization the -matrices in (4.1) degenerate to different limits, i.e. (3.22), (3.23) in the LHS and (3.23), (3.21) in the RHS. In particular, the -matrix degenerates into (3.23) which is no longer invertible.
One can ask whether it is possible to start with the degenerate -matrix (3.21) without difference property
[TABLE]
and construct solutions to the reflection equation
[TABLE]
We found that the equation (5.8) admits the following upper-triangular solution
[TABLE]
where and parameters and in (5.8) are not constrained by (4.2) and remain free. The reflection equation (5.8) reduces to the 4th degree relation for functions
[TABLE]
where we dropped a subscript of the function , , and all summations are finite and restricted by external indices. Surprisingly (5.10) is very hard to prove. It reduces to some transformation of double generalized hypergeometric series which we failed to identify.
Moreover, this identity can be directly generalized to a higher rank by replacing the function with its version from [21] with all indices replaced by their -component analogs. We checked a generalization of (5.10) for and external indices and leave it as a conjecture.
6 A non-degenerate case
In this section we study the general off-diagonal -matrices when both parameters . First, we notice that any off-diagonal solution of (4.17-4.18) possesses a symmetry
[TABLE]
This can be established by substituting from the LHS of (6.1) to (4.17-4.18) and showing that the resulting recurrence relations are equivalent to original ones.
Using this fact let us define a new variable as
[TABLE]
and introduce matrices by
[TABLE]
It is easy to see from (6.1) that is symmetric
[TABLE]
Recursion relations (4.17-4.18) can be rewritten for
[TABLE]
[TABLE]
If we impose boundary conditions for any , then a solution to (6.5-6.6) will be symmetric in and depend on two initial conditions, say and . Moreover, will depend only on three parameters, , and and we will omit this dependence from now on.
Recently very similar equations for higher rank -matrices were derived using a special coideal algebra of [26]. The authors of [26] solved the analog of (6.5-6.6) using a matrix product of local operators acting in the auxiliary -oscillator algebra. This approach is inspired by a 3D structure of the -matrix (3.14) and was developed by several authors [27, 28, 29, 13, 30].
However, the equations for -matrices in [26] depend only on the spectral parameter with no free parameters similar to and above. It would be very interesting to understand whether their approach can be extended to find a matrix product solution of (6.5-6.6). Unfortunately, we failed to do this and developed an alternative approach using techniques coming from basic hypergeometric functions.
Let us introduce a generating function for matrix elements
[TABLE]
By (6.4) is symmetric
[TABLE]
From (6.5-6.6) we can derive a system of coupled -difference equations for
[TABLE]
[TABLE]
When we derive equations for generating functions from recurrence relations, one can expect extra boundary terms in difference equations corresponding to initial conditions in (6.7), see for example equation (4.4) in [31]. However, since recurrence relations for are consistent with terminating conditions for or , no boundary terms appear in (6.9-6.10). Expanding (6.9-6.10) in series in and one can check that coefficients for any solution of the form (6.7) will solve recurrence relations for .
We also note that a special choice of parameters in the -matrix (4.3) ensures that all coefficients in (6.9-6.10) factorize. This was the main reason for using such a parametrization.
7 Construction of the generating function
Instead of solving the system (6.9-6.10) in two variables we can exclude shifts in and derive a 2nd order difference equation in only. The result reads
[TABLE]
where for is defined in (4.16).
Our goal is to construct a solution to (7.1) which is a polynomial in of the degree for . Difference equations similar to (6.9-6.10) and (7.1) have been studied by several authors [32, 33, 34, 31]. Their general solution is given in terms of very well-poised non-terminating series. If series terminates, then due to Watson’s transformation formula (III.18) in [35] it can be transformed into a terminating balanced series. So for one can expect the answer in terms of series.
A realization of this program has several difficulties. First, the 2nd order difference equation for (see (2.1) in [33]) has the same structure as (7.1) but with all coefficients factorized. This is not the case for (7.1). However, this can be repaired in the following way. Let us assume that a solution to (7.1) has the form
[TABLE]
where solves the 2nd order equation in one variable with other parameters fixed (see (2.1) in [33]). We will not give this equation here because its explicit form is not important for further discussion. We also assume that satisfies the recurrence relation
[TABLE]
with being a rational function. We aim at finding which has a structure of a simple product of a ratio of linear factors. Then the function can be expressed in terms of -Pochhammer symbols.
Now we substitute (7.2) into (7.1) and use the equation for to exclude the term with . It results in the relation
[TABLE]
where are known factors. Since can not satisfy the first order difference equation, both terms in (7.4) should be identically zero. Solving these two relations with respect to and we get two compatibility conditions for the function . Further analysis shows that one can choose parameters of series in such a way that is completely factorized and is given by a product of -Pochhammer symbols. In this way one can find two linearly independent solutions which are symmetric in and solve (7.1).
The main difficulty of this general approach is that both solutions are nonterminating even for integer . We can form a linear combination
[TABLE]
and demand that is a polynomial in of the degree for . This terminating condition can be written in terms of series and is very complicated. Substituting this back to (7.5) we should obtain the desired polynomial solution but the level of technical difficulties is so extreme that we did not succeed in finding it in any reasonable form.
At least we can learn from the above calculations that a polynomial solution symmetric in and maybe expressible in terms of terminating very well-poised series, i.e. terminating balanced series. This is indeed the case as we will see below.
Let us start with the simpler case and construct . If we substitute into (7.1), we get a difference equation for
[TABLE]
In fact, it is easier to solve difference equations for coefficients themselves. Choosing in (6.5-6.6) and using we get
[TABLE]
where defined in (4.16). Excluding from (7.7) we get a three-term recurrence relation for
[TABLE]
This relation is similar to a recurrence relation for Al-Salam-Chihara polynomials [36] (see (14.8.4) in [37]) and admits a terminating solution with for in terms of series. Using a contiguous relation (A.12) it is not difficult to check that
[TABLE]
where is the normalization factor which we will fix later from the stochasticity condition (5.5).
The generating function is given by
[TABLE]
To calculate we first apply the transformation (A.8) to (7.9). The result reads
[TABLE]
Expanding into series in and substituting the result into (7.10) we can calculate the sum over using (A.6)
[TABLE]
As a result we get the following expression for
[TABLE]
Applying the transformation (A.9) with and
[TABLE]
we bring back to the polynomial in
[TABLE]
Finally applying (A.10) we obtain
[TABLE]
The purpose of these calculations is to show how we arrived at (7.16). Using contiguous relations for [31] one can show that (7.16) indeed satisfies (7.6). However, it is almost impossible to guess this formula from contiguous relations for .
Having the result (7.16) one can try to generalize it to the full generating function . We expect it to be a terminating balanced series symmetric in and . The only possible candidate which reduces to at is
[TABLE]
with
[TABLE]
Remarkably this is the answer. It solves both difference equations (6.9-6.10) which are equivalent to contiguous relations (A.13-A.14) from Appendix A.
We also need to calculate the normalization factor . At we have from (5.5) and (6.3)
[TABLE]
where we used (A.6). Therefore, a correct normalization of the generating function is given by
[TABLE]
Now we note that a pre-factor in (7.17) has a zero at and only the last term with in the series expansion of has a pole. Therefore, only this last term survives in the limit
[TABLE]
Comparing the result with (7.20) we obtain
[TABLE]
This is the correct stochastic normalization of the generating function (7.17).
To calculate matrix elements we need to expand the generating function (7.17) back into series in and . We can do this using the identity
[TABLE]
Expanding into series in , using (7.22-7.23) together with (A.7) and replacing , we can calculate a matrix element as a double sum
[TABLE]
In Appendix B we give explicit formulas for with . The -matrix is now obtained from (6.3). It automatically satisfies the stochasticity condition (5.5).
8 Conclusion
In this paper we considered the problem of finding a general explicit solution for the reflection equation related to the higher spin representations of the stochastic six vertex model. We found a set of recurrence relations for matrix elements of the -matrix and solved them explicitly in lower- and up- triangular cases. In the general case we expressed the generating function for matrix elements in terms of the terminating balanced series. By expanding it we obtained the expression for matrix elements of the -matrix in the form of a double sum (7.24). It would be interesting to understand whether this formula can be rewritten in the form of a single sum, i.e. some basic hypergeometric function.
Here we did not address the problem of positivity of matrix elements of the -matrix. However, for the case it is well known that all elements of the -matrix and -matrix can be chosen in a positive regime. Since the higher spin - and -matrices can be built with fusion from elementary ones, we expect that positivity holds for any .
Another interesting problem is a connection of our results with a 3D approach [27, 28, 29, 13, 30]. In [26] a matrix product solution to the reflection equation associated with a certain coideal subalgebra of was constructed. Their defining equations for are very similar to our (6.5-6.6) but do not have any free parameters except the spectral one. It is an important question whether it is possible to find a matrix product solution to (6.5-6.6) with arbitrary and equivalent to (7.24). If the answer is positive, then a generalization to higher ranks should be possible111After submitting this work A. Kuniba informed us that their defining equations of the -matrix at in [26] allow a generalization which is equivalent to (6.5-6.6) after a certain transformation. However, a matrix product solution for this more general case is not known.. We plan to address these questions in the next publication.
Acknowledgments
We would like to thank Vladimir Bazhanov, Ivan Corwin, Jan De Gier, Ole Warnaar and Michael Wheeler for their interest to this work and useful discussions. V.M. would also like to thank Eric Rains for his advice on the system (6.9-6.10) during Rainsfest in Brisbane in October 2018, Ole Warnaar for his advice on the identity (5.10) and Atsuo Kuniba for sending their work [26] and comments on the system (6.5-6.6). This work was supported by the Australian Research Council, grant DP180101040.
Appendix A
Here we list standard definitions in -series which we need in the main text
[TABLE]
[TABLE]
[TABLE]
We define a basic hypergeometric series by
[TABLE]
We also need several summation formulas and transformations of such series which we list below. Before each transformation we give its number in [35].
The -binomial theorem (II.3)
[TABLE]
the -Vandermonde sum (II.6)
[TABLE]
Heine’s transformation (III.2)
[TABLE]
transformations of series (III.9) and (III.13)
[TABLE]
[TABLE]
Sears’s transformation (III.16) for terminating balanced series
[TABLE]
provided that .
The function satisfies the following contiguous relation
[TABLE]
where we used the standard notation , etc and dropped arguments of the function which do not change. This is a direct consequence of Heine’s contiguous relations (p.425 in [38]).
The terminating balanced series defined in the LHS of (A.11) satisfies
[TABLE]
[TABLE]
Relations (A.13-A.14) can be proved by specializing contiguous relations for very well-poised series [32] to the terminating case.
Appendix B
In this appendix we will give explicit formulas for the matrix , for .
Since the matrix is symmetric, we give only the upper-triangular elements. The normalization is chosen in such a way that the -matrix given by (6.3) satisfies stochasticity condition (5.5) at . For
[TABLE]
and for
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Kardar, G. Parisi, and Y.-C. Zhang, “Dynamic scaling of growing interfaces,” Phys. Rev. Lett. 56 (Mar, 1986) 889–892.
- 2[2] B. Derrida, “An exactly soluble non-equilibrium system: the asymmetric simple exclusion process,” Phys. Rep. 301 no. 1-3, (1998) 65–83. Fundamental problems in statistical mechanics (Altenberg, 1997).
- 3[3] I. Corwin, “The Kardar-Parisi-Zhang equation and universality class,” Random Matrices Theory Appl. 1 no. 1, (2012) 1130001, 76.
- 4[4] A. Borodin and L. Petrov, “Integrable probability: stochastic vertex models and symmetric functions,” in Stochastic processes and random matrices , pp. 26–131. Oxford Univ. Press, Oxford, 2017.
- 5[5] F. Spitzer, “Interaction of Markov processes,” Advances in Mathematics 5 (1970) 246 – 290.
- 6[6] B. Derrida, M. R. Evans, V. Hakim, and V. Pasquier, “Exact solution of a 1 1 1 D asymmetric exclusion model using a matrix formulation,” J. Phys. A 26 no. 7, (1993) 1493–1517.
- 7[7] T. Sasamoto, “One-dimensional partially asymmetric simple exclusion process with open boundaries: orthogonal polynomials approach,” J. Phys. A 32 no. 41, (1999) 7109–7131.
- 8[8] J. de Gier and F. H. L. Essler, “Bethe ansatz solution of the asymmetric exclusion process with open boundaries,” Phys. Rev. Lett. 95 no. 24, (2005) 240601, 4p.
