Geometric RSK correspondence, Whittaker functions and symmetrized random polymers

We show that the geometric lifting of the RSK correspondence introduced by A.N. Kirillov (Physics and Combinatorics. Proc. Nagoya 2000 2nd Internat Workshop, pp. 82–150, 2001) is volume preserving with respect to a natural product measure on its domain, and that the integrand in Givental’s integral formula for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathit{GL}(n,{\mathbb{R}})$\end{document}-Whittaker functions arises naturally in this context. Apart from providing further evidence that Whittaker functions are the natural analogue of Schur polynomials in this setting, our results also provide a new ‘combinatorial’ framework for the study of random polymers. When the input matrix consists of random inverse gamma distributed weights, the probability distribution of a polymer partition function constructed from these weights can be written down explicitly in terms of Whittaker functions. Next we restrict the geometric RSK mapping to symmetric matrices and show that the volume preserving property continues to hold. We determine the probability law of the polymer partition function with inverse gamma weights that are constrained to be symmetric about the main diagonal, with an additional factor on the main diagonal. The third combinatorial mapping studied is a variant of the geometric RSK mapping for triangular arrays, which is again showed to be volume preserving. This leads to a formula for the probability distribution of a polymer model whose paths are constrained to stay below the diagonal. We also show that the analogues of the Cauchy-Littlewood identity in the setting of this paper are equivalent to a collection of Whittaker integral identities conjectured by Bump (Number Theory, Trace Formulas, and Discrete Groups, pp. 49–109, 1989) and Bump and Friedberg (Festschrift in Honor of Piatetski-Shapiro, Part II, pp. 47–65, 1990) and proved by Stade (Am. J. Math. 123:121–161, 2001; Israel J. Math. 127:201–219, 2002). Our approach leads to new ‘combinatorial’ proofs and generalizations of these identities, with some restrictions on the parameters.


Introduction
The Robinson-Schensted-Knuth (RSK) correspondence is a combinatorial mapping which plays an important role in the theory of Young tableaux, symmetric functions and representation theory [23,45]. It is deeply connected with Schur functions and provides a combinatorial framework for understanding the Cauchy-Littlewood identity and Schur measures on integer partitions. It is also the basic structure which lies behind the solvability of a particular family of combinatorial models in probability and statistical physics including longest increasing subsequence problems, directed last passage percolation in 1 + 1 dimensions and the totally asymmetric simple exclusion process, see for example [1,3,33,40].
The RSK map is defined on matrices with non-negative integer coefficients and can be described by expressions in the max-plus semi-ring. This was extended to matrices with real entries by Berenstein and Kirillov [10]. Replacing these expressions by their analogues in the usual algebra, A.N. Kirillov [35] introduced a geometric lifting of the Berenstein-Kirillov correspondence which he called the 'tropical RSK correspondence', in honor of M.-P. Schützenberger . However, for many readers nowadays the word 'tropical' indicates just the opposite, so to avoid confusion we will refer to Kirillov's construction as the geometric RSK (gRSK) correspondence, as in the theory of geometric crystals [8,9], which is closely related.
The geometric RSK correspondence is a birational mapping from (R >0 ) n×m onto itself. It was introduced by Kirillov [35] for square matrices (n = m) and generalized to the rectangular setting by Noumi and Yamada [37]. In the paper [19] it was shown that there is a fundamental connection between the gRSK correspondence and GL(n, R)-Whittaker functions, analogous to the well-known connection between the RSK correspondence and Schur functions. In particular, it is explained there that the analogue of the Cauchy-Littlewood identity in the setting of gRSK can be seen as a generalization of a Whittaker integral identity which was originally conjectured by Bump [15] and later proved by Stade [43]. The connection to Whittaker functions gives rise to a natural family of measures (Whittaker measures) which play a similar role in this setting to Schur measures on integer partitions. It also has applications to random polymers. In the paper [19], an explicit integral formula is obtained for the Laplace transform of the law of the partition function associated with a random directed polymer model on the two-dimensional lattice with log-gamma weights introduced in [42]. For related recent developments, see [11,12,38].
In the present work, we first provide further insight into the results of [19] by showing: (a) the gRSK mapping is volume preserving with respect to the product measure ij dx ij /x ij on (R >0 ) n×m , and (b) the integrand in Givental's integral formula for GL(n, R)-Whittaker functions [26,32] arises naturally through the application of the gRSK map (see Theorem 3.2 below).
The volume preserving property can be seen as a consequence of a new description of the gRSK map as a composition of local moves which we introduce in this paper. This description is a re-formulation of the geometric row-insertion algorithm introduced by Noumi and Yamada in [37]. Combining (a) and (b) gives a direct 'combinatorial' proof of Stade's identity (with some restrictions on the parameters) analogous to the bijective proof of the Cauchy-Littlewood identity via the classical RSK correspondence (see, for example, Fulton [23, §4.3]).
The second aim of this paper is to initiate a program of understanding the gRSK mapping in the presence of symmetry constraints in much the same spirit as the work of Baik and Rains [2,4,5] on longest increasing subsequence and last passage percolation problems. Here we consider one particular symmetry, namely the restriction of gRSK to symmetric matrices. We show that the volume preserving property continues to hold in this setting and deduce the analogue of the Whittaker measure. The corresponding Whittaker integral identity (Corollary 5.5) involves only a single Whittaker function, and turns out to be equivalent to a formula for a certain Mellin transform of the GL(n, R)-Whittaker function which was conjectured by Bump and Friedberg [16] and proved by Stade [44], again with some restrictions on the parameters. We also consider a degeneration of this model in which the diagonal entries of the input matrix vanish and the gRSK map rescales to a new version of gRSK defined on triangles. This model has a surprising and non-trivial connection to the symmetric case (see remarks at the end of Sect. 6 below).
One particular motivation for our study of the gRSK mapping is the analysis of directed polymer models. The basic directed polymer in a random environment is a model from statistical physics introduced by Huse and Henley [29] that couples a random path with an environment of random weights. Given random positive weights {w i,j } indexed by the two-dimensional lattice, each directed lattice path π from (1, 1) to (n, m) is given the quenched probability where the normalization, also called partition function, is Z nm = π ∈Π nm (i,j )∈π w i,j (1.1) and Π nm is the set of such paths. A great deal of work in probability and statistical physics has been devoted to understanding the large-scale behavior of the random path π and the partition function Z nm , but the subject is far from complete. The reader is referred to [17,18,20] for reviews. The connection with gRSK is that the partition function appears as an entry in the output matrix (equation (3.9) below).
As an application of our gRSK results we determine the law of the partition function of a family of random polymer models with inverse gamma weights that are constrained to be symmetric about the main diagonal. (The model with inverse gamma weights is also called the log-gamma polymer because conventionally the weights are written as exponentials to create a Gibbs-like measure.) We also consider a degeneration of this model in which the polymer paths are constrained to stay below the diagonal. This can be seen as a discrete version of the continuum random polymer above a hard wall, which appeared recently in the physics literature [28]. Formally, our results yield integral formulae for the Laplace transforms of these laws which we anticipate will be made rigorous in future work and then used as a starting point for further asymptotic development. Similar integral formulae obtained in [19] for the polymer model without symmetry were used in [12] to prove Tracy-Widom GUE asymptotics for the law of the partition function. The polymer models we consider also give rise to a positive temperature version of the interpolating ensembles of Baik and Rains [2,4]. In the KPZ scaling limit they should correspond to the KPZ equation on the half-line with mixed boundary conditions at zero and narrow wedge initial condition.
The outline of the paper is as follows.
• In the next section we give some background on Whittaker functions, introduce a generalization of these functions and explain how these functions can be regarded as generating functions for patterns. This interpretation can be seen as a generalization of Givental's integral formula [24,26,32] and is analogous to the combinatorial interpretation of Schur functions as generating functions for semistandard Young tableaux. • In Sect. 3 we give a new description of the gRSK map as a composition of local moves (based on Noumi and Yamada's dynamical description of gRSK) and use this to establish several basic results. In particular, we show that the gRSK mapping is volume-preserving with respect to a natural product measure on (R >0 ) n×m and establish a fundamental identity (Theorem 3.2) which provides an elementary explanation of the appearance of Whittaker functions in this setting. This gives further insight into earlier results from [19] and yields a new proof and generalization of two of Stade's Whittaker integral identities (Theorems 7.1 and 7.3). • In Sect. 4 we explain the relationship between the local-moves description of gRSK and the geometric row-insertion algorithm of Noumi and Yamada [37]. • In Sect. 5 we consider the restriction of gRSK to symmetric matrices. We show that the volume preserving property continues to hold in this setting and deduce several consequences, including a new proof (with some restriction on the parameters) of the Whittaker integral identity (Theorem 7.5) involving a single Whittaker function due to Stade [44]. • In Sect. 6 we introduce gRSK for triangular arrays. Again we prove a fundamental identity and the volume preserving property, and deduce the probability distribution of the shape vector of the output array under inverse gamma distributed initial weights. The polymer version of the problem describes paths restricted to lie below a hard wall. • In Sect. 7 we explain how the results of this paper relate to some of the Whittaker integral identities which have appeared previously in the automorphic forms literature. • In Sect. 8 we explain how the Berenstein-Kirillov extension of the RSK correspondence can be recovered by taking a limit (tropicalization). In statistical physics terminology this is a zero-temperature limit that takes polymer partition functions to last-passage percolation values. By analogy with Sect. 3, we give a description of the Berenstein-Kirillov mapping in terms of local moves which shows that this map is also volume preserving. Under exponentially distributed weights the probability distribution of the shape vector of the resulting pair of Gelfand-Tsetlin patterns is given by a noncentral Laguerre ensemble. This connection to random matrix theory has had important applications to last passage percolation models [4,13,21,22,33].
In the automorphic forms literature the standard 'normalization' is slightly different. In particular, in the notation of the paper [30], we have the relation, for n ≥ 2: where a k = λ k − (1/n) i λ i for k = 1, . . . , n and πy j = x n−j +1 /x n−j , for j = 1, . . . , n − 1. This is easily verified by comparing the recursion (2.1) with a similar recursion obtained by Ishii and Stade [30] for the functions W n,a (y), and using the elementary relation (2.3). Indeed, first note that, by (2.3), we only need to check this for λ = a, that is, when i λ i = 0. In the case n = 2 we have, writing a = (a, −a) and y 1 = y, where πy = √ x 2 /x 1 and K ν is the Macdonald function For n ≥ 3, in [30] it is shown that Making the change of variables for j = 1, . . . , n − 1, and using (2.5) above, we see that this is equivalent to the recursion ..,−a n (z) which agrees with (2.1) above. We will also consider the following generalization of the functions Ψ n λ . For λ ∈ C n , x ∈ (R >0 ) n and s ∈ C, define for λ ∈ C n+k , k ≥ 1, and s > 0, define Ψ n λ;s = Q n λ n+k Q n λ n+k−1 · · · Q n λ n+1 Ψ n λ 1 ,...,λ n ;s .
It is straightforward to see that Ψ n λ;s (x) is well-defined, as an absolutely convergent integral, for each x ∈ R n . The functions Ψ n λ;s can be regarded as generating functions for 'patterns', as we shall now explain. Let x ∈ (R >0 ) n . We define a pattern P with shape sh P = x and height h ≥ n to be an array of positive real numbers If h = n then P is a triangle in the sense of Kirillov [35]. Fix a pattern P as above. Set ρ 0 = 1 and, for 1 ≤ i ≤ h, ρ i = i∧n j =1 z ij and τ i = ρ i /ρ i−1 . We shall refer to τ as the type of P and write τ = type P . For α ∈ C h define For s ∈ C, define with the convention that z ij = 0 if (i, j ) / ∈ L(n, h). Denote by Π h (x) the set of patterns with shape x and height h. Then, for λ ∈ C h and s > 0 (this condition is only required if h > n) This formula is just a re-writing of the above definition (2.7) of Ψ n λ;s . We remark that, although it is not obvious from the above definition, the function Ψ n λ is invariant under permutations of the indices λ 1 , . . . , λ n [25,34]. In fact, the same is true of the function Ψ n λ;s , where λ ∈ C n+k , k ≥ 1 and s > 0. That is, Ψ n λ;s is invariant under permutations of the indices λ 1 , . . . , λ n+k . This follows from the definition (2.7), using the relation Q n a R n s Q n b = Q n b R n s Q n a , (2.12) where R s denotes multiplication by the function e −s/x n , and the invariance of Ψ n λ 1 ,...,λ n under permutations of λ 1 , . . . , λ n . The relation (2.12) is a straightforward extension of the commutativity property Q n a Q n b = Q n b Q n a obtained in [25,Theorem 2.3].
There is a Plancherel theorem for the Whittaker functions [34,41,46], which states that the integral transform is the space of L 2 functions which are symmetric in their variables, ι = √ −1 and is the Sklyanin measure.

Geometric RSK correspondence
The geometric RSK (gRSK) correspondence is a bijective mapping It is also birational in the sense that both T and its inverse are rational maps. It was introduced by Kirillov [35] as a geometric lifting of the Berenstein-Kirillov extension of the RSK correspondence and further studied by Noumi and Yamada [37]. We will define it here via a sequence of 'local moves' on matrix elements. This is essentially a reformulation of the row-insertion procedure introduced in [37], as will be explained in Sect. 4 below.
For each 2 ≤ i ≤ n and 2 ≤ j ≤ m define a mapping l ij which takes as input a matrix X = (x ij ) ∈ (R >0 ) n×m and replaces the submatrix (3.1) and leaves the other elements unchanged. For 2 ≤ i ≤ n and 2 ≤ j ≤ m, define l i1 to be the mapping that replaces the element x i1 by x i−1,1 x i1 and l 1j to be the mapping that replaces the element x 1j by x 1,j −1 x 1j . For convenience define l 11 to be the identity map. For 1 ≤ i ≤ n and 1 ≤ j ≤ m, set and, for 1 ≤ i ≤ n, The mapping T is defined by For example, suppose n = m = 2. Then and so Here is an illustration: Note that each l ij is birational. For example, the inverse of the map (3.1) is given by The birational property of T can thus be seen directly from the above definition.
Each matrix X ∈ (R >0 ) n×m can be identified with a pair of patterns (P , Q) with respective heights m and n, and common shape sh P = sh Q = (x nm , x n−1,m−1 , . . . , x n−p+1,m−p+1 ), where p = n ∧ m, as illustrated in the following example: x 32 x 11 x 22 In the following, we will simply write X = (P , Q) to indicate that X is identified with the pair (P , Q). The mappings R i defined above can also be written as Here we are just using the obvious fact that l ij • l i j = l i j • l ij whenever |i − i | + |j − j | > 2. This representation is closely related to the Bender-Knuth transformations, as we shall now explain. For each 1 ≤ i ≤ n and 1 ≤ j ≤ m, denote by b ij the map on (R >0 ) n×m which takes a matrix X = (x qr ) and replaces the entry x ij by leaving the other entries unchanged, with the conventions that x 0j = x i0 = 0, x n+1,j = x i,m+1 = ∞ for 1 < i < n and 1 < j < m, but x 10 + x 01 = x −1 n+1,m + x −1 n,m+1 = 1. Denote by r j the map which replaces the entry x nj by x n,j +1 /x nj if j < m and 1/x nm if j = m, leaving the other entries unchanged. For j ≤ m, define It is straightforward from the definitions to see that ρ n j = h j •r j . Now, observe that if X = (P , Q), then for each j < m, h j (X) = (t j (P ), Q) where t j is defined by this relation. It is easy to see that the mappings b ij , h j and t j are all involutions.
In the case n = m, the mappings t 1 , . . . , t n−1 are the analogues of the Bender-Knuth transformations in this setting, as discussed in [35]. In this case, if we define, for i < n, then, as explained in [35], the involutions s i = q i • t 1 • q i , i < n, satisfy the braid relations (s i s i+1 ) 3 = Id, and hence define an action of S n on the set of triangles of height n. The mapping q n−1 is the analogue of Schützenberger's involution in this setting. An immediate consequence of the above re-formulation of gRSK is the following volume preserving property. Denote the input matrix by W = (w ij ) ∈ (R >0 ) n×m and the output matrix by T = T (W ) = (t ij ) ∈ (R >0 ) n×m .

Theorem 3.1 The gRSK mapping in logarithmic variables
has Jacobian ±1.
Proof It is easy to see that the Jacobians of the mappings l ij in logarithmic variables are all ±1. This follows from the fact that the mappings each have Jacobian ±1. The result follows from the definition (3.3) of T . We remark that, by a similar argument it can be seen that the involutions q i , i < n, on the set of triangles of height n, all have Jacobian ±1 in logarithmic variables.
We recall here some basic properties of the gRSK map T , which are either obvious from the definitions or proved in the papers [36,37]. Suppose W ∈ (R >0 ) n×m and T = T (W ) = (P , Q). If we define row and column products R i = j w ij and C j = i w ij , then type Q = R and type P = C. Note that this implies, for λ ∈ C m and ν ∈ C n , Also, the following symmetries hold: The connection to directed polymers is via the following formula for t nm : where Z n,m is the partition function that appeared in (1.1). Recall that Π n,m is the set of directed nearest-neighbor lattice paths in We shall refer to the variable t nm as the polymer partition function. In this context it is natural to refer to the w ij as weights and W as the weight matrix. In fact, the remaining entries of T = (P , Q) can also be expressed in terms of similar partition functions, as follows.
where Π (r) n,k denotes the set of r-tuples of non-intersecting directed nearestneighbor lattice paths π 1 , . . . , π r starting at positions (1, 1), (1, 2), . . . , (1, r) and ending at positions (n, k − r + 1), . . . , (n, k − 1), (n, k). (See Fig. 1. When we use the path representation we draw the weight matrix in Cartesian coordinates.) This determines the entries of P . The entries of Q are given by similar formulae using T (W t ) = (Q, P ). We note here the following identity, which follows from the above lattice path representation for T : To see this if n ≤ m, take the ratio of (3.10) for Π (n−1) n,n and Π (n) n,n . In the opposite case apply the same to W t . Now, for X ∈ (R >0 ) n×m and s ∈ C, define Three paths (π 1 , π 2 , π 3 ) of a particular 3-tuple in Π (3) n,k in an n × m weight matrix. Note that the picture is in Cartesian coordinates. The paths start at the lower left at (1, 1), (1,2) and (1,3) and end at the upper right at (n, k − 2), where F s is defined by (2.10). An important property of the maps b ij defined by (3.5) above is that they preserve the quantity E 0 (X), that is, To see this, recall that the map b ij takes a matrix X = (x qr ) and replaces the entry x ij by leaving the other entries unchanged, with the conventions that x 0j = x i0 = 0, x n+1,j = x i,m+1 = ∞ for 1 < i < n and 1 < j < m, and The cornerstone of the present paper is the following identity which, combined with Theorem 3.1, explains the appearance of GL(n, R)-Whittaker functions in the context of geometric RSK.
where p = n ∧ m and denotes the sum over Proof From the identity (3.11), we can assume without loss of generality that s = 1. We will prove the theorem by induction on n and m. The statement is immediate in the case n = m = 1.
for any values of m and n. It therefore suffices to show that the proposition holds for T n,m , assuming that n ≥ m and that the proposition holds for T n−1,m .
and we are required to show that and, for k = 1, . . . , m, where X = (x ij ) and the first summation is over pairs of indices (i, j ) such that either 1 ≤ i < n and 1 ≤ j ≤ m or i = n and 1 ≤ j ≤ k, with the conventions x ij = 0 for i = 0 or j = 0. Note that We will show that for each k = 1, . . . , m. Note that this implies for each k = 1, . . . , m, and the statement of the theorem follows. Let X = (x ij ) ∈ (R >0 ) n×m and write Note that The next three relations follow from the invariance of E 0 under the b ij mappings as discussed earlier, see (3.13). If (i, j ) = (n − q + 1, k − q + 1) for some 1 < q < k, then If k < n, then If k = n (this can only occur if m = n), then It follows that E n,m;k (X ) = E n,m;k−1 (X), as required.
Let s > 0 and consider the measure on input matrices (w ij ) defined by Suppose W ∈ (R >0 ) n×m and T = T (W ) = (P , Q). Define a mapping σ : where p = n ∧ m. The next two corollaries are essentially a re-formulation of two of the main results in [19].

Corollary 3.3 The push-forward of the measure νθ ,θ;s under the geometric RSK map T is given by
Proof This follows immediately from Theorems 3.1, 3.2 and the relation (3.8).

Corollary 3.4
The push-forward of νθ ,θ ;s under σ is given by Proof This follows from Corollary 3.3 and the integral formula (2.11) for Ψ p λ;s .
We also obtain from Theorems 3.1 and 3.2 the following integral identity. This is the analogue of the Cauchy-Littlewood identity in this setting.
When m = n − 1 this is equivalent to an integral identity which was conjectured by Bump [15] and proved by Stade [44,Theorem 3.4], see Theorem 7.4 below. We note that in this case, the identity is proved in [44] without assuming the condition (λ i + ν j ) > 0 for all i and j . In this case, the integral is associated with Archimedean L-factors of automorphic L-functions on GL(n − 1, R) × GL(n, R).
When n = m, (3.16) becomes: Corollary 3.6 Suppose s > 0 and λ, ν ∈ C n , where (λ i + ν j ) > 0 for all i and j . Then Using (2.4), this is equivalent to the following integral identity for GL(n, R)-Whittaker functions, due to Stade [43], see Theorem 7.2 below. Corollary 3. 7 Stade Suppose r > 0 and λ, ν ∈ C n , where (λ i + ν j ) > 0 for all i and j . Then Again, we note that this identity is proved in [43] without assuming the condition (λ i + ν j ) > 0 for all i and j . In this case, the integral is associated, via the Rankin-Selberg method, with Archimedean L-factors of automorphic L-functions on GL(n, R) × GL(n, R).
Proof The first claim follows from Corollary 3.5 and the Plancherel theorem, as follows. We first note that, under the above hypotheses, This is easily verified using Stirling's approximation such thatf is continuous and compactly supported on ιR m . By the Plancherel theorem, such functions are dense in L 2 ((R >0 ) m , m i=1 dx i /x i ) and, moreover, satisfy almost everywhere. Indeed, for any g ∈ L 2 ((R >0 ) m , m i=1 dx i /x i ) which is continuous and compactly supported we have, by Fubini's theorem, This implies (3.17). Now, by Corollary 3.5, It follows that, for f ∈ L 2 ((R >0 ) m , m i=1 dx i /x i ) such thatf is continuous and compactly supported on ιR m , the integral is absolutely convergent, and so, by Fubini's theorem, Hence, using the Cauchy-Schwarz inequality, This proves the first claim. The second claim follows from the first, letting m = n and using (2.4).
Consider the probability measure on input matrices W defined bỹ The following result was obtained in [19].
The result follows, by Corollaries 3.6, 3.7 and the Plancherel theorem.

Equivalence of old and new description of geometric RSK
We explain here the equivalence of the Noumi-Yamada row insertion construction [37] and the definition of geometric RSK given in Sect. 3. The input weight matrix (w ij ) is n × m, where m is fixed and n represents time. After n time steps the Noumi-Yamada process gives two patterns P = {z k } and Q = {z ij }. P has height m, Q has height n, and their common shape vector z m = z n is of length p = m ∧ n. The rows of Q indexed by s = 1, . . . , n from top to bottom are the successive shape vectors (bottom rows) z m (s) = (z m, (s)) 1≤ ≤m∧s of the temporal evolution {z(s) : 1 ≤ s ≤ n} of the P pattern. Thus as in classic RSK the Q pattern serves as a recording pattern.
The Noumi-Yamada process begins with an empty pattern at time n = 0. Then the following step is repeated for n = 1, 2, 3, . . . .
Noumi-Yamada construction for time step n − 1 → n. Let z = z(n − 1) denote the P pattern obtained after n − 1 steps. Insertion of row w n of weights into z transforms z intož = z(n) as follows.
(4.1) (ii) If n ≤ m, then the equations above definež k, for 1 ≤ ≤ k ∧ (n − 1). Setž k,n = a n,n · · · a k,n for k = n, . . . , m, (4.2) whilež k, for ≥ n + 1 remain undefined.  3). Then the output T is equivalent to the patterns (P , Q) obtained from n steps of the Noumi-Yamada evolution, through these equations: Note in particular the common shape vector Here is an illustration for n × m = 3 × 6. In the case n = 1, the m-vectorž 1 described by (4.2) is the same as that obtained by applying R 1 = π m 1 = l 1m • · · · • l 11 to the top row w 1 of the weight matrix. Suppose the statement is true for T n−1,m . Add the nth weight row w n to T n−1,m and call the resulting n × m matrix T n,m = ( T n−1,m w n ). Then T n,m = R n ( T n,m ). From the definition of R n we see that on row i ∈ {1, . . . , n − 1} it alters only elementst ij for j − i ≤ m − n. Consequently after the application of R n , the induction assumption implies that (4.4) remains in force for 1 ≤ s ≤ n − 1. It only remains to check that (4.3) holds after the application of R n .
Next, an application of π m−1 n−1 = l n−1,m−1 • l n−1,m−2 • · · · • l n−1,1 transforms rows n − 2 and n − 1 in this manner: The bottom two rows of T n,m are in place. These steps continue until we arrive at T n,m .

Symmetric input matrix
As it is needed in the following, we will write R n,m i and T = T n,m for the mappings defined in (3.2)-(3.3), and note the following recursive structure. In particular, if n = m and W is symmetric, then T n,n (W ) is also symmetric. where S ∈ (R >0 ) (n−1)×n . To prove the second claim, first note that the mapping R n,n n leaves the elements of its input matrix which are strictly above the diagonal unchanged. Thus, t ij = s ij for 1 ≤ i < j ≤ n. Using this, the symmetry of T , and recalling how the row insertion procedure works (see Sect. 4), we see that Suppose n is even. Then the middle fraction of (5.6) develops as follows, through equations (5.5), s ii = t n−1 ii and by induction: t nn t n−2,n−2 · · · t 22 t n−1,n−1 t n−3,n−3 · · · t 11 = 2s n−1,n w nn · = 4w nn · s n−1,n−1 s n−3,n−3 · · · s 11 s n−2,n−2 s n−4,n−4 · · · s 22 The case of odd n develops similarly except that now the product in the numerator finishes with s 12 /2s 11 and consequently the factors of 2 cancel each other. we have, by the previous lemma, t ij = s ij for 1 ≤ i < j ≤ n, t 11 = s 12 /2s 11 , t ii = s i,i+1 s i−1,i /s ii for 2 ≤ i ≤ n − 1, t nn = 2s n−1,n w nn .
Denote by t n−1 ij the elements of the symmetric matrix T n−1,n−1 (W n−1,n−1 ). By the induction hypothesis, the map has Jacobian ±1. The mapping R n,n−1 n on the whole of (R >0 ) n×(n−1) is a composition of l ij -maps and hence has Jacobian ±1 in logarithmic variables; since it leaves matrix elements above the diagonal unchanged, its restriction to the space of matrix elements on and below the diagonal also has Jacobian ±1 in logarithmic variables. It follows that the mapping has Jacobian ±1. It therefore remains only to show that the Jacobian sub matrix of the map F (in logarithmic variables) which corresponds to the variables (log s 11 , . . . , log s n−1,n−1 , log w nn ) and (log t 11 , . . . , log t nn ) has determinant ±1. From (5.7), this sub matrix is given by which completes the proof.
Consider the measure on symmetric input matrices with positive entries defined by where α ∈ R n and ζ ∈ R satisfy α i + ζ > 0 for each i and α i + α j > 0 for i = j . Note that In this setting we have R = C and so, using (3.8) and Lemma 5.
Thus, by Theorems 3.2 and 5.2, we obtain the following result.

Corollary 5.3
The push-forward of ν α,ζ under σ is given by If λ ∈ C n and γ ∈ C satisfy (λ i + γ ) > 0 for each i, and (λ i + λ j ) > 0 for i = j , then Now, using (2.2) we can strengthen this to:

Corollary 5.4
Suppose λ ∈ C n and γ ∈ C satisfy (λ i + γ ) > 0 for each i, and (λ i + λ j ) > 0 for i = j . Then, for s > 0, By (2.4) this is equivalent to the following identity which is equivalent to an integral identity conjectured by Bump and Friedberg [16] and proved by Stade [44,Theorem 3.3], see Theorem 7.5 below. We note that in [44] the corresponding statement is proved without any restrictions on the parameters. This integral is associated with an Archimedean L-factor of an exterior square automorphic L-function on GL(n, R).

Corollary 5.5 (Stade)
Suppose λ ∈ C n and γ ∈ C satisfy (λ i + γ ) > 0 for each i, and (λ i + λ j ) > 0 for i = j . Then, for s > 0, , if n is odd. Now, consider the probability measure on symmetric matrices with positive entries defined byν where

From Corollary 5.3, we obtain:
Corollary 5. 6 The Laplace transform of the law of the polymer partition function t nn underν α,ζ is given for r > 0 by Remark (A formal computation) In the following, we formally rewrite the above formula as a multiple contour integral which we expect to be valid, at least in some suitably regularized sense. Let > 0 and set α i = α i + .
It follows from Corollary 3.6 (or 3.8) that the function e − 1 2xn Ψ n α (x) is in L 2 ((R >0 ) n , n i=1 dx i /x i ). Moreover, by Corollary 3.6, for λ ∈ ιR n , (5.11) Thus, by the Plancherel theorem, for any g ∈ L 2 ((R >0 ) n , n i=1 dx i /x i ) we can write Suppose n is even. By Corollary 5.5, if r > 0 and λ i > 0 for each i, By (2.3) it follows that, for > 0 and λ ∈ ιR n , Formally, combining (5.11), (5.13) and (5.12) yields the following integral formula for the Laplace transform of the law of the polymer partition function t nn under the probability measureν α,ζ : (5.14) or, equivalently, e −rt nnν α,ζ (dw) where the integration is along vertical lines with λ i > 0 for each i. If n is odd, we similarly formally obtain, this time using Theorem 7.4 instead of Corollary 5.5 because in this case f (x ) ζ = f (x) −ζ and ζ > 0, where the integration is along vertical lines with λ i > 0 for each i. It seems reasonable to expect the integral formulas (5.15) and (5.16) to be valid, at least in some suitably regularized sense.

Geometric RSK for triangular arrays and paths below a hard wall
In this section we introduce a birational, geometric RSK type mapping T n that maps triangular arrays X n = (x ij , 1 ≤ j < i ≤ n) to triangular arrays T = (t ij , 1 ≤ j < i ≤ n), both with positive real entries. The motivation comes from the symmetric polymer of Sect. 5, with a (de)pinning parameter ζ that tends to infinity. This will become clear later on in Proposition 6.4 (see also the remarks at the end of the section). Notions like the type and the shape can be defined also for this mapping. We prove that it satisfies a version of the fundamental identity (Theorem 3.2) and preserves volume in logarithmic variables. Moreover, we can relate the shape to partition functions of nonintersecting paths below a "hard wall", that is, paths restricted to {(i, j ) : j < i}. For n = 2 the mapping is defined by For n ≥ 3 we define inductively where ρ ,n j = ρ n j for j = 1, . . . , n − 2, and ρ ,n n−1 = b ,n 2,1 • · · · • b ,n n−1,n−2 • b ,n n,n−1 • r n,n−1 , (6.4) and ρ n j is defined in (3.4). To complete the definition of T n we define the mappings b ,n j,j −1 and r n,n−1 on a triangular array X n = (x ij , 1 ≤ j < i ≤ n). This is done as follows. The mapping r n,n−1 replaces x n,n−1 by 1/x n,n−1 . Observing the conventions x i0 = x n+1,n−1 = 1, make these definitions: • For k = 1, 2, . . . , n−1 2 , b ,n n−2k+1,n−2k is the identity mapping. We present explicitly the cases n = 3, 4 to clarify the definitions. For n = 3, For n = 4, x 21 x 21 x 32 x 41 x 32 +x 41 For a triangular array X = (x ij , 1 ≤ j < i ≤ n) define with the convention that x i0 = x ii = 0 for i = 1, . . . , n. Here is the analogue of Theorem 3.2 for triangular arrays.
Then the output array T n = T n (W ) satisfies Proof We will show that To this end, let T 0 = T n−1 (W n−1 ) and T k = ρ ,n k • · · · • ρ ,n 1 (T n−1 (W n−1 )) for k = 1, 2, . . . , n − 1. For a triangular array X define ij is over all indices (i, j ) such that 1 ≤ j < i ≤ n, but (i, j ) = (n, k + 1), . . . , (n, n − 1). The boundary conventions x i0 = x ii = 0 are still in force. We will show that E ,n,k T k = E ,n,k−1 T k−1 for k = 1, 2, . . . , n − 1, and this will conclude the proof. Notice that for k = 1, 2, . . . , n − 2 this fact is already included in the proof of Theorem 3.2, since ρ ,n i = ρ n i for i ≤ n − 2. To check the case k = n − 1, let X = T n−2 and X = ρ ,n n−1 (X) = T n−1 . Since ρ ,n n−1 alters only the elements x i,i−1 , i = 2, . . . , n, and leaves the rest unchanged, E ,n,n−1 X = E ,n,n−1 ρ ,n n−1 (X) where in the summation˜ we set appearances of terms x i,i−1 , i = 2, . . . , n, equal to zero. Consider the three parts of line (6.7). First 1 because either n is odd and x 21 = x 21 , or n is even and x 21 = x 31 /x 21 . The middle terms satisfy either by virtue of (6.5 x n,n−2 x n,n−1 = 1 x n,n−1 by (6.5) and the definition of r n,n−1 . Making these substitutions on line (6.7) converts E ,n,n−1 (X ) into E ,n,n−2 (X) and completes the proof.
The following theorem states the volume preserving property of the map T n . It follows from the volume preservation of the individual steps in (6.4). Theorem 6.2 Let W = (w ij , 1 ≤ j < i ≤ n) ∈ (R >0 ) n(n−1)/2 as above, and consider the mapping W → T n (W ) = (t ij , 1 ≤ j < i ≤ n). In logarithmic variables has Jacobian equal to ±1.
Let W n = (w ,n ij , 1 ≤ j < i ≤ n) be a given triangular array. Let W ε n be the symmetric n × n matrix with w ε ii = ε for 1 ≤ i ≤ n and w ε ij = w ,n ij for 1 ≤ j < i ≤ n. Finally, denote by T n (W n ) = (w ,n ij , 1 ≤ i, j ≤ n) a symmetric n × n output matrix whose lower triangular part (t ij , 1 ≤ j < i ≤ n) agrees with the output array T n (W n ), while the diagonal elements (t ii ) i=1,...,n are determined by t n−2k,n−2k = t n−2k−1,n−2k−1 = t n−2k,n−2k−1 for k = 0, 1, . . . and t 11 = 1 if n is odd.
(6.9) Proposition 6.4 Let T n,n be the geometric RSK mapping on n × n matrices with positive entries, defined in (3.3), and W ε n , Λ ε n , T n , W n as above. Then, as ε 0, T n,n W ε n = Λ ε n • T n W n + S ε n (6.10) where S ε n is an n × n matrix of lower order terms, specifically (6.12) Symmetry of W ε n makes T n,n (W ε n ) also symmetric. Since ρ n n alters only diagonal elements, the matrix must be symmetric just before the last application of ρ n n . The mappings ρ n n−1 • · · · • ρ n 1 alter only entries strictly below the diagonal. Consequently we can skip the steps ρ n n−1 • · · · • ρ n 1 if we simply take the upper triangular part of the matrix just before and extend it to a symmetric matrix. We insert one extra transposition and then keep the lower triangular instead of the upper triangular part. In other words, let W = R n,n−1 n T n−1,n−1 (W ε n−1 ) w n1 . . . w n,n−1 (an n × (n − 1) matrix) and define the symmetric matrixW = {w ij , 1 ≤ i, j ≤ n} byw ij = w ij for 1 ≤ j ≤ i ∧ (n − 1) andw nn = ε. Then T n,n (W ε n ) = ρ n n (W ). In particular, the part of T n,n (W ε n ) strictly below the diagonal is already present in W . We prove (6.10) by induction on n. Case n = 2 begins with W 2 = (w 21 Assume that Abbreviate T ε = (t ε ij , 1 ≤ i, j ≤ n − 1) = T n−1,n−1 (W ε n−1 ) so that the induction assumption reads: We now perform the mapping W = ρ n n−1 • · · · • ρ n 1 T n−1,n−1 (W ε n−1 ) w n1 . . . w n,n−1 inductively. Assume that we have applied the transformations ρ n k−1 • · · · • ρ n 1 , k < n− 1, and this has resulted in output entries where w ,n ij denotes the entries of the matrix T n (W n ) (recall that the lower triangular part of T n (W n ) is identical to T n (W n )). This is readily checked when k − 1 = 1. We will show that this is also true after the transformation ρ n k . To this end, using the relations (3.6) and (3.5), we have that w nk = w nk w n,k−1 + t ε n−1,k = εw nk w ,n n,k−1 + w ,n−1 n−1,k + o(ε) = εw ,n n,k + o(ε), and this verifies the proposition for the above entries. The next step is to confirm that w n−j,n−j −1 = εw ,n n−j,n−j −1 + o(ε) for j = 0, . . . , n − 2. To this end, assume that we have performed the transformations ρ n n−2 • · · · • ρ n 1 and then we operate with ρ n n−1 . First for j = 0, w n,n−1 = w n,n−1 w n,n−2 + t ε n−1,n−1 = w n,n−1 εw ,n n,n−2 + 2ε 2 w ,n−1 n−1,n−1 + o(ε) = εw n,n−1 w ,n n,n−2 + o(ε) = εw ,n n,n−1 + o(ε).
For j > 0 To develop this further we distinguish between odd and even j . For even j , where the last step came from (6.5). In the odd case The second last equality follows from the fact that T n−1 (W n−1 ) satisfies (6.9) with n replaced by n − 1. The last equality comes from the definition of b ,n n−j,n−j −1 as the identity mapping (see the bullet below (6.5)). In the case (n − j, n − j − 1) = (2, 1) we need to distinguish between the case n is even or odd. In the even case we have where the second to last equality follows from (6.9), since (n − 1) is odd and therefore w ,n−1 11 = 1. The case that n is odd follows similarly. To complete the construction of T n,n (W ε n ), extend W to the symmetric matrixW as explained above and define W = ρ n n (W ). By computations similar to the ones above and by symmetry, the diagonal elements (w ii ) i=1,...,n satisfy w n−2k,n−2k = 2ε 2 w ,n n−2k,n−2k−1 and w n−2k−1,n−2k−1 = 1 2 w ,n n−2k,n−2k−1 for k = 0, 1, . . . . The proof is then complete.
Proof of Theorem 6.3 Consider a symmetric, n × n, matrix, W ε n , with diagonal weights, w ii = ε, i = 1, 2, . . . , n. Let v r denote the partition sum introduced in (3.10) with k = m = n: v r = (π 1 ,...,π r )∈Π (r) n,n (i,j )∈π 1 ∪···∪π r w ij . (6.13) The key observation is the following. For and where z 0 = 1, z r is defined by (6.8), and the unspecific notation V ( ) represents any sum of products of weights where each term contains at least diagonal weights w ii . To see the origin of (6.14)-(6.15), consider first v 1 , the sum of products (i,j )∈π w ij over all paths π from (1, 1) to (n, n). Those products that contain only weights w 11 w nn from the diagonal correspond to paths that stay either strictly above or strictly below the diagonal, except at points (1, 1) and (n, n). By the symmetry of the weights this gives two copies of z 1 . Similarly for v 2 , pairs (π 1 , π 2 ) that intersect the diagonal only at {(1, 1), (n, n)} correspond to pairs such that π 2 connects (1, 2) to (n − 1, n) above the diagonal and π 1 connects (2, 1) to (n, n − 1) below the diagonal. Weights of paths are multiplied, and so symmetry gives z 2 1 . The higher cases work the same way. For the symmetric weight matrix the shape vector x = (x 1 , . . . , x n ) is given by Here we recalled that the shape vector is the bottom row z n· of the P pattern, see (2.8), and combined (3.10) with (4.3).
Proof Let us first notice that if X = (x ij , 1 ≤ j < i ≤ n) is a triangular array and X = ρ ,n j (X), then x nj · · · x n−j +1,1 x n,j −1 · · · x n−j +2,1 = x nj x n−1,j · · · x n−j,1 x n−1,j −1 · · · x n−j +1,1 , j < n− 1. (6.18) To check this we notice that ρ ,n j = ρ n j = h j • r j , where h j and r j are defined in (3.6) via the Bender-Knuth transformations. Let us recall that with the same convention as in (3.5). Multiplying the various relations (6.19) for (i, j ) = (n, j ), . . . , (n − j + 1, 1) leads to (6.18). Iterating this leads to τ n j T n (W n ) = w n,j τ n−1 j T n−1 (W n−1 ) = w n,j · · · w j +2,j τ j +1 j T j +1 (W j +1 ) . (6.20) Denoting by w ij the elements of T j +1 (W j +1 ), by w † ij the elements of T j (W j ) and using the transformations in (6.5) we obtain that Using Theorem 6.3 we have that The definition below (6.5) implies that . . , (j − 1)/2 − 1 and using again Theorem 6.3 we obtain Combining the last three relations gives and this completes the proof.
By combining Theorems 6.1 and 6.2 and Proposition 6.5 we identify the probability distribution of the shape vector of the triangular array under inverse gamma weights. The mapping that gives the shape vector is σ : (R >0 ) n(n−1)/2 → (R >0 ) n−1 defined by σ (W ) = sh T n (W ) = (t n,n−1 , t n−1,n−2 , . . . , t 2,1 ). (6.21) Consider the probability measure dw ij w ij (6.22) on the space of triangular arrays (w ij , 1 ≤ j < i ≤ n) ∈ (R >0 ) n(n−1)/2 , where α = (α 1 , . . . , α n ), α i + α j > 0 and the normalization is Corollary 6.6 For the λ α -distributed triangular array of weights, the distribution of the shape vector is given by We convert the density (6.22) into t ij variables. By Proposition 6.5, From the proof of Proposition 6.5 (after relation (6.20)), By the volume preserving property of the W → T map (Theorem 6.2), The result then follows by integrating over the variables (t ij , 1 ≤ j < i − 1, 1 ≤ i ≤ n) and the definition of the Whittaker function.
As a further corollary we record the distribution of the vector (z 1 , z 2 /z 1 , . . . , z n/2 /z n/2 −1 ) of ratios of partition functions z r defined by (6.8). The result comes by combining Corollary 6.6 with Theorem 6.3.
(i) Replace n with n − 1 in Corollary 5.3 and consider a symmetric (n − 1) × (n − 1) weight matrix with distribution (5.10), and set ζ = α n . Let σ 1 = t n−1,n−1 be the polymer partition function of the symmetric matrix, or equivalently, the front element of its shape vector. Then a comparison of (6.23) and (5.9) reveals that the distribution of the partition function z 1 is identical to the distribution of 2t n−1,n−1 .
(ii) Corollary 6.6 can be obtained as the ζ → ∞ limit of Corollary 5.3. Using the recursive structure (2.1) of Whittaker functions, namely Ψ n α = Q n,n−1 α n Ψ n−1 α , one can show that where "⇒" denotes weak convergence of probability measures. Under the measureν α,ζ the diagonal element w ii of the symmetric input matrix has probability distribution and hence its reciprocal w −1 ii is twice a gamma variable with parameter α i +ζ . Consequently ζ w ii → 1/2 almost everywhere as ζ → ∞. Thus w ii decays as (1/2)ζ −1 . This corresponds to the appearance, in our proof, of triangular arrays with diagonal elements ε → 0.
(iii) From a physical point of view, the limit ζ → ∞, or equivalently ε → 0, introduces a depinning effect on the polymer, which is responsible for the appearance of the hard wall phenomenon.

Whittaker integral identities
In this section, we recall three integral identities for Whittaker functions which were proved in the papers [43,44], and explain how they are equivalent to (and in fact generalized by) those which have appeared naturally in the context of the present paper (Corollaries 3.5, 3.7 and 5.5). We first note that the functions W n,a (y) introduced in Sect. 2 are denoted by W n,2a (y) in the papers [43,44]. The following identity was conjectured by Bump [15] and proved by Stade [ This integral is associated, via the Rankin-Selberg method, with Archimedean L-factors of automorphic L-functions on GL(n, R) × GL(n, R). Using (2.5), it is straightforward to see that this is equivalent to: Theorem 7.2 (Stade) Suppose r > 0 and λ, ν ∈ C n . Then Indeed, if we let and s = (1/n) i (λ i + ν i ) then, using (2.5) and (2.3), (7.1) becomes where πy j = x n−j +1 /x n−j for j = 1, . . . , n − 1. It is important to note here that we are regarding Ψ n −ν (x)Ψ n −λ (x)x −ns 1 as a function of y 1 , . . . , y n−1 . Now, writing Γ (ns) = ∞ 0 x ns 1 e −x 1 dx 1 x 1 we can absorb this into the integral, changing variables from y 1 , . . . , y n−1 , x 1 to x 1 , . . . , x n , to obtain The identity (7.2) follows, using (2.2). The second identity is a formula for the Mellin transform for s ∈ C, n ≥ 3 and a ∈ C n , b ∈ C n−1 with i a i = j b j = 0. This integral is associated with Archimedean L-factors of automorphic L-functions on GL(n − 1, R) × GL(n, R). The following identity was conjectured by Bump [15] and proved by Stade [44,Theorem 3.4].
Using this, and the relations (2.5) and (2.4), it is straightforward to see that Theorem 7.3 is equivalent to: The third identity is a formula for the Mellin transform In terms of the Ψ n λ , this is equivalent to the following identity, which is straightforward to verify using (2.5) and (2.2) as above. Theorem 7.6 (Stade) Suppose r > 0, λ ∈ C n and γ ∈ C. Then ,

Tropicalization, last passage percolation and random matrices
The geometric RSK correspondence is a geometric lifting of the (Berenstein-Kirillov extension of the) RSK correspondence. Going the other way, let x ij = e y ij / where Y = (y ij ) ∈ R n×m and > 0. Let X = (x ij ) and T = (t ij ) = T (X ). Then the mapping U : R n×m → R n×m defined by U(Y ) = (u ij ) where u ij = lim →0 log t ij is the extension of the RSK mapping to matrices with real entries introduced by Berenstein and Kirillov [10]. We identify the output U(Y ) with a pair of patterns as before, but now the entries are allowed to take real values. In this context, we define a real pattern of height h and shape x ∈ R n as an array of real numbers with bottom row r h· = x. The range of indices is Fix a real pattern R as above. Set s 0 = 1 and, for 1 ≤ i ≤ h, s i = i∧n j =1 r ij and c i = s i − s i−1 . We shall refer to c as the type of R and write c = type(R). Denote by Σ h (x) the set of real patterns with shape x and height h. We say that a real pattern R is a (generalized) Gelfand-Tsetlin pattern if r nn ≥ 0 and it satisfies the interlacing property r i+1,j +1 ≤ r ij ≤ r i+1,j for all (i, j ) ∈ L(n, h) with i < h, with the conventions r i+1,n+1 = 0 for i = n, . . . , h − 1. Denote the set of generalized Gelfand-Tsetlin patterns with height h and shape x ∈ R n + by GT h (x). This is a Euclidean polytope of dimension d = n(n − 1)/2 + (h − n + 1)n. Denote the corresponding Euclidean measure by dR. The analogue of the Whittaker functions in this setting are the functions J λ (x) defined, for λ ∈ C h and x ∈ R n + by Note that, from (2.11), we have lim →0 d Ψ n λ;1 e x/ = J λ (x).
If h = n then J λ (x) = det(e −λ i x j )/ (λ) where (λ) = i>j (λ i − λ j ) (see, for example, [39]). The analogue of Theorem 3.2 in this setting is the following. This result can be inferred directly from results of [10] (see Property 8 after the statement of Theorem 1.1) or seen as a consequence of Theorem 3.2. We identify the output U(Y ) with a pair of real patterns (R, S) of respective heights m and n, and common shape (u nm , . . . , u n−p+1.n−p+1 ), where p = n ∧ m. We note that the corresponding statement for matrices with integer entries follows as a particular case. If Y has non-negative integer entries then the pair of generalized Gelfand-Tsetlin patterns obtained can be interpreted in the usual way as the pair of semistandard tableaux obtained via the RSK correspondence.
The local move description of Sect. 3 carries over to the tropical setting, as follows. For convenience and clarity we adopt the same notation as in the geometric setting. For each 2 ≤ i ≤ n and 2 ≤ j ≤ m define a mapping l ij which takes as input a matrix Y = (y ij ) ∈ R n×m and replaces the submatrix and leaves the other elements unchanged. For 2 ≤ i ≤ n and 2 ≤ j ≤ m, define l i1 to be the mapping that replaces the element y i1 by y i−1,1 + y i1 and l 1j to be the mapping that replaces the element y 1j by y 1,j −1 + y 1j . As before we define l 11 to be the identity map. For 1 ≤ i ≤ n and 1 ≤ j ≤ m, set π j i = l ij • · · · • l i1 , and, for 1 ≤ i ≤ n, Then the Berenstein-Kirillov map is given by U = R n • · · · • R 1 . (8.4) Now observe that each l ij is invertible. Indeed, the inverse of the map (8.3) is given by (8.5) and the boundary moves l 1j , l i1 are clearly invertible. It follows that the map U is invertible. Moreover, U preserves the Lebesgue measure on R n×m . The Jacobians of the l ij are clearly almost everywhere equal to ±1. Combining this with Corollary 8.1 we conclude that the restriction of U to R n×m + is volume preserving with respect to the Euclidean measure, injective and its image is given by the Euclidean set of pairs of generalized Gelfand-Tsetlin patterns with respective heights m and n, having the same shape in C (p) = x ∈ R p + : x 1 ≥ · · · ≥ x p .
Finally, we recall the following straightforward fact. If we define row and column sums r i = j y ij and c j = i y ij , then type(S) = r and type(R) = c. Note that this implies, for λ ∈ C m and ν ∈ C n , ij (ν i + λ j )y ij = i ν i r i + j λ j c j . (8.6) The analogue of the Cauchy-Littlewood identity in this setting (cf. Corollary 3.5) is thus given as follows. This basic structure has been exploited in the papers [4,13,21,22,33] to study last passage percolation models with exponential weights, as we shall now explain. We note that the development in those papers is via a discrete approximation and as such differs from the present framework, but the main ideas are the same. Let a ∈ R n and b ∈ R m such that a i + b j > 0 for all i and j . Consider the measure on input matrices (y ij ) ∈ R n×m + defined by ν a,b (dy) = i,j e −(a i +b j )y ij dy ij .
From the above, it follows that the push-forward of ν a,b under the map U is given by Choosing these weights at random so that they are independent and exponentially distributed with respective parameters a i + b j corresponds to choosing the input matrix (y ij ) according to the probability measurẽ ν a,b (dy) = ij (a i + b j )ν a,b (dy).
From the above, under this probability measure, the law of the random variable u nm is the same, assuming n ≥ m, as the first marginal of the probability measure on C (m) defined by In other words, for bounded continuous f , The probability measures μ a,b are non-central Laguerre (or complex Wishart) ensembles and the integrals (8.7) are the corresponding Selberg-type integrals [4,13,21,22,33].
We note that, in the notation of Sect. 5, as → 0, where "⇒" denotes weak convergence of probability measures. In this setting (see [4]) if the input matrix (y ij ) ∈ R n×n + is symmetric and chosen according to the probability measure i<j (α i + α j )e −(α i +α j )y ij dy ij i (α i + ζ )e −(α i +ζ )y ii dy ii then the last passage time u nn is distributed as the first marginal of μ α;ζ .