1 Introduction
A dimer cover, or perfect matching on a graph, is a subset of edges such that each vertex is incident to exactly one edge in the subset. A dimer model is a probability measure on the set of perfect matchings (see [Reference Kenyon21]). The dimer model is a natural mathematical model for the structures of matter; for example, each perfect matching on a hexagonal lattice corresponds to a double-bond configuration of a graphite molecule. The dimer model on a Fisher graph has a measure-preserving correspondence with the 2D Ising model (see [Reference Fisher15; Reference McCoy and Wu32; Reference Li25]).
Just as in the structures of matter, different molecule configurations have certain probabilities to occur depending on the underlying energy. Mathematically, we define a probability measure on the set of all perfect matchings of a graph depending on the energy of the dimer configuration, quantified as the product of weights of present edges in the configuration. The phase transitions and asymptotical behaviors of the dimer model have been an interesting topic for mathematicians and physicists for a long time. A combinatorial argument shows that the total number of perfect matchings on any finite planar graph can be computed by the Pfaffian of the corresponding weighted adjacency matrix [Reference Kasteleyn18; Reference Temperley and Fisher37]. The local statistics can be computed by the inverse of the weighted adjacency matrix [Reference Kenyon19]; a complete picture of phase transitions was obtained in [Reference Kenyon, Okounkov and Sheffield23]. Empirical results show that in large graphs, there are certain regions where the configurations are almost deterministic (i.e., one type of edges have very high probability to occur in the dimer configuration). These are called ‘frozen regions’, and their boundaries are called ‘frozen boundaries’. When the mesh size of the graph goes to 0 such that the graph approximates a simply-connected region in the plane, the limit shape of the random perfect matchings can be obtained by a variational principle [Reference Cohn, Kenyon and Propp11], and the frozen boundaries are proved to be algebraic curves of a specific type called the cloud curves [Reference Kenyon and Okounkov22]. It is also known that the fluctuations of (unrescaled) dimer heights converge to the Gaussian free field (GFF) in distribution when the boundary satisfies certain conditions [Reference Kenyon19; Reference Li26].
In this paper, we investigate perfect matchings on a general class of bipartite graphs called rail yard graphs. The major goal of the paper is to understand the asymptotic behavior of the model, in particular, the limit shape and height fluctuations.
We start with pyramid partitions as an example of rail yard graphs. They are shown in Figure 1. These are pyramid shaped objects built out of square bricks. The fundamental pyramid partition is shown on the left and extends infinitely down. Any other pyramid partition is obtained by removing finitely many bricks, where we can only remove fully exposed bricks at any given time. In the figure on the right, three bricks have been removed. If one looks from above, then the domino tilings as illustrated in Figure 2 will be observed.
In Figure 2, an edge was drawn for each domino. Now it is possible to slice the tilings diagonally (along dashed lines) and insert new vertices to obtain the two perfect matchings on the rail yard graph; see Figures 3 and 4.
The one corresponding to the other pyramid partitions where three bricks were removed is given below.
This construction is due to [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7]. We leave the explanation to the picture. Note that the green curve bounds the region that corresponds to the tiling of the square domain shown in Figure 2 and that edges shown in double-bold correspond to dominoes within the square region corresponding to the pyramid partition. The edges shown in bold correspond to dominoes outside the square region corresponding to the pyramid partition. Note also that to represent an arbitrary pyramid partition, we might need to enlarge the graph to the left and right if the bricks that were removed fall out of this square domain. This means that if the graph is fixed, then only a subset of all pyramid partitions can be represented by its perfect matchings.
The graph in Figures 3 and 4 is an example of a rail yard graph. It is a rail yard graph given by the word $\{L+,R+,\dots , L+,R-,L-,\dots ,R-\}$ ; see Section 2.1 for a precise definition. In general, a rail yard graph is characterized by a word from the four-letter alphabet $\{L+,L-,R+,R-\}$ . Each letter corresponds to a building block – a column consisting of horizontal and diagonal edges. Building blocks differ among themselves in the location of diagonal edges only. For example, for the $R+$ block, diagonal edges are on the right of the column and going up (from left to right).
Rail yard graphs were defined in [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7], and the formulas to compute the partition functions of pure dimer coverings on such graphs were also proved in [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7]. Special cases of rail yard graphs include the Aztec diamond [Reference Elkies, Kuperberg, Larsen and Propp13; Reference Elkies, Kuperberg, Larsen and Propp14; Reference Johansson17; Reference Bufetov and Knizel10], pyramid partition [Reference Kenyon20; Reference Szendroi36; Reference Young39; Reference Young38], steep tiling [Reference Bouttier, Chapuy and Corteel9], tower graph [Reference Borodin and Ferrari6], contracting square-hexagon lattice [Reference Boutillier and Li8; Reference Li28; Reference Li27; Reference Li24] and contracting bipartite graph [Reference Li29; Reference Li30].
Pure dimer coverings on rail yard graphs are in one-to-one correspondence with sequences of partitions. To establish the correspondence, one recognizes each of the red dots in the graph above as either a particle or hole. Red dots that are the left-end points of a present edge in the dimer covering are holes, and the right-end points are particles. That way, on each vertical line we obtain a Maya diagram of a partition. The fundamental pyramid partition corresponds to the sequence of empty partitions, and the pyramid partition with three bricks removed shown above to $\emptyset , \emptyset ,\emptyset ,(1),(1),(1),\emptyset ,\dots $
Furthermore, using the correspondence, certain random dimer models on rail yard graphs can be seen as the probability distribution on sequences of partitions known as the Macdonald process. To study dimer configurations on the rail yard graphs, we need to use dual partitions, and we will be dealing with a generalized Macdonald process that allow dual interalacing. Such a Macdonald process can also be obtained from the Macdonald processes defined in [Reference Borodin and Corwin4; Reference Borodin, Corwin, Gorin and Shakirov5] by certain specializations, which are homomorphisms from the algebra of symmetric polynomials to ${\mathbb C}$ , but not function evaluations. In this paper, our asymptotics is concerned only with measures that belong to the subclass of Macdonald processes known as Schur processes. Therefore, we shall specialize certain parameters in Macdonald processes to be equal in later sections.
Paper [Reference Li30] also studies asymptotics of dimer coverings on rail yard graphs. The major differences between this paper and [Reference Li30] are the following:
-
• Paper [Reference Li30] studies dimer configurations on rail yard graphs with the left boundary condition given by a fixed but arbitrary partition, whereas this paper studies pure dimer coverings on rail yard graphs (i.e., both the left and right boundary conditions are given by the empty partition).
-
• The rail yard graphs studied in [Reference Li30] correspond to words from a three-letter alphabet given by either $\{L+,L-,R+\}$ or $\{L+,R-,R+\}$ , whereas the rail yard graphs studied in this paper correspond to words from a four-letter alphabet $\{L+,L-,R+,R-\}$ .
-
• The edge weights of the rail yard graphs studied in [Reference Li30] are $1\times n$ periodic, whereas the edge weights of the rail yard graphs studied in this paper are q-volume weights of the $1\times n$ periodic weights, with $q\rightarrow 1$ in the scaling limit.
-
• The techniques used in [Reference Li30] are differential operators of Schur polynomials, whereas the techniques used in this paper are integral operators of Macdonald polynomials. We choose to use the Macdonald integral operator because it provides an alternative way to study limit shapes without analyzing the asymptotics of the hook Schur functions.
Our main technical result which allows us to later perform the asymptotic analysis is done in Section 4. The height function of a pyramid partition is naturally defined by its 3-D depiction, but a notion of the height function exists for general rail yard graphs, not just pyramid partitions. It is the Thurston height function, which is well-defined for perfect matchings of bipartite planar graphs. In Section 4, our main result is the formula for the expectation of the moments for quantities associated with the height function. We refer to these quantities as Macdonald observables, as they can be computed within the framework of Macdonald processes. This kind of approach in studying random models using Macdonald processes was pioneered in [Reference Borodin and Corwin4; Reference Borodin, Corwin, Gorin and Shakirov5] and applied to study the asymptotics of lozenge tilings in [Reference Dimitrov12; Reference Ahn1]. Our method is very similar to [Reference Dimitrov12; Reference Ahn1] and makes use of Negut operators.
In Section 5, we study the asymptotics of the moments of the observables in the appropriate scaling limit. The general result is given in Theorem 5.4. We also show the Gaussian fluctuations in Theorem 5.5. In Section 6, we prove an integral formula for the Laplace transform of the rescaled height function (see Theorem 6.1), which turns out to be asymptotically deterministic, as a 2D analog of the law of large numbers. Before we state the result for pyramid partitions here, we explain the limiting regime.
We take a sequence of pyramid partitions and scale them so that their corresponding rail yard graphs have a fixed set of transition points $V_0<V_1<V_2$ , representing the abscissas of the vertical lines of the left, mid (transition from $+$ s to $-$ s) and right boundary. For example, if $V_0=-2, V_1=0$ , and $V_2=1$ , then rail yard graphs associated with $(L+,R+)^{2n}(L-,R-)^n$ have transition points at $-8n, 0, 4n$ which can be after scaling by $\epsilon =1/(4n)$ brought to $V_0,V_1,V_2$ . The random model we study is what we refer to as the periodic q-volume model, which in the 2-periodic case, such as pyramid partitions, depends on parameters $\tau _1$ and $\tau _2$ and $q=e^{-\epsilon }$ , where $\epsilon \to 0$ . The weights of diagonal edges are products of weights each depending on one on these parameters. The weight coming from q is the q-volume which is the q analog of the uniform measure on plane partitions or, more generally, sequences of interlacing partitions. Weights coming from $\tau $ s are periodic weights which give different weight to diagonal edges in columns associated with L from those associated with R. For general rail yard graphs, the precise conditions on the periodicity of the graph and weights are given in Assumptions 5.1. The asymptotics of the pyramid partitions for uniform weights (i.e., when $\tau _1=\tau _2$ ) was studied in [Reference Betea, Boutillier and Vuletić3]. Theorem 6.1 in the case of pyramid partitions says the following:
Theorem 1.1. The rescaled random height function of pyramid partitions $\epsilon h\left (\frac {\chi }{\epsilon },\frac {\kappa }{\epsilon }\right )$ converges, as $\epsilon \rightarrow 0$ , to a non-random function $\mathcal {H}(\chi ,\kappa )$ such that the Laplace transform of $\mathcal {H}(\chi ,\cdot )$ is given by
where $\alpha $ is a positive real number and $\mathcal {C}$ is a positively oriented contour that encloses $-e^{-V_0}\tau _2$ , 0 and $e^{-V_1}\tau _1$ , but no other poles or zeros of $\mathcal {G}_{\chi }$ .
The limit shape of pyramid partitions is described as a solution of the parametric equation (parametrized by w):
The limit shape for pyramid partitions is shown in Figure 5. The figure on the left corresponds to the uniform case and coincides to one obtained by [Reference Betea, Boutillier and Vuletić3], and the one on the right corresponds to a non-uniform case.
In Section 7, we show that the fluctuations of unrescaled height functions converge to the pull-back Gaussian free field (GFF) in the upper half plane under a diffeomorphism from the liquid region to the upper half plane. This result is given in Theorem 7.7, and we state the result for pyramid partitions here. Let $\mathbf {w}_+:\mathcal {L}\rightarrow {\mathbb H}$ be the diffeomorphism which maps each point $(\chi ,\kappa )$ in the liquid region $\mathcal {L}$ to the unique root of $\mathcal {G}_{\chi }(w)=e^{-2\kappa }$ in the upper half plane ${\mathbb H}$ . We discuss in Section 7 conditions that need to be satisfied so that such a map is well-defined. Let $\Xi $ be the Gaussian free field (GFF) on ${\mathbb H}$ with the zero boundary condition. Then Theorem 7.7 for pyramid partitions says the following:
Theorem 1.2. As $\epsilon \rightarrow 0$ , the height function of pyramid partitions converges to the $\mathbf {w}_+$ -pullback of GFF in the sense that for any $(\chi ,\kappa )\in \mathcal {L}$ , $\chi \notin \{V_0,V_1,V_2\}$ and positive real number $\alpha $ ,
in distribution.
The organization of the paper is as follows. In Section 2, we define the rail yard graph, the perfect matching and the height function, and review related technical facts. In Section 3, we discuss a class of Macdonald processes related to the probability measure of perfect matchings on the rail yard graphs. In Section 4, we compute the moments of height functions of perfect matchings on rail yard graphs by computing the observables in the generalized Macdonald processes (see Lemma 4.8). In Section 5, we study the asymptotics of the moments of the random height functions and prove their Gaussian fluctuations in the scaling limit (see Theorems 5.4 and 5.5). In Section 6, we prove an integral formula for the Laplace transform of the rescaled height function (see Theorem 6.1), which turns out to be deterministic, as a 2D analog of the law of large numbers. We further obtain a parametric equation for the frozen boundary in the scaling limit. In Section 7, we prove that the fluctuations of unrescaled height functions converge to the pull-back Gaussian free field (GFF) in the upper half plane under a diffeomorphism from the liquid region to the upper half plane (see Theorem 7.7). In Section 8, we discuss specific examples of the rail yard graphs, where the limit shapes and height fluctuations of perfect matchings can be obtained by the main results in the paper; these examples include the pure steep tilings and pyramid partitions. In Appendix A, we review some facts about Macdonald polynomials and include some known technical results.
2 Backgrounds
In this section, we define the rail yard graph, the perfect matching and the height function, and review related technical facts.
2.1 Weighted rail yard graphs
Let $l,r\in {\mathbb Z}$ such that $l\leq r$ . Let $[l..r]:=[l,r]\cap {\mathbb Z},$ (i.e., $[l..r]$ is the set of integers between l and r). For a positive integer m, we use $[m]:=\{1,2,\ldots ,m\}.$
Consider two binary sequences indexed by integers in $[l..r]$ :
-
• the $LR$ sequence $ \underline {a}=\{a_l,a_{l+1},\ldots ,a_r\}\in \{L,R\}^{[l..r]}$ ;
-
• the sign sequence $ \underline {b}=(b_l,b_{l+1},\ldots ,b_r)\in \{+,-\}^{[l..r]}$ .
The rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ with respect to integers l and r, the $LR$ sequence $ \underline {a}$ and the sign sequence $ \underline {b}$ is the bipartite graph with vertex set $[2l-1..2r+1]\times \left \{{\mathbb Z}+\frac {1}{2}\right \}$ . A vertex is called even (resp. odd) if its abscissa is an even (resp. odd) integer. Each even vertex $(2m,y)$ , $m\in [l..r]$ is incident to three edges: two horizontal edges joining it to the odd vertices $(2m-1,y)$ and $(2m+1,y)$ and one diagonal edge joining it to
-
• the odd vertex $(2m-1,y+1)$ if $(a_m,b_m)=(L,+)$ ;
-
• the odd vertex $(2m-1,y-1)$ if $(a_m,b_m)=(L,-)$ ;
-
• the odd vertex $(2m+1,y+1)$ if $(a_m,b_m)=(R,+)$ ;
-
• the odd vertex $(2m+1,y-1)$ if $(a_m,b_m)=(R,-)$ .
See Figure 6 for an example of a rail yard graph.
The left boundary (resp. right boundary) of $RYG(l,r, \underline {a}, \underline {b})$ consists of all odd vertices with abscissa $2l-1$ (resp. $2r+1$ ). Vertices which do not belong to the boundaries are called inner. A face of $RYG(l,r, \underline {a}, \underline {b})$ is called an inner face if it contains only inner vertices.
We assign edge weights to a rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ as follows:
-
• a horizontal edge has weight 1, and
-
• a diagonal edge adjacent to a vertex with abscissa $2i$ has weight $x_i$ .
2.2 Dimer coverings and pure dimer coverings
Definition 2.1. A dimer covering is a subset of edges of $RYG(l,r, \underline {a}, \underline {b})$ such that
-
1. each inner vertex of $RYG(l,r, \underline {a}, \underline {b})$ is incident to exactly one edge in the subset;
-
2. each left boundary vertex or right boundary vertex is incident to at most one edge in the subset;
-
3. only a finite number of diagonal edges are present in the subset.
A pure dimer covering of $RYG(l,r, \underline {a}, \underline {b})$ is a dimer covering of $RYG(l,r, \underline {a}, \underline {b})$ satisfying the following two additional conditions:
-
• each left boundary vertex $(2l-1,y)$ is incident to exactly one edge (resp. no edges) in the subset if $y>0$ (resp. $y<0$ ).
-
• each right boundary vertex $(2r+1,y)$ is incident to exactly one edge (resp. no edges) in the subset if $y<0$ (resp. $y>0$ ).
See Figure 6 for an example of pure dimer coverings on a rail yard graph.
For a dimer covering M on the rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ , define the associated height function $h_{M}$ on points $(x,y)\in \frac {1}{2}{\mathbb Z}\times {\mathbb Z}$ in the interior of faces of $RYG(l,r, \underline {a}, \underline {b})$ as follows. We first define a preliminary height function $\overline {h}_M$ on points $(x,y)\in \frac {1}{2}{\mathbb Z}\times {\mathbb Z}$ in the interior of faces of $RYG(l,r, \underline {a}, \underline {b})$ . As we shall see, $\overline {h}_M$ and $h_M$ satisfy the condition that for any two points $(x_1,y_1),(x_2,y_2)\in \frac {1}{2}{\mathbb Z}\times {\mathbb Z}$ in the same face f of $RYG(l,r, \underline {a}, \underline {b})$ , $h_M(x_1,y_1)=h_M(x_2,y_2)$ and $\overline {h}_M(x_1,y_1)=\overline {h}_M(x_2,y_2)$ . Hence, we also write
Note that there exists a positive integer $N>0$ such that when $y<-N$ , only horizontal edges with even vertices on the left are present. Fix a face $f_0$ of $RYG(l,r, \underline {a}, \underline {b})$ such that the midpoint of $f_0$ is on the horizontal line $y=-N$ , and define $\overline {h}_M(f_0)=0.$
For any two adjacent faces $f_1$ and $f_2$ sharing at least one edge,
-
• If moving from $f_1$ to $f_2$ crosses a present (resp. absent) horizontal edge in M with odd vertex on the left, then $\overline {h}_M(f_2)-\overline {h}_M(f_1)=1$ (resp. $\overline {h}_M(f_2)-\overline {h}_M(f_1)=-1$ ).
-
• If moving from $f_1$ to $f_2$ crosses a present (resp. absent) diagonal edge in M with odd vertex on the left, then $\overline {h}_M(f_2)-\overline {h}_M(f_1)=2$ (resp. $\overline {h}_M(f_2)-\overline {h}_M(f_1)=0$ ).
Let $\overline {h}_0$ be the preliminary height function associated to the dimer configuration $M_0$ satisfying
-
• no diagonal edge is present, and
-
• each present edge is horizontal with an even vertex on the left.
Note that $M_0$ is not a pure dimer covering.
The height function $h_{M}$ associated to M is then defined by
Let $m\in [l..r]$ . Let $x=2m-\frac {1}{2}$ be a vertical line such that all the horizontal edges and diagonal edges of $RYG(l,r, \underline {a}, \underline {b})$ crossed by $x=2m-\frac {1}{2}$ have odd vertices on the left. Let $y\in {\mathbb Z}$ . Then for each point $\left (2m-\frac {1}{2},y\right )$ in a face of $RYG(l,r, \underline {a}, \underline {b})$ , we have
where $N_{h,M}^{-}\left (2m-\frac {1}{2},y\right )$ is the total number of present horizontal edges in M crossed by $x=2m-\frac {1}{2}$ below y, and $N_{d,M}^{-}\left (2m-\frac {1}{2},y\right )$ is the total number of present diagonal edges in M crossed by $x=2m-\frac {1}{2}$ below y. From the definition of a pure dimer covering, we can see that both $N_{h,M}^{-}\left (2m-\frac {1}{2},y\right )$ and $N_{d,M}^{-}\left (2m-\frac {1}{2},y\right )$ are finite for each finite y.
Note also that $x=2m+\frac {1}{2}$ is a vertical line such that all the horizontal edges and diagonal edges of $RYG(l,r, \underline {a}, \underline {b})$ crossed by $x=2m+\frac {1}{2}$ have even vertices on the left. Then for each point $\left (2m+\frac {1}{2},y\right )$ in a face of $RYG(l,r, \underline {a}, \underline {b})$ , we have
where $J_{h,M}^{-}\left (2m+\frac {1}{2},y\right )$ is the total number of absent horizontal edges in M crossed by $x=2m+\frac {1}{2}$ below y, and $N_{d,M}^{-}\left (2m+\frac {1}{2},y\right )$ is the total number of present diagonal edges in M crossed by $x=2m+\frac {1}{2}$ below y. From the definition of a pure dimer covering we can also see that both $J_{h,M}^{-}\left (2m+\frac {1}{2},y\right )$ and $N_{d,M}^{-}\left (2m+\frac {1}{2},y\right )$ are finite for each finite y.
One may construct a graph $R^+$ whose vertices are all the points $(x,y)\in \frac {1}{2}{\mathbb Z}\times {\mathbb Z}$ in the interior of faces of $RYG(l,r, \underline {a}, \underline {b})$ , and two vertices u and v of $R^+$ are joined by an edge if and only if one of the following two conditions holds:
-
• u and v are two nearest vertices along the same horizontal line; or
-
• u and v are two nearest vertices along the same vertical line.
Then one can define a continuous function $h_M$ on the whole plane by first doing linear interpolations on the edges of $R^+$ and then doing linear interpolations on a triangulation of $R^+$ , where a triangulation of $R^+$ is obtained by dividing each face of $R^+$ into two triangles.
2.3 Partitions
A partition is a non-increasing sequence $\lambda =(\lambda _i)_{i\geq 0}$ of non-negative integers which vanish eventually. Let $\mathbb {Y}$ be the set of all the partitions. The size of a partition is defined by $|\lambda |=\sum _{i\geq 1}\lambda _i.$ Two partitions $\lambda $ and $\mu $ are called interlaced, and written by $\lambda \succ \mu $ or $\mu \prec \lambda $ if $\lambda _1\geq \mu _1\geq \lambda _2\geq \mu _2\geq \lambda _3\cdots .$ When representing partitions by Young diagrams, this means $\lambda /\mu $ is a horizontal strip. The conjugate partition $\lambda '$ of $\lambda $ is a partition whose Young diagram $Y_{\lambda '}$ is the image of the Young diagram $Y_{\lambda }$ of $\lambda $ by the reflection along the main diagonal. More precisely,
Let $len(\lambda )$ be the total number of nonzero parts in the partition $\lambda $ .
The skew Schur functions are defined in Section I.5 of [Reference Macdonald31].
Definition 2.2. Let $\lambda $ , $\mu $ be partitions. Define the skew Schur functions as
where for $r<0$ , $h_r=0$ and for $r\geq 0$ , $h_r$ is the rth complete symmetric function defined by the sum of all monomials of total degree r in the variables $x_1,x_2,\ldots $ . More precisely,
Define the Schur function as $s_{\lambda }=s_{\lambda /\emptyset }.$
For a dimer covering M of $RYG(l,r, \underline {a}, \underline {b})$ , we associate a particle-hole configuration to each odd vertex of $RYG(l,r, \underline {a}, \underline {b})$ as follows. Let $m\in [l..(r+1)]$ and $k\in {\mathbb Z}$ . If the odd endpoint $\left (2m-1,k+\frac {1}{2}\right )$ is incident to a present edge in M on its right (resp. left), then associate a hole (resp. particle) to the odd endpoint $\left (2m-1,k+\frac {1}{2}\right )$ . When M is a pure dimer covering, it is not hard to check that there exists $N>0$ , such that when $y>N$ , only holes exist and when $y<-N$ , only particles exist.
We associate a partition $\lambda ^{(M,m)}$ to the column indexed by m of particle-hole configurations, which corresponds to a pure dimer covering M adjacent to odd vertices with abscissa $(2m-1)$ as follows. Assume
Then for $i\geq 1$ , $\lambda ^{(M,m)}_i$ is the total number of holes in M along the vertical line $x=2m-1$ below the ith highest particles.
We define the charge $c^{(M,m)}$ on column $(2m-1)$ for the configuration M as follows:
The weight of a dimer covering M of $RYG(l,r, \underline {a}, \underline {b})$ is defined as follows:
where $d_i(M)$ is the total number of present diagonal edges of M incident to an even vertex with abscissa $2i$ .
Let $\lambda ^{(l)},\lambda ^{(r+1)}$ be two partitions. The partition function $Z_{\lambda ^{(l)},\lambda ^{(r+1)}}(G, \underline {x})$ of dimer coverings on $RYG(l,r, \underline {a}, \underline {b})$ whose configurations on the left (resp. right) boundary correspond to partition $\lambda ^{(l)}$ (resp. $\lambda ^{(r+1)}$ ) is the sum of weights of all such dimer coverings on the graph. Given the left and right boundary conditions $\lambda ^{(l)}$ and $\lambda ^{(r+1)}$ , respectively, the probability of a dimer covering M is then defined by
Note that pure dimer coverings have left and right boundary conditions given by
Let f be an inner face of $RYG(l,r, \underline {a}, \underline {b})$ . Let M be a dimer covering of C. If exactly half of the edges bordering f are present in M, we can obtain another dimer covering $M'$ from M, such that $M'$ and M coincide on each edge not bordering f, whereas for an edge bordering f, it is present in $M'$ if and only if it is absent in M. In particular, M and $M'$ have the same configuration on the left and right boundary. The operation of replacing M by $M'$ is called a flip of f; see Figure 7, where odd vertices are represented by red dots, and even vertices are represented by blue dots.
Then we have the following lemma.
Lemma 2.3. Let M be a pure dimer covering on the rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ . Then
Proof. Let $M_0$ be the pure dimer covering on $RYG(l,r, \underline {a}, \underline {b})$ such that
-
• all the present edges in the upper half plane are horizontal with odd vertex on the left, and
-
• all the present edges in the lower half plane are horizontal with even vertex on the left.
It is straightforward to check that in the particle-whole representation for any column in $M_0$ , the upper half plane only has holes, whereas the lower half plane only has particles. By (2.4), we obtain
By Section 2.3 of [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7] (see also [Reference Propp34]), any pure dimer covering M of $RYG(l,r, \underline {a}, \underline {b})$ can be obtained from $M_0$ by finitely many flips. The particle-hole configuration is associated to each odd vertex. The particle-hole configuration for each type of a flip is shown in Figure 7, where particles are represented by hatched circles and holes are represented by non-hatched circles. Each local particle-hole configuration is lying in two adjacent rows. The following cases might occur:
-
• both rows are in the upper half plane, or
-
• both rows are in the lower half plane or
-
• the top row is in the upper half plane, and the bottom row is in the lower half plane.
It is straightforward to check that for each one of the three cases above, and each type particle-hole configuration, the charge $c^{M,m}$ for all $m\in [l..r+1]$ remains unchanged. Then for any pure dimer covering M, $c^{(M,m)}=c^{(M_0,m)}=0.$ Then the lemma follows.
2.4 Asymptotic height function
Let M be a dimer covering of $RYG(l,r, \underline {a}, \underline {b})$ . Let $Y^{(i,M,m)}$ be the ordinate of the ith highest particle along the line $x=2m-1$ for the pure dimer covering M. Then by (2.4), we obtain
Assume $k\log t<0$ . We have
Let $x=2m-\frac {1}{2}$ and $y\notin {\mathbb Z}$ such that $(2m-\frac {1}{2},y)$ is in a face. From (2.2), we obtain
Here, for $A\subseteq {\mathbb R}$ , $\mathbf {1}_{A}(y):{\mathbb R}\rightarrow \{0,1\}$ is the indicator function for the set A (i.e., $\mathbf {1}_{A}(y)=1$ if $y\in A$ and 0 otherwise).
By (2.7), we obtain for $1\leq i\leq len(\lambda ^{(M,m)})$
Let
Note that below $B_M(m)$ , only particles are present along the vertical line $y=2m-1$ . Hence, we have
Moreover, since the charge $c^{(M,m)}=0$ , there are exactly the same number of particles on the upper half plane and holes in the lower half plane along the line $x=2m-1$ . We obtain
Then from (2.8) and (2.9), we obtain
By (2.10), we obtain
where the last identity follows from (2.11). In particular, if M is a pure dimer covering, we have
The bosonic Fock space $\mathcal {B}$ is the infinite dimensional Hilbert space spanned by the orthonormal basis vectors $|\lambda \rangle $ , where $\lambda $ runs over all the partitions. Let $\langle \lambda |$ denote the dual basis vector. Let x be a formal or a complex variable. Introduce the operators $\Gamma _{L+}(x)$ , $\Gamma _{L-}(x)$ , $\Gamma _{R+}(x)$ , $\Gamma _{R-}(x)$ from $\mathcal {B}$ to $\mathcal {B}$ as follows:
These operators were first introduced by the Kyoto school and used to study random partitions in [Reference Okounkov33].
Lemma 2.4. Let $a_1,a_2\in \{L,R\}$ . We have the following commutation relations for the operators $\Gamma _{a_1,\pm }$ , $\Gamma _{a_2,\pm }$ :
Moreover,
for all $a_1,a_2\in \{L,R\}$ and $b\in \{+,-\}$ .
Proof. See Proposition 7 of [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7]; see also [Reference Young38; Reference Betea, Boutillier, Bouttier, Chapuy, Corteel and Vuletić2].
Given the definitions of the operators $\Gamma _{a,b}(x)$ with $a\in \{L,R\}$ , $b\in \{+,-\}$ , it is straightforward to check the following lemma.
Lemma 2.5. The partition function of dimer coverings on a rail yard graph $G=RYG(l,r, \underline {a}, \underline {b})$ with left and right boundary conditions given by $\lambda ^{(l)},\lambda ^{(r+1)}$ , respectively, is
Corollary 2.6. The partition function of pure dimer coverings can be computed as follows:
where
Proof. The corollary follows from Lemma 2.5 by letting $\lambda ^{(l)}=\lambda ^{(r+1)}=\emptyset $ ; it also appears in Proposition 8 of [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7] for (2.13) and Theorem 1 of [Reference Boutillier, Bouttier, Chapuy, Corteel and Ramassamy7] for (2.14).
Remark. The partition function $Z(G; \underline {x})$ is always well-defined as a power series in $ \underline {x}$ . When we consider the edge weights $x_i$ ’s to be positive numbers, to make sure the convergence of the power series representing the partition function, we need to assume that for any $i,j\in [l..r]$ , $i<j$ , $a_i=a_j$ and $b_i=+$ , $b_j=-$ , we have $x_ix_j<1$ . However, when considering the corresponding probability measure, we do not necessarily need this assumption.
3 Macdonald Processes
In this section, we discuss a class of Macdonald processes related to the probability measure of perfect matchings on the rail yard graphs. The major characteristic of the processes defined here is that the processes involve dual partitions as well, which, as we will see, can also be obtained from certain non-function-evaluation specializations of the Macdonald processes defined without dual partitions (see [Reference Borodin and Corwin4]), when the parameters satisfy $q=t$ .
Let $G=RYG(l,r, \underline {a}, \underline {b})$ be a rail yard graph. Let $(\lambda ^{(M,l)},\lambda ^{(M,l+1)},\ldots ,\lambda ^{(M,r+1)})$ be the sequence of partitions corresponding to a dimer covering M on G. By Lemmas 2.4 and 2.5, we obtain for $i\in [l..r]$
-
1. If $(a_i,b_i)=(L,-)$ , $\lambda ^{(M,i+1)}\prec \lambda ^{(M,i)}$ ;
-
2. If $(a_i,b_i)=(L,+)$ , $\lambda ^{(M,i+1)}\succ \lambda ^{(M,i)}$ ;
-
3. If $(a_i,b_i)=(R,-)$ , $[\lambda ^{(M,i+1)}]'\prec [\lambda ^{(M,i)}]'$ ;
-
4. If $(a_i,b_i)=(R,+)$ , $[\lambda ^{(M,i+1)}]'\succ [\lambda ^{(M,i)}]'$ .
Given Definition 2.2, we can express the probability of a pure dimer covering M conditional on the left and right boundary conditions $\lambda ^{(l)}=\emptyset $ and $\lambda ^{(r+1)}=\emptyset $ , respectively, as defined by (2.5), as follows:
Now we define a generalized Macdonald process, which is a formal probability measure on sequences of partitions such that the probability of each sequence of partitions is proportional to a sum of products of skew Macdonald polynomials. See Section A for definitions of Macdonald polynomials $P_{\lambda }$ , $Q_{\lambda }$ , $P_{\lambda /\mu }$ , $Q_{\lambda /\mu }$ .
Definition 3.1. Let $\mathbf {A}=(A^{(l)},\ldots ,A^{(r+1)})$ and $\mathbf {B}=(B^{(l+1)},\ldots ,B^{(r+1)})$ be $2(r-l+1)$ set of variables, in which each $A^{(i)}$ or $B^{(j)}$ consists of countably many variables. Let $\mathcal {P}=\{\mathcal {L},\mathcal {R}\}$ be a partition of the set $[l..r]$ (i.e., $\mathcal {L}\cup \mathcal {R}=[l..r]$ and $\mathcal {L}\cap \mathcal {R}=\emptyset $ ).
Define a formal probability measure on the set of sequences of $(r-l+2)$ partitions $(\lambda ^{(l)},\lambda ^{(l+1)},\ldots ,\lambda ^{(r+1)})$ with respect to $\mathcal {P}$ , $\mathbf {A}$ and $\mathbf {B}$ and parameters $q,t\in (0,1)$ by
where for two partitions $\lambda ,\mu \in {\mathbb Y}$ , and two countable set of variables A, B,
Remark 3.2. In terms of the scalar product as defined in (A.1),
where Y is a countable set of variables.
Lemma 3.3. Consider dimer coverings on the rail-yard graph with probability measure conditional on left and right boundary conditions $\lambda ^{(l)}$ and $\lambda ^{(r+1)}$ , respectively, given by (3.1). Then the corresponding sequences of partitions form a generalized Macdonald process as in Definition 3.1 with
-
1. $\mathcal {L}=\{i\in [l..r]:a_i=L\}$ and $\mathcal {R}=\{j\in [l..r]:a_j=R\}$ ; and
-
2. For $i\in [l..r]$ ,
-
(a) if $b_i=-$ , then $A^{(i)}=\{x_i\},B^{(i+1)}=\{0\}$ ;
-
(b) if $b_i=+$ , then $A^{(i)}=\{0\},B^{(i+1)}=\{x_i\}$ ;
-
-
3. $q=t$ ,
conditional on fixed $\lambda ^{(l)}$ and $\lambda ^{(r+1)}$ on the left and right boundaries, respectively.
Proof. Note that $q=t$ implies $\Psi =\Phi $ and
When $b_i=-$ ,
and therefore,
Similarly, when $b_i=+$ ,
4 Moments of random height functions
In this section, we compute the moments of height functions of perfect matchings on rail yard graphs by computing the observables in the generalized Macdonald processes. The main result is Lemma 4.2, which implies the formula for the moments given in Lemma 4.8.
Let $\lambda \in {\mathbb Y}$ be a partition and $q,t\in (0,1)$ be parameters. Let
Lemma 4.1. For $\lambda \in {\mathbb Y}$ and $q,t\in (0,1)$ ,
Proof. Let $f_{\lambda }(q,t):=(1-t)\sum _{i\geq 1}(q^{\lambda _i}-1)t^{i-1}$ . Then $f_{\lambda }(q,t)=f_{\lambda '}(t,q)$ (see Example 1 in Sect. VI 5 of [Reference Macdonald31]). Also, note that $f(q,t)=\gamma _1(\lambda ;q,\frac {1}{t})-1$ . Finally,
Then the lemma follows.
Let
and
where $\Pi $ and $\Pi '$ are defined by (A.5). Although both $\Pi _{L,L}$ and $\Pi _{R,R}$ depend on q and t, when $q=t$ , we have
which is independent of t.
Lemma 4.2. Let $\mathrm {Pr}$ be the probability measure on pure dimer coverings of the rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ as defined by (2.5) and (2.6), and let
be the corresponding sequence of partitions. Let $l_i$ be non-negative integers for $i\in [l+1..r]$ . Then
where
$D(W;q,t)$ , $H(W,X;q,t)$ and $\Pi _{c,d}(X,Y)$ are given by (A.3), (4.2) and, (4.3) and
Note that $A^{(i)}$ and $B^{(j)}$ are specialized as in Lemma 3.3, and $W^{(i)}$ are integration variables. Furthermore, $|W^{(i)}|=l_i$ and the integral contours are given by $\{\mathcal {C}_{i,j}\}_{i\in [l+1..r],s\in [l_i]}$ such that
-
1. $\mathcal {C}_{i,s}$ is the integral contour for the variable $w^{(i)}_s\in W^{(i)}$ ;
-
2. $\mathcal {C}_{i,s}$ encloses 0 and every singular point of
$$ \begin{align*} \prod_{j\in[i..r]}\left(H(W^{(i)},(-1)^{\delta_{a_i,a_j}-1}A^{(j)};\omega(t,t,a_i)\right)^{(-1)^{\delta_{a_i,a_j}-1}}, \end{align*} $$but no other singular points of the integrand; -
3. the contour $\mathcal {C}_{i,j}$ is contained in the domain bounded by $t\mathcal {C}_{i',j'}$ whenever $(i,j)<(i',j')$ in lexicographical ordering.
Proof. By Lemma 4.1, we obtain
Recall that the Macdonald polynomials satisfy (See Page 324 of [Reference Macdonald31])
We obtain
where for each i, $Y^{(i)}$ is a countable collection of variables, and
For $i\in [l+1..r]$ , let
and
When $\lambda ^{(l)}=\lambda ^{(r+1)}=\emptyset $ and $q=t$ , we have $\mathbf {E}_l=\mathbf {E}_{r+1}=1.$ Then
Observe that for $i\in [l+1..r]$ ,
where $D_{-l_i,(A^{(i)},Y^{(i)});q,t}$ is the operator defined as in (A.2).
By Proposition A.2, we obtain for $i\in [l+1..r]$ and $q=t$ ,
-
• If $a_i=L$ ,
$$ \begin{align*} \mathbf{E}_i&=\Pi_{a_{i-1},a_i}((A^{(i)},Y^{(i)}),(Y^{(i-1)},B^{(i)}))\\ &\oint\cdots\oint D(W^{(i)};q,t)H(W^{(i)},(A^{(i)},Y^{(i)});q,t)\frac{\Pi_{a_{i-1},a_i}((Y^{(i-1)},B^{(i)}),W^{(i)})}{\Pi_{a_{i-1},a_i}((Y^{(i-1)},B^{(i)}),q^{-1}W^{(i)})}; \end{align*} $$ -
• If $a_i=R$ ,
$$ \begin{align*} \mathbf{E}_i&=\Pi_{a_{i-1},a_i}((A^{(i)},Y^{(i)}),(Y^{(i-1)},B^{(i)}))\\ &\oint\cdots\oint D\left(W^{(i)};\frac{1}{t},\frac{1}{q}\right)H\left(W^{(i)},(A^{(i)},Y^{(i)});\frac{1}{t},\frac{1}{q}\right)\frac{\Pi_{a_{i-1},a_i}((Y^{(i-1)},B^{(i)}),W^{(i)})}{\Pi_{a_{i-1},a_i}((Y^{(i-1)},B^{(i)}),tW^{(i)})}, \end{align*} $$
where each integral contour encloses $0$ and all poles of $H(W^{(i)},(A^{(i)},Y^{(i)});\omega (q,t;a_i))$ ; moreover, if $W^{(i)}=(w^{(i)}_1,w^{(i)}_2,\ldots , w^{(i)}_{l_i})$ , then along the integral contours $|w_j^{(i)}|\leq |\min \{q,t\}w_{j+1}^{(i)}|$ for each $i\in [l_i-1]$ .
Since the integrand in each $\mathbf {E}_i$ is $\Lambda _{Y^{(i)}}$ -projective, by Lemma A.11, we can interchange the order of the residue and Macdonald scalar product and obtain
Moreover, for $i\in [l+1..r]$ ,
-
• If $a_i=L$ ,
$$ \begin{align*} F_i&=\Pi_{a_{i-1},a_i}(A^{(i)},Y^{(i-1)})\cdot\Pi_{a_{i-1},a_i}(Y^{(i-1)},Y^{(i)})\cdot \Pi_{a_{i-1},a_i}(Y^{(i)},B^{(i)})\\ &\times H(W^{(i)},Y^{(i)};q,t)\frac{\Pi_{a_{i-1},a_i}(Y^{(i-1)},W^{(i)})}{\Pi_{a_{i-1},a_i}(Y^{(i-1)},q^{-1}W^{(i)})}; \end{align*} $$ -
• If $a_i=R$ ,
$$ \begin{align*} F_i&=\Pi_{a_{i-1},a_i}(A^{(i)},Y^{(i-1)})\cdot\Pi_{a_{i-1},a_i}(Y^{(i-1)},Y^{(i)})\cdot \Pi_{a_{i-1},a_i}(Y^{(i)},B^{(i)})\\ &\times H\left(W^{(i)},Y^{(i)};\frac{1}{t},\frac{1}{q}\right)\frac{\Pi_{a_{i-1},a_i}(Y^{(i-1)},W^{(i)})}{\Pi_{a_{i-1},a_i}(Y^{(i-1)},tW^{(i)})}; \end{align*} $$
and $F_l=F_{r+1}=1.$
By Lemmas A.6 and A.4, we obtain
Then the lemma follows by inductively computing the scalar product
and applying Lemmas 4.4 and 4.5. Note that factors $\Pi _{a_i,a_j}(B^{(i+1)},A^{(j)})$ cancel out with $1/\mathcal {Z}$ since the partition function for the Macdonald process with empty partitions on both ends is
Remark 4.3. Using similar arguments, we can also obtain the following formula.
where $D(W;q,t)$ , $H(W,X;q,t)$ and $\Pi _{c,d}(X,Y)$ are given by (A.3), (4.2) and (4.3), and
Furthermore, $|W^{(i)}|=l_i$ and the integral contours are given by $\{\mathcal {C}_{i,j}\}_{i\in [l+1..r],s\in [l_i]}$ such that
-
1. $\mathcal {C}_{i,s}$ is the integral contour for the variable $w^{(i)}_s\in W^{(i)}$ ;
-
2. $\mathcal {C}_{i,s}$ encloses 0 and every singular point of
$$ \begin{align*} \prod_{j\in[i..r]}\left(H(W^{(i)},(-1)^{\delta_{a_i,a_j}-1}A^{(j)};t,t)\right)^{(-1)^{\delta_{a_i,a_j}-1}}, \end{align*} $$but no other singular points of the integrand; -
3. the contour $\mathcal {C}_{i,j}$ is contained in the domain bounded by $t\mathcal {C}_{i',j'}$ whenever $(i,j)<(i',j')$ in lexicographical ordering.
Lemma 4.4. Let $c_1,c_2,c_3\in \{L,R\}$ . Let $A,B,Y$ be three collections of countably many variables. Then we have
where if $c_2=L$ (resp. $c_2=R$ ), the scalar product $\langle \cdot ,\cdot \rangle $ is with respect to $(q,t)$ (resp. $(t,q)$ ).
Lemma 4.5. For $i\in [l+2..r]$ , and $j\in [i..r]$ , let
where in $\mathcal {G}$ , the scalar product $\langle \cdot ,\cdot \rangle $ is with respect to $(q,t)$ if $a_{i-1}=L$ and with respect to $(t,q)$ if $a_{i-1}=R$ ; and $\omega $ , $\xi $ are defined as in (4.4). Assume $q=t$ . Then $\mathcal {G}$ is equal to
Proof. The lemma follows from Lemma A.6 with
Lemma 4.6. Let $\mathrm {Pr}$ be the probability measure on pure dimer coverings of the rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ as defined by (2.5) and (2.6), and let
be the corresponding sequence of partitions. Let $l_i$ be non-negative integers for $i\in [l+1..r]$ . Then
where $|W^{(i)}|=l_i$ , and the integral contours are given by $\{\mathcal {C}_{i,j}\}_{i\in [l+1..r],s\in [l_i]}$ , satisfying the condition as described in Lemma 4.2.
Proof. This proof follows from Lemmas 4.2 and 3.3(2) and $H(X,\{0\};q,t)=1$ and $\Pi _{a,b}(X,\{0\})=\Pi _{a,b}(\{0\},X)=1$ .
To compute the moments of $\gamma $ s, we need to generalize Lemma 4.6 and find expectation of powers of $\gamma $ s. We use the following auxiliary lemma, which is straightforward from the properties of Macdonald functions.
Lemma 4.7. Let $\mathbf {A}$ , $\mathbf {B}$ be defined as in Definition 3.1. For each $i\in [l..r]$ , let $\Lambda _{A^{(i)}}$ , (resp. $\Lambda _{B^{(i+1)}}$ ) be the algebra of symmetric functions on $A^{(i)}$ (resp. $B^{(i+1)}$ ) over ${\mathbb C}$ . Define a map
by
Define a formal measure
Then for any sequence of partitions $(\lambda ^{(l)},\lambda ^{(l+1)},\ldots ,\lambda ^{(r+1)})\in {\mathbb Y}^{r-l+2}$ in the support of $M^{(i)}$ , we have $\lambda ^{(i)}=\lambda ^{(i+1)}$ . Moreover, for all $i\in [l..r]$ , let
and
so that $\{\widehat {\mathcal {L}}^{(i)},\widehat {\mathcal {R}}^{(i)}\}$ form a partition $\mathcal {P}'$ of $[l..r]\setminus \{i\}$ . Then the restriction of $M^{(i)}$ to
is the formal Macdonald process $\mathbb {MP}_{\widehat {A}^{(i)},\widehat {B}^{(i)},\mathcal {P}',q,t}$ .
Lemma 4.8. Let $i_1\leq i_2\leq \ldots \leq i_m\in [l+1..r]$ , and let $l_1,\ldots ,l_m>0$ be integers. Let $I:=\{i_1,i_2,\ldots ,i_m\}$ . Then
where $|W^{(i)}|=l_i$ , and the integral contours are given by $\{\mathcal {C}_{i,j}\}_{i\in I,s\in [l_i]}$ , satisfying the condition as described in Lemma 4.2.
Proof. The proof is the same as in [Reference Borodin, Corwin, Gorin and Shakirov5], where Corollary 3.11 is derived from Theorem 3.10. The idea is to apply Lemma 4.2 to an auxiliary Macdonald process $ \left .\mathbb {MP}_{\mathbf {C},\mathbf {D},\mathcal {P}_*,q,t}\right |{}_{\mu ^{(0)}=\mu ^{(r-l+m+1)}=\emptyset }$ , where parameters $\mathbf {C}$ and $\mathbf {D}$ consist of $r-l+m$ variables and the additional indices correspond to copies of $i_j$ for $j\in [m]$ . The expectation formula from Lemma 4.2 restricted to the original process, as in Lemma 4.7, gives the desired formula. For details, see the proof of Corollary 3.11 in [Reference Borodin, Corwin, Gorin and Shakirov5].
5 Asymptotics
In this section, we study the asymptotics of the moments of the random height functions and prove its Gaussian fluctuation in the scaling limit. More precisely, we study the limit of the moments of the observables obtained in the previous section. The main results are given in Theorem 5.4 and Theorem 5.5. We first specify the conditions under which the limit is taken.
We consider a sequence of rail yard graphs that depend on $\epsilon $ and study the limit when $\epsilon \to 0$ . The conditions can be split in three groups: an assumption on piecewise periodicity of the graphs, which are described by the sequences $ \underline {a}$ and $ \underline {b}$ , assumption on periodicity of weights, which allows for periodic non-uniform weights on diagonal edges in the q-volume analog of the uniform model, and the limit regime, which contains further assumptions under which the limit is taken.
Assumption 5.1. Let $\{RYG(l^{(\epsilon )},r^{(\epsilon )}, \underline {a}^{(\epsilon )}, \underline {b}^{(\epsilon )})\}_{\epsilon>0}$ be a sequence of rail yard graphs with the weights of diagonal edges incident with $x=2i$ given with $x_i^{(\epsilon )}$ .
-
1. Piecewise periodicity of the graph. For a positive integer n and real numbers $V_0<V_1<\ldots <V_m$ , we say that a given sequence of rail yard graphs is n-periodic with transition points $V_0, V_1, \dots ,V_m$ as $\epsilon \rightarrow 0$ if
-
(a) For each $\epsilon>0$ , there exist integer multiples of n
$$ \begin{align*} l^{(\epsilon)}=v_0^{(\epsilon)}<v_1^{(\epsilon)}<\ldots<v_m^{(\epsilon)}=r^{(\epsilon)}, \end{align*} $$such that $\lim _{\epsilon \rightarrow 0}\epsilon v_p^{(\epsilon )}=V_p,\ \forall p\in \{0\}\cup [m].$ -
(b) The sequence $ \underline {a}^{(\epsilon )}$ is n-periodic on $\left [l^{(\epsilon )},r^{(\epsilon )}\right ]$ and does not depend on $\epsilon $ . More precisely, there exist $a_1, a_2, \dots , a_n \in \{L,R\}$ such that
$$ \begin{align*} a_i^{(\epsilon)}=a_{i_{\equiv_n}}, \end{align*} $$where $i_{\equiv _n}\in [n]$ is in the same congruence class modulo n as i. -
(c) For each $p\in [m]$ , the sequence $ \underline {b}^{(\epsilon )}$ is n-periodic on $(v_{p-1}^{(\epsilon )},v_{p}^{(\epsilon )})$ and does not depend on $\epsilon $ , but it may depend on p. More precisely, there exist $b_{p,1}, b_{p,2}, \dots , b_{p,n} \in \{+,-\}$ such that for $i\in (v_{p-1}^{(\epsilon )},v_{p}^{(\epsilon )})$ ,
$$ \begin{align*} b_i^{(\epsilon)}=b_{p,i_{\equiv_n}}. \end{align*} $$
-
-
2. Periodicity of weights. The weights $x_i^{(\epsilon )}$ are periodic q-volume weights. Precisely, let $k\in [n]$ such that
$$ \begin{align*} k:=i_{\equiv_n}. \end{align*} $$Then $x_i^{(\epsilon )}$ are given with$$ \begin{align*} x_i^{(\epsilon)}=\begin{cases} e^{-\epsilon(i-k)}\tau_k,& b_i^{(\epsilon)}=+\\ e^{\epsilon(i-k)}\tau^{-1}_k,& b_i^{(\epsilon)}=- \end{cases}. \end{align*} $$ -
3. Limit regime.
-
(a) Assume that $\lim _{\epsilon \rightarrow 0}t=1$ in a such a way that
$$ \begin{align*} \lim_{\epsilon\rightarrow 0}-\frac{\log t}{n \epsilon}=\beta, \end{align*} $$where $\beta $ is a positive real number independent of $\epsilon $ . -
(b) Let s be a positive integer and assume that for $d \in [s]$ , the sequence $i_d^{(\epsilon )}\in [l^{(\epsilon )}..r^{(\epsilon )}]$ satisfies
$$ \begin{align*} \lim_{\epsilon\rightarrow 0}\epsilon i_d^{(\epsilon)}=\chi_d, \end{align*} $$for $\chi _1\leq \chi _2\leq \ldots \leq \chi _s$ and that $i_d^{(\epsilon )}\,\mathrm {mod}\, n$ does not depend on $\epsilon $ – that there exist $i^*_1, i^*_2, \dots , i^*_s \in [n]$ such that$$ \begin{align*} (i_d^{(\epsilon)})_{\equiv_n} = i^*_d. \end{align*} $$If $s=1$ , we drop the index (i.e., we assume that $\lim _{\epsilon \rightarrow 0}\epsilon i^{(\epsilon )}=\chi $ and $(i^{(\epsilon )})_{\equiv _n} = i^*$ ).
-
Lemma 5.2. Under the same conditions as in Lemma 4.8 and assuming the index set I is a subset of $\mathcal {L}$ ,
where $|W^{(i)}|=l_i$ , and the integral contours are given by $\{\mathcal {C}_{i,j}\}_{i\in I,s\in [l_i]}$ , satisfying the condition as described in Lemma 4.2, where
We apply this lemma to the sequence of rail yard graphs depending on $\epsilon $ and consider the limit of it under the assumption stated above. To shorten the notation, we use the following abbreviations:
The limit of these functions is given by the following lemma.
Lemma 5.3. Suppose Assumption 5.1 holds. Then
where
Here, the logarithmic branches for $\mathcal {G}_{1,>\chi }$ , $\mathcal {G}_{1,<\chi }$ , $\mathcal {G}_{0,>\chi }$ , $\mathcal {G}_{0,<\chi }$ are chosen so that when z approaches the positive real axis, the imaginary part of $\log z$ approaches 0.
Proof. For $p\in [m]$ , $j\in [n]$ and $i\in [l^{(\epsilon )}..r^{(\epsilon )}]$ , let
Let $N_{j,p,>i,1}^{(\epsilon )}$ , $N_{j,p,<i,1}^{(\epsilon )}$ , $N_{j,p,>i,0}^{(\epsilon )}$ and $N_{j,p,<i,0}^{(\epsilon )}$ be their cardinalities, respectively, and
where we take the convention that the minimum (resp. maximum) of an empty set is $\infty $ (resp. $-\infty $ ) and define $x_{-\infty }^{(\epsilon )}=x_{\infty }^{(\epsilon )}:=0$ for all $\epsilon \geq 0.$
Then using the above notation, we can rewrite $G^{(\epsilon )}_{1,>i}(W)$ as
which can be further rewritten as
where
Similarly, we have
Assume now that $i=i^{(\epsilon )}$ vary with $\epsilon $ and satisfies the assumptions. For convenience, we continue writing i instead of $i^{(\epsilon )}$ . By Lemma A.12, we obtain as $\epsilon \to 0$ ,
where when $W\in {\mathbb C}^k$ , we choose the branch such that when a complex number approaches the positive real line, its argument approaches 0.
Note that for nonempty $I^{(\epsilon )}_{j,p,>i,1}$ , $I^{(\epsilon )}_{j,p,<i,1}$ , $I^{(\epsilon )}_{j,p,>i,0}$ and $I^{(\epsilon )}_{j,p,<i,0}$ , we have
Also note that
This proves the lemma.
For $w\in {\mathbb C}$ and $\chi \in {\mathbb R}$ , define
We shall obtain asymptotic results in Theorems 5.4 and 5.5. In Theorems 5.4 and 5.5, we consider only the moments at points when $a_{i^{(\epsilon )}}=L$ ; these moments are sufficient to prove that the fluctuations of height functions converge to GFF in the scaling limit. The moments at points when $a_{i^{(\epsilon )}}=R$ may be obtained similarly.
Theorem 5.4. Suppose Assumption 5.1 holds. Assume $a_{i^{(\epsilon )}}=L$ for all $\epsilon>0$ . Let $\mathrm {Pr}^{(\epsilon )}$ be the corresponding probability measure. Then
where the contour is positively oriented (which may be a union of disjoint simple closed curves), enclosing $0$ and every pole of $\mathcal {G}_{1,>{\chi }}$ and $\mathcal {G}_{0,>\chi }$ , but does not enclose any other poles or zeros of $\mathcal {G}_{\chi }$ – the expression
where the branch of $\log F$ is the one which takes positive real values when F is positive and real.
Proof. By Lemma 5.2,
where for $1\leq i\leq k$ , $\mathcal {C}_i^{(\epsilon )}$ is the integral contour for $w_i$ , and $\mathcal {C}_1^{(\epsilon )},\ldots ,\mathcal {C}_k^{(\epsilon )}$ satisfy the conditions as described in Lemma 4.2. As $\epsilon \rightarrow 0$ , assume that $\mathcal {C}_1^{(\epsilon )},\ldots ,\mathcal {C}_k^{(\epsilon )}$ converge to contours $\mathcal {C}_1,\ldots ,\mathcal {C}_k$ , respectively, such that $\mathcal {C}_1,\ldots \mathcal {C}_k$ are separated from one another and do not cross any of the singularities of the integrand. By Lemma 5.3, we obtain
Theorem 5.5. Suppose Assumption 5.1 holds. Assume that
Let $\mathrm {Pr}^{(\epsilon )}$ be the corresponding probability measure and
Then $(Q_{k_1}^{(\epsilon )}(\epsilon i_1^{(\epsilon )}),\dots ,Q_{k_s}^{(\epsilon )}(\epsilon i_s^{(\epsilon )})) $ converges in distribution to the centered Gaussian vector
as $\epsilon \rightarrow 0$ , whose covariances are
where
-
• the z-contour ${\mathcal {C}_d}$ is positively oriented enclosing $0$ and every pole of $\mathcal {G}_{1,>\chi _d}\cup \mathcal {G}_{0,>\chi _d}$ , but does not enclose any other poles or zeros of $\mathcal {G}_{\chi _d}(z)$ ;
-
• the w-contour ${\mathcal {C}_h}$ is positively oriented enclosing $0$ and every pole of $\mathcal {G}_{1,>\chi _h}\cup \mathcal {G}_{0,>\chi _h}$ , but does not enclose any other poles or zeros of $\mathcal {G}_{\chi _h}(w)$ ;
-
• the z-contour ${\mathcal {C}_d}$ and the w-contour ${\mathcal {C}_h}$ are disjoint;
-
• the branch of logarithmic function is chosen to take positive real values along the positive real axis.
To prove Theorem 5.5, we shall compute the moments of $Q_{k_d}^{(\epsilon )}(\epsilon i_d^{(\epsilon )})$ and show that these moments satisfy Wick’s formula in the limit as $\epsilon \rightarrow 0$ . We start with the following lemma about covariance.
Lemma 5.6. Let $d,h\in [s]$ . Under the assumptions of Theorem 5.5, we have
where the z-contour $\mathcal {C}_d$ and the w-contour $\mathcal {C}_h$ satisfy the same conditions as in Theorem 5.5.
Proof. Note that $\mathrm {Cov}\left [Q_{k_d}^{(\epsilon )}(\epsilon i_d^{(\epsilon )}) Q_{k_h}^{(\epsilon )}(\epsilon i_h^{(\epsilon )})\right ]$ is equal to
For $W=(w_1,\dots ,w_k)$ , we use abbreviation
Note that for $\epsilon i^{(\epsilon )}\to \chi $ and $t\to 1$ ,
By Lemma 5.2, we obtain that $\mathrm {Cov}\left [Q_{k_d}^{(\epsilon )}(\epsilon i_d^{(\epsilon )}),Q_{k_h}^{(\epsilon )}(\epsilon i_h^{(\epsilon )})\right ]$ is equal to
where $T_{L,L}(Z,W)$ is given by (5.3), $|W^{(i_d^{(\epsilon )})}|=k_d$ , $|W^{(i_h^{(\epsilon )}}|=k_h$ and for $1\leq i\leq k_d$ (resp. $1\leq j\leq k_h$ ), $\mathcal {C}_{1,i}^{(\epsilon )}$ (resp. $\mathcal {C}_{2,j}^{(\epsilon )}$ ) is the integral contour for $w_i^{(i_d^{(\epsilon )})}$ (resp. $w_j^{(i_h^{(\epsilon )})}$ ), and $\mathcal {C}_{1,1}^{(\epsilon )},\ldots ,\mathcal {C}_{1,k_d}^{(\epsilon )}$ , $\mathcal {C}_{2,1}^{(\epsilon )},\ldots ,\mathcal {C}_{2,k_h}^{(\epsilon )}$ satisfy the conditions as described in Lemma 4.2. As $\epsilon \rightarrow 0$ , assume that $\mathcal {C}_1^{(\epsilon )},\ldots ,\mathcal {C}_k^{(\epsilon )}$ converge to contours $\mathcal {C}_1,\ldots ,\mathcal {C}_k$ , respectively, such that $\mathcal {C}_1,\ldots \mathcal {C}_k$ are separated from one another and do not cross any of the singularities of the integrand.
Note that
Under Assumption 5.1, we obtain
Therefore,
In the above formula, the main contribution comes from one-element subsets S, whereas the others have a negligible $o(\epsilon )$ contribution. This together with (5.12) gives that the limit of $\mathrm {Cov}\left [Q_{k_d}^{(\epsilon )}(\epsilon i_d^{(\epsilon )}), Q_{k_h}^{(\epsilon )}(\epsilon i_h^{(\epsilon )})\right ]$ is equal to the limit of
Then by Lemma A.13, we have
Applying Lemma A.13 again to integrals over $\mathcal {C}_{1,1}^{(\epsilon )}$ , …, $\mathcal {C}_{1,k_d}^{(\epsilon )}$ , we obtain the result.
Lemma 5.7. Suppose the assumptions of Theorem 5.5 hold.
-
1. Let $s\in {\mathbb N}$ be odd, and $s\geq 3$ . Then
$$ \begin{align*} &\lim_{\epsilon\rightarrow 0}\mathbb{E}_{\mathrm{Pr}^{(\epsilon)}}\left[\prod_{u=1}^{s}Q_{k_{u}}^{(\epsilon)}(\epsilon i_u^{(\epsilon)})\right]=0. \end{align*} $$ -
2. If $s\in {\mathbb N}$ is even, then
$$ \begin{align*} &\lim_{\epsilon\rightarrow 0}\mathbb{E}_{\mathrm{Pr}^{(\epsilon)}}\left[\prod_{u=1}^{s}Q_{k_{u}}^{(\epsilon)}(\epsilon i_u^{(\epsilon)})\right]=\lim_{\epsilon\rightarrow 0}\sum_{P\in\mathcal{P}_{s}^2}\prod_{u,v\in P}\mathbb{E}_{\mathrm{Pr}^{(\epsilon)}}\left[ Q_{k_{u}}^{(\epsilon)}(\epsilon i_u^{(\epsilon)}) Q_{k_{v}}^{(\epsilon)}(\epsilon i_v^{(\epsilon)}) \right], \end{align*} $$where the sum runs over all pairings of $[s]$ .
Proof. Note that
When computing $\mathbb {E}\left [\prod _{u=1}^{s}Q_{k_{u}}^{(\epsilon )}(\epsilon i_u^{(\epsilon )})\right ]$ by Lemma 5.2, in the integrand there is a factor
which is by (5.3) equal to
Under the assumptions, (5.13) is true. Let
where $C^{(\epsilon )}_{u,v,j,f}$ tends to a constant as $\epsilon \to 0$ . Let
Then (5.14) is equal to
Note that $\sum _{J\subseteq [s]}(-1)^{\left |[s]\setminus J\right |}=0$ . For each fixed $H\subseteq K_{\emptyset }$ , if $H\neq K_{\emptyset }$ , let
The sum of terms with $\prod _{(u,v,j,f)\in H}C_{u,v,j,f}^{(\epsilon )}$ in (5.15) is
As long as $H_0\neq S$ , the sum of $(-1)^{|[s]\setminus J|}$ over all the subsets of $[s]\setminus H_0$ is 0. Therefore, (5.15) is equal to
-
1. If s is odd, as $\epsilon \rightarrow 0$ ,
$$ \begin{align*} \sum_{\emptyset\neq H\subseteq K_{\emptyset}, H_0=[s]}\epsilon^{2|H|}\prod_{(u,v,j,f)\in H}C_{u,v,j,f}^{(\epsilon)}=O(\epsilon^{s+1}); \end{align*} $$therefore,$$ \begin{align*} \lim_{\epsilon\rightarrow 0}\frac{1}{\epsilon^s}\sum_{J\subseteq [s]}(-1)^{\left|[s]\setminus J\right|}\prod_{u<v;u,v\in[s]\setminus J}T_{L,L}(W^{(i_u^{(\epsilon)})},W^{(i_v^{(\epsilon)})})=0. \end{align*} $$ -
2. If s is even, as $\epsilon \rightarrow 0$ ,
$$ \begin{align*} &\sum_{\emptyset\neq H\subseteq K_{\emptyset}, H_0=[s]}\epsilon^{2|H|}\prod_{(u,v,j,f)\in H}C_{u,v,j,f}^{(\epsilon)}\\ &=\epsilon^{s}\sum_{P\in \mathcal{P}_s^2}\prod_{(u,v)\in \mathcal{P}}\prod_{{(j,f):w_j^{(u)}\in W^{(i_u^{(\epsilon)})}, w_j^{(v)}\in W^{(i_v^{(\epsilon)})}}}C_{u,v,j,f}^{(\epsilon)} + O(\epsilon^{s+1})\\ &=\epsilon^{s}\sum_{P\in \mathcal{P}_s^2}\prod_{(u,v)\in \mathcal{P}} \left(\frac{1}{\epsilon^2}T_{L,L}(W^{(i_u^{(\epsilon)})},W^{(i_v^{(\epsilon)})})\right). \end{align*} $$
Then the lemma follows.
Proof of Theorem 5.5 . The theorem follows from Lemmas 5.6 and 5.7.
6 Frozen boundary
In this section, we prove an integral formula for the Laplace transform of the rescaled height function (see Theorem 6.1), which turns out to be deterministic, as a 2D analog of the law of large numbers. We further obtain an explicit formula for the frozen boundary in the scaling limit.
Theorem 6.1. Let M be a random pure dimer covering on the rail yard graph $RYG(l,r, \underline {a}, \underline {b})$ with probability distribution given by (2.5) and (2.6). Let $h_M$ be the height function associated to M as defined in (2.1). Suppose Assumption 5.1 holds. Then the rescaled random height function $\epsilon h_M\left (\frac {\chi }{\epsilon },\frac {\kappa }{\epsilon }\right )$ converges, as $\epsilon \rightarrow 0$ , to a non-random function $\mathcal {H}(\chi ,\kappa )$ such that the Laplace transform of $\mathcal {H}(\chi ,\cdot )$ is given by
where $\alpha $ is a positive real number and the contour $\mathcal {C}$ satisfies the conditions of Theorem 5.4. Here,
and the branch of $\log (\zeta ) $ is chosen to be real positive when $\zeta $ is real positive. Note that the right-hand side is non-random.
Proof. Let $\frac {\kappa }{\epsilon }=y$ . By Theorem 5.4, (2.12) and (4.1), we obtain
To show that the limit, as $\epsilon \rightarrow 0$ , of $\int _{-\infty }^{\infty } e^{-n\beta \kappa k}\epsilon h_{M}\left (\frac {\chi }{\epsilon },\frac {\kappa }{\epsilon }\right )d\kappa $ is non-random, it suffices to show that the limit of its variance is 0. Note that
where the last identity follows from Lemma 5.6 and the limit regime stated in Assumption 5.1. Let $\alpha =k\beta $ and consider analytic continuation if necessary. Then the theorem follows.
By (6.1), for $\alpha>0$ , we obtain
Let $\mathbf {m}_{\chi }$ be the measure on $(0,\infty )$ defined by
We are particularly interested in the measure $\mathbf {m}_{\chi }$ because its density with respect to the Lebesgue measure on ${\mathbb R}$ is given by
which is exactly the slope of the limiting rescaled height function in the $\kappa $ -direction when $s=e^{-\kappa }$ .
By (6.2), we deduce that for any $\chi \in (l^{(0)},r^{(0)})$ , $\int _{0}^{\infty }\mathbf {m}_{\chi }(d s)<\infty $ (i.e., $\mathbf {m}_{\chi }(d s)$ is a measure on ${\mathbb R}$ with finite total mass). Note also that for any positive integer j, by (6.2), we obtain
where $C>0$ is a positive constant independent of j. Hence, we obtain
as $j\rightarrow \infty $ . Hence, we obtain that $\mathbf {m}_{\chi }(ds)$ has compact support in $(0,\infty )$ .
We shall now compute the density of the measure $\mathbf {m}_{\chi }(ds)$ with respect to the Lebesgue measure on ${\mathbb R}$ . It is a classical fact about Stieltjes transform that
where $\Im $ denotes the imaginary part of a complex number and $\mathrm {St}_{\mathbf {m}_{\chi }}$ is the Stieltjes transform of the measure $\mathbf {m}_{\chi }$ , which can be computed as follows: for $\zeta \in {\mathbb C}\setminus \mathrm {supp}(\mathbf {m}_{\chi })$ ,
Again, by (6.2), we obtain
Let $\mathcal {R}_\chi $ denote the set of all poles of $\mathcal {G}_{1,>\chi }$ and $\mathcal {G}_{0,>\chi }$ . When the contour $\mathcal {C}$ satisfies the conditions given as in Theorem 5.4, we can split $\mathcal {C}$ into a positively oriented simple closed curve $\mathcal {C}_0$ enclosing only 0, and a union $\mathcal {C}_1$ of positively oriented simple closed curves enclosing every point in $\mathcal {R}_\chi $ . By the residue theorem, we obtain that
Moreover,
where $\left |\frac {[\mathcal {G}_{\chi }(0)]^{\frac {1}{n}}}{\zeta }\right |<1$ and $\max _{\zeta \in \mathcal {C}_1}\left |\frac {[\mathcal {G}_{\chi }(\zeta )]^{\frac {1}{n}}}{\zeta }\right |<1$ to ensure the convergence of Maclaurin series. Hence, we have
We would like to get rid of the fractal exponent for the simplicity of computing complex integrals. To that end, we define another function
Let $\omega =e^{\frac {2\pi \mathbf {i}}{n}}$ . Then it is straightforward to check that $ \Theta _{\chi }(\zeta )=\sum _{i=0}^{n-1}\mathrm {St}_{\mathbf {m}_{ \chi }}(\omega ^{-i}\zeta )$ . Then we obtain
Since $\mathrm {St}_{\mathbf {m}_{\chi }}(\zeta )$ is continuous in $\zeta $ when $\zeta \in {\mathbb C}\setminus \mathrm {supp}(\mathbf {m}_{\chi })$ , $\mathrm {supp}(\mathbf {m}_{\chi })\in (0,\infty )$ and $\mathrm {St}_{\mathbf {m}_{\chi }}(\overline {\zeta })= \overline {\mathrm {St}_{\mathbf {m}_{\chi }}(\zeta )}$ , we obtain that when $s\in \mathrm {supp}(\mathbf {m}_{\chi })$ ,
Hence, by (6.3), to compute the slope of the limiting rescaled height function in the $\kappa $ -direction, it suffices to compute $-\frac {1}{\pi }\lim _{\epsilon \rightarrow 0+}\Im \Theta _{\chi }(s+\mathbf {i}\epsilon )$ when $s=e^{-\kappa }$ .
By (6.5), we obtain
To compute the contour integral above, we need to consider the root of the following equation in w:
and in particular, the roots of (6.8) that are enclosed by the contour $\mathcal {C}_1$ . Recall that $\mathcal {C}_1$ is the union of positively oriented simple closed curves enclosing every point in $\mathcal {R}_{\chi }$ but no other poles or zeros $\mathcal {G}_{\chi }$ . We may assume
where $\mathcal {C}_{\xi }$ is a positively oriented simple closed curve enclosing $\xi $ but no other poles or zeros of $\mathcal {G}_{\chi }$ .
When $\zeta \rightarrow \infty $ , zeros of (6.8) will approach poles of $\mathcal {G}_{\chi }$ . For each $\xi \in \mathcal {R}_{\chi }$ , let $w_{\xi ,\chi }(\zeta )$ be a root of (6.8) such that $\lim _{\zeta \rightarrow \infty }w_{\xi ,\chi }(\zeta )=\xi $ .
When $|\zeta |$ is sufficiently large, $w_{\xi ,\chi }(\zeta )$ is enclosed by $\mathcal {C}_{\xi }$ . Enclosed by each $\mathcal {C}_{\xi }$ , there is exactly one zero and one pole for $1-\frac {\mathcal {G}_{\chi }(w)}{\zeta ^n}$ . Hence,
By computing residues at each $w_{\xi ,\chi }(\zeta )$ and $\xi $ , we obtain
We now want to establish conditions under which (6.8) has at most one pair of complex conjugate roots. For that, we need to consider zeros and poles of $\mathcal {G}_{1,>\chi }(w)$ , $\mathcal {G}_{1,<\chi }(w)$ , $\mathcal {G}_{0,>\chi }(w)$ and $\mathcal {G}_{0,<\chi }(w)$ . Our goal will be to fully separate zeros and poles of each function from the zeros and poles of the others. By this, we mean that all zeros and poles of of one function are either all to the left or all to the right of all zeros and poles of the other. We will further require that zeros and poles for each function alternate (i.e., that sorted from smallest to largest, we have that a zero is followed by a pole and vice versa). More precisely, we will look for conditions so that $\mathcal {G}_\chi $ has poles and zeros positioned as in Figure 8 or as in Figure 9.
Conditions needed to satisfy the separating property and alternating property are stated in Assumption 6.2. The analysis in Remark 6.4 justifies the conditions from Assumption 6.2.
Assumption 6.2. Let $i,j\in [n]$ and $p_1,p_2 \in [m]$ .
-
1. Separating condition. For $b_{p_1,i}=-$ , $b_{p_2,j}=+$ and $a_j=a_i$ , it holds that
(6.11) $$ \begin{align} \tau_{i}^{-1}\tau_{j}& \begin{cases}\geq e^{V_{p_2}-V_{p_1-1}},&{if} \ p_1>p_2\\ >1,&{if} \ p_1=p_2 \end{cases}. \end{align} $$ -
2. Alternating condition. For $b_{p_1,i}=b_{p_2,j}$ , $a_i=a_j$ , and $\tau _{i}> \tau _{j}$ , it holds that
$$ \begin{align*} \tau_{i}^{-1}\tau_{j}< e^{V_{p_2-1}-V_{p_1}}. \end{align*} $$ -
3. Alternatively, we can assume that instead of (6.11), it holds that
(6.12) $$ \begin{align} \tau_{i}^{-1}\tau_{j}< e^{V_{p_2-1}-V_{p_1}},\quad {if} \ p_1\geq p_2. \end{align} $$
Remark 6.3. Note that in the uniform case, Assumption 6.2 is satisfied if between any two transition points, all Ls have the same sign and all Rs have the same sign (not necessarily the same as Ls). More precisely, if for all $i,j\in [n]$ and $p \in [m]$ , $a_i=a_j$ implies $b_{p,i}=b_{p,j}$ .
When we say Assumption 6.2 holds, we mean either Assumption 6.2(1)(2) hold, or Assumption 6.2(2)(3) hold.
In the remark below, we justify Assumption 6.2.
Remark 6.4. Let $\mathrm {x}$ stand for one of the following 4 cases: $1,>\chi $ ; $1,<\chi $ ; $0,>\chi $ ; or $0,<\chi $ . We denote the set of poles and zeros of $\mathcal {G}_{\mathrm {x}}$ with $\mathcal {P}_{\mathrm {x}}$ and $\mathcal {Z}_{\mathrm {x}}$ , respectively. We have that $\mathcal {Z}_{\mathrm {x}}=\mathcal {N} _{\mathrm {x}}\setminus \mathcal {D}_{\mathrm {x}}$ and $\mathcal {P}_{\mathrm {x}}=\mathcal {D} _{\mathrm {x}}\setminus \mathcal {N}_{\mathrm {x}}$ , where $\mathcal {D} _{\mathrm {x}}$ , respectively $\mathcal {N}_{\mathrm {x}}$ , denotes the set of points where the denominator, respectively numerator, of $\mathcal {G}_{\mathrm {x}}$ vanishes. Further, $\mathcal {D}_{\mathrm {x}}= \bigcup _{j\in [n]}\mathcal {D}_{j,\mathrm {x}}$ and $\mathcal {N}_{\mathrm {x}}= \bigcup _{j\in [n]}\mathcal {N}_{j,\mathrm {x}}$ , where
Note that zeros and poles of $\mathcal {G}_{\mathrm {x}}$ are positive when $\mathrm {x}$ is $1,>\chi $ or $1,<\chi $ and they are negative when $\mathrm {x}$ is $0,>\chi $ or $0,<\chi $ .
Observe that when sorted from smallest to largest, points $\mathcal {D}_{j,1,>\chi }\setminus \mathcal {N}_{j,1,>\chi }$ and $\mathcal {N}_{j,1,>\chi }\setminus \mathcal {D}_{j,1,>\chi }$ alternate: the smallest point is from $\mathcal {D}_{j,1,>\chi }\setminus \mathcal {N}_{j,1,>\chi }$ and the largest from $\mathcal {N}_{j,1,>\chi }\setminus \mathcal {D}_{j,1,>\chi }$ with the rest of the points alternating between these two sets. Now, to assure that zeros and poles of $\mathcal {G}_{1,>\chi }(w)$ alternate, we need to make sure that as we take the union over all js, the property is maintained. If $\tau _i=\tau _j$ , it is not hard to check that points $\left (\mathcal {D}_{i,1,>\chi }\cup \mathcal {D}_{j,1,>\chi } \right )\setminus \left (\mathcal {N}_{i,1,>\chi } \cup \mathcal {N}_{j,1,>\chi }\right )$ and $\left (\mathcal {N}_{i,1,>\chi }\cup \mathcal {N}_{j,1,>\chi } \right )\setminus \left (\mathcal {D}_{i,1,>\chi } \cup \mathcal {D}_{j,1,>\chi }\right )$ alternate. In the case when $\tau _i>\tau _j$ , we can choose to keep all points in $\mathcal {D}_{i,1,>\chi }\cup \mathcal {N}_{i,1,>\chi }$ to the left of all points in $\mathcal {D}_{j,1,>\chi }\cup \mathcal {N}_{j,1,>\chi }$ , which can be achieved if Assumption 6.2 (2) holds (when we take into account the separating condition for other three cases as well).
To keep zeros and poles of $\mathcal {G}_{1,<\chi }(w)$ separated from zeros and poles of $\mathcal {G}_{1,>\chi }(w)$ , we can choose
-
1. that all zeros and poles of $\mathcal {G}_{1,<\chi }(w)$ are to the left of all zeros and poles of $\mathcal {G}_{1,>\chi }$ , which can be guaranteed if Assumption 6.2 (1) where (6.11) holds, or alternatively,
-
2. that all zeros and poles of $\mathcal {G}_{1,<\chi }(w)$ are to the right of all zeros and poles of $\mathcal {G}_{1,>\chi }$ . Then Assumption 6.2 (1) where (6.12) holds can guarantee this case.
To keep zeros and poles of $\mathcal {G}_{0,<\chi }(w)$ separated from zeros and poles of $\mathcal {G}_{0,>\chi }(w)$ , we can make an analogous argument.
Lemma 6.5. Suppose that Assumption 6.2 holds. Then for any $\zeta \in {\mathbb R}$ , the equation in w
has at most one pair of complex conjugate roots.
Proof. Let
where $\{a_1<a_2<\cdots <a_k\}$ , $\{b_1<b_2<\cdots <b_k\}$ , and $C\neq 0$ is an absolute constant.
Observe that under Assumptions 6.2 in both cases (i.e., if either (6.11) or (6.12) holds), poles can be divided in three segments: $\{a_1,\dots ,a_{k_1}\}$ , $\{a_{k_1+1},\dots ,a_{k_2}\}$ and $\{a_{k_2+1},\dots ,a_k\}$ so that for each pair of consecutive poles $a_i,a_{i+1}$ , from one of the segments there is a unique zero $b_j\in (a_i,a_{i+1})$ where $j\in [k]$ . For such a pair of poles $a_i,a_{i+1}$ , it is straightforward to check that one of the following two cases occurs:
-
• $\lim _{w\rightarrow a_i+}\mathcal {G}_{\chi }(w)=-\infty $ and $\lim _{w\rightarrow a_{i+1}-}\mathcal {G}_{\chi }(w)=+\infty $ ; or
-
• $\lim _{w\rightarrow a_i+}\mathcal {G}_{\chi }(w)=+\infty $ and $\lim _{w\rightarrow a_{i+1}-}\mathcal {G}_{\chi }(w)=-\infty $ .
By continuity, $\mathcal {G}_{\chi }(w)$ is a surjection from $(a_i,a_{i+1})$ onto $(-\infty ,\infty )$ . Hence, for each $\zeta \in {\mathbb R}$ , $\mathcal {G}_{\chi }(w)=\zeta ^n$ has at least one root in $(a_i,a_{i+1})$ . Since there are three segments, note that this will give us at least $k-3$ real roots of (6.13).
The following cases might occur:
-
1. $s^n=C$ . In this case, the equation (6.13) in w has at most $k-1$ roots in the complex plane. But we already have $(k-3)$ real roots; hence, in this case, (6.13) has at most one pair of complex conjugate roots.
-
2. $s^n\neq C$ . In this case, the equation (6.13) in w has exactly k roots in the complex plane. Again, it is straightforward to check that one of the following two cases occurs:
-
• $\lim _{w\rightarrow a_k+}\mathcal {G}_{\chi }(w)=-\infty $ and $\lim _{w\rightarrow a_{1}-}\mathcal {G}_{\chi }(w)=+\infty $ ; or
-
• $\lim _{w\rightarrow a_k+}\mathcal {G}_{\chi }(w)=+\infty $ and $\lim _{w\rightarrow a_{1}-}\mathcal {G}_{\chi }(w)=-\infty $ .
By continuity, $\mathcal {G}_{\chi }(w)$ is a surjection from $(-\infty ,a_{1})\cup (a_p,\infty )$ onto $(-\infty ,C)\cup (C,\infty )$ . Hence, for each $s\neq C$ , $\mathcal {G}_{\chi }(w)=s$ has at least one root in $(-\infty ,a_{1})\cup (a_p,\infty )$ . Since (6.13) has at least $(k-2)$ real roots, we deduce that it has at most one pair of complex conjugate roots.
-
Lemma 6.6. Suppose Assumptions 5.1 and 6.2(2)(3) hold. Let $\mathcal {H}(\chi ,\kappa )$ be the limit of the rescaled height function of pure dimer coverings on rail yard graphs as $\epsilon \rightarrow 0$ , as obtained in Theorem 6.1. Let
Assume that the equation (6.13) in w with $\zeta =e^{-\kappa }$ has exactly one pair of nonreal conjugate roots and $\mathcal {R}_{\chi }\neq \emptyset $ .
-
1. If $\mathcal {P}_{1,>\chi }=\emptyset $ , then
$$ \begin{align*} \mathcal{G}_{\chi}(0)<e^{-n\kappa}. \end{align*} $$ -
2. If $\mathcal {P}_{0,>\chi }=\emptyset $ , then
$$ \begin{align*} \mathcal{G}_{\chi}(0)>e^{-n\kappa}. \end{align*} $$
Proof. We only prove part (1) here; part (2) can be proved using exactly the same technique. Assume $\mathcal {R}_{\chi }\neq \emptyset $ and $\mathcal {P}_{1,>\chi }=\emptyset $ ; then $\mathcal {P}_{0,>\chi }\neq \emptyset $ . Let
-
• If $\mathcal {P}_{1,<\chi }\neq \emptyset $ , let
(6.15) $$ \begin{align} B_2:= \min\mathcal{P}_{1,<\chi}>0. \end{align} $$ -
• If $\mathcal {P}_{1,<\chi }= \emptyset $ , let
(6.16) $$ \begin{align} B_2:=+\infty. \end{align} $$
Then by (5.4)–(5.7) and (5.9), we have
Let K be the total number of complex roots (counting multiplicities) in w of $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ . From the proof of Lemma 6.5, we see that there are at least $K-2$ real roots of $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ in $(-\infty ,B_1)\cup (B_2,+\infty )$ . If $\mathcal {G}_{\chi }(0)\geq e^{-n\kappa }$ , by (6.17) and the continuity of $\mathcal {G}_{\chi }(w)$ when $w\in (B_1,B_2)$ , we deduce that there is at least one real root of $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ in $(B_1,0]$ , which contradicts the assumption that $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ has exactly one pair of nonreal conjugate roots. Then part (1) of the lemma follows.
Then we have the following proposition:
Proposition 6.7. Suppose Assumption 5.1 and 6.2 hold. Let $\mathcal {H}(\chi ,\kappa )$ be the limit of the rescaled height function of pure dimer coverings on rail yard graphs as $\epsilon \rightarrow 0$ , as obtained in Theorem 6.1. Assume that equation (6.13) in w with $\zeta =e^{-\kappa }$ has exactly one pair of nonreal conjugate roots and $\mathcal {R}_{\chi }\neq \emptyset $ , $\mathcal {G}_{\chi }(0)\neq e^{-n\kappa }$ and $\mathcal {G}_{\chi }(\infty )\neq e^{-n\kappa }$ . Let $\mathbf {w}_+$ be the unique nonreal root of $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ in the upper half plane, and the branch of $\mathrm {arg}(\cdot )$ be chosen such that $\mathrm {arg}(\mathbf {w}_{+})\in (0,\pi )$ . Then
-
(a) if Assumption 6.2(2)(3) hold,
(6.18) $$ \begin{align} \frac{\partial \mathcal{H}(\chi,\kappa)}{\partial \kappa} =2-\frac{2\mathrm{arg}(\mathbf{w}_{+})}{\pi}; \end{align} $$ -
(b) if Assumption 6.2(1)(2) hold,
(6.19) $$ \begin{align} \frac{\partial \mathcal{H}(\chi,\kappa)}{\partial \kappa} =\begin{cases} \frac{2\mathrm{arg}(\mathbf{w}_{+})}{\pi}&\mathrm{if}\ \mathbf{1}_{\mathcal{G}_{\chi}(0)> e^{-n\kappa}}+\mathbf{1}_{\mathcal{G}_{\chi}(\infty)> e^{-n\kappa}}\in\{0,2\};\\ 2\left[1-\frac{\mathrm{arg}(\mathbf{w}_{+})}{\pi}\right]&\mathrm{otherwise.} \end{cases} \end{align} $$
Proof. We first prove (a) here. By (6.3), (6.6), we obtain
By (6.7), (6.9), (6.10), we obtain
where the branch of $\mathrm {arg}$ is chosen to have range $(-\pi , \pi ]$ . Hence, we have
Under the assumption that $\mathcal {R}_{\chi }\neq \emptyset $ and $\mathcal {G}_{\chi }(0)\neq e^{-n\kappa }$ , the following cases might occur:
-
1. $\mathcal {P}_{0,>\chi }\neq \emptyset $ . In this case, the number of negative poles in $\mathcal {R}_{\chi }$ is exactly $|\mathcal {P}_{0,>\chi }|$ . From the proof of Lemma 6.5, we see that there are at least $|\mathcal {P}_{0,>\chi }|-1$ negative real roots in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}$ . Let $B_1$ be defined as in (6.14).
-
(a) If $\mathcal {P}_{1,>\chi }\neq \emptyset $ , let
$$ \begin{align*} B_2:= \min\mathcal{P}_{1,>\chi}>0. \end{align*} $$ -
(b) If $\mathcal {P}_{1,>\chi }= \emptyset $ and if $\mathcal {P}_{1,<\chi }\neq \emptyset $ , let $B_2$ be defined as in (6.15).
-
(c) If $\mathcal {P}_{1,>\chi }= \emptyset $ and if $\mathcal {P}_{1,<\chi }= \emptyset $ , let $B_2$ be defined as in (6.16).
Then by (5.4)–(5.7) and (5.9), we have (6.17). The following cases might occur:
-
(a) $\mathcal {G}_{\chi }(0)>e^{-n\kappa }$ . Then there exists a unique root in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}\cap (B_1,B_2)$ which is negative; in this case, the argument of each negative pole in $\mathcal {R}_{\chi }$ cancels with an argument of a unique negative root in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}$ ;
-
(b) $\mathcal {G}_{\chi }(0)<e^{-n\kappa }$ . Then there exists no root in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}\cap (B_1,0)$ ; in this case, there is a unique negative pole in $\mathcal {R}_{\chi }$ whose argument cannot cancel with an argument of a unique negative root in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}.$
In either case, we have that (6.18) holds.
-
-
2. $\mathcal {P}_{1,>\chi } \neq \emptyset $ and $\mathcal {P}_{0,>\chi }= \emptyset $ . In this case, there are neither negative poles in $\mathcal {R}_{\chi }$ nor negative real roots in $\{w_{\xi ,\chi }(e^{-\kappa })\}_{\xi \in \mathcal {R}_{\chi }}$ . By Lemma 6.6, we have $\mathcal {G}_{\chi }(0)>0$ . Then (6.18) follows from (6.20).
Now we prove (b). Following the same argument as the proof of part(a), we obtain
where $\mathbf {w}$ is some non-real root of $\mathcal {G}_{\chi }(w)=e^{-n\kappa }$ . Depending on the value of $\mathbf {1}_{\mathcal {G}_{\chi }(0)> e^{-n\kappa }}+\mathbf {1}_{\mathcal {G}_{\chi }(\infty )> e^{-n\kappa }}$ , $\mathbf {w}$ may be chosen to be the root in the upper half plane or the lower half plane with appropriate branch of $arg(\cdot )$ such that $\frac {\partial \mathcal {H}}{\partial \kappa }\in [0,2]$ , as in (2.9). Then (6.19) follows.
As we shall see in Section 8, for pyramid partitions, $\mathcal {G}_{\chi }(0)=\mathcal {G}_{\chi }(\infty )=1$ .
Definition 6.8. Let $\{RYG(l^{(\epsilon )},r^{(\epsilon )}, \underline {a}^{(\epsilon )}, \underline {b}^{(\epsilon )})\}_{\epsilon>0}$ be a collection of rail yard graphs satisfying Assumptions 5.1 and 6.2. Let $\mathcal {H}(\chi ,\kappa )$ be the limit of the rescaled height function of pure dimer coverings on rail yard graphs as $\epsilon \rightarrow 0$ , as obtained in Theorem 6.1. The liquid region for the limit shape of pure dimer coverings on these rail yard graphs as $\epsilon \rightarrow 0$ is defined to be
and the frozen region is defined to be
The frozen boundary is defined to be the boundary separating the frozen region and the liquid region.
Remark 6.9. By Proposition 6.7, we see that if $\mathcal {R}_{\chi }\neq \emptyset $ and $\mathcal {G}_{\chi }(0)\neq \emptyset $ , $(\chi ,\kappa )\in (l^{(0)},r^{(0)})\times {\mathbb R}$ is in the liquid region if and only if the equation
in w has exactly one pair of nonreal conjugate roots in w. By Lemma 6.5, we see that the frozen boundary is given by the condition that (6.21) has double real roots.
Next, we shall find the frozen boundary. The discussion above shows that if $\mathcal {R}_{\chi }\neq \emptyset $ and $\mathcal {G}_{\chi }(0)\neq \emptyset $ , $(\chi ,\kappa )\in (l^{(0)},r^{(0)})\times {\mathbb R}$ is on the frozen boundary if and only if $(\chi ,\kappa )$ satisfies the following system of equations:
The second equation in (6.22) gives
7 Height fluctuations and Gaussian free field
In this section, we prove that the fluctuations of height function converge to the pull-back Gaussian free field (GFF) in the upper half plane under a diffeomorphism from the liquid region to the upper half plane. The main theorem proved in this section is Theorem 7.7.
7.1 Gaussian free field
Let $C_0^{\infty }$ be the space of smooth real-valued functions with compact support in the upper half plane ${\mathbb H}$ . The Gaussian free field (GFF) $\Xi $ on ${\mathbb H}$ with the zero boundary condition is a collection of Gaussian random variables $\{\Xi _{f}\}_{f\in C_0^{\infty }}$ indexed by functions in $C_0^{\infty }$ , such that the covariance of two Gaussian random variables $\Xi _{f_1}$ , $\Xi _{f_2}$ is given by
where
is the Green’s function of the Laplacian operator on ${\mathbb H}$ with the Dirichlet boundary condition. The Gaussian free field $\Xi $ can also be considered as a random distribution on $C_0^{\infty }$ , such that for any $f\in C_0^{\infty }$ , we have
Here, $\Xi (f)$ is the Gaussian random variable with respect to f, which has mean 0 and variance given by (7.1) with $f_1$ and $f_2$ replaced by f. See [Reference Sheffield35] for more about the GFF.
7.2 $\mathbf {w}_{+}$ as a mapping from $\mathcal {L}$ to $\mathbb {H}$
By (5.4)–(5.7) and (5.9), we may write $\mathcal {G}_{\chi }(w)$ as the quotient of two functions $U_{\chi }(w)$ and $R(w)$ , such that $U_{\chi }(w)$ depends on $\chi $ and $R(w)$ is independent of $\chi $ . More precisely,
where
and
and
Observe that $A_1$ and $A_2$ do not depend on $\chi $ ; it because the first and third terms combined do not depend on $\chi $ , as well as the second and fourth combined. Now, assume that $a_{i^*}=L$ . Then
and
We shall always use $[\cdot ]^{\frac {1}{n}}$ to denote the branch which takes positive real values on the positive real line. Define
Hence, we have
if and only if
Lemma 7.1. Let
For any $(\alpha ,\theta )$ such that
there exists a unique pair $(w_*,z_*)$ such that $\arg z_*=\alpha $ for some $k\in {\mathbb Z}$ , $\arg w_*=\theta $ and $U(w_*,z_*)=0$ .
Proof. Note that $n_R+n_L=n$ . For $\theta \in (0,\pi )$ , define a map $B_{\theta }: [0,\infty )\rightarrow {\mathbb R}$ by
where the branch of $\arg (\cdot )$ is chosen such that it has range $(-\pi ,\pi ]$ . It is straightforward to check that $B_{\theta }(\rho )$ is strictly increasing when $\rho \in (0,\infty )$ . Moreover,
Since $B_{\theta }$ is a bijection from $(0,\infty )$ to $\left (0,\frac {n_L\pi }{n}+\frac {(n_R-n_L)\theta }{n}\right )$ , for any $(\alpha ,\theta )$ satisfying (7.6), we can find a unique $\rho>0$ , such that $B_{\theta }(\rho )=\alpha $ . Let
Then the lemma follows.
Proposition 7.2. For each $(\chi ,\kappa )\in \mathcal {L}$ , let $\mathbf {w}_+(\chi ,\kappa )$ be the unique root of (7.5) in the upper half plane ${\mathbb H}$ . Then $\mathbf {w}_+:\mathcal {L}\rightarrow {\mathbb H}$ is a diffeomorphism.
Proof. We first show that $\mathbf {w}_+$ is a bijection. For any $w\in \mathbb {H}$ , let $z=[R(w)]^{\frac {1}{n}}$ . Let
By (7.2), (7.3), (7.4), we obtain
Then we have
and
Note that for any $w\in {\mathbb H}$ , $u,v\in [0,\infty ]$ and $u<v$ , we have
and
Hence, from (7.8), we obtain
By (7.9), we obtain
By Lemma 7.1, we can find a unique pair $(w_*,z_*)$ such that $\arg z_*=\alpha $ for some $k\in {\mathbb Z}$ , $\arg w_*=\theta $ and $U(w_*,z_*)=0$ .
where the branch of the $\log (\cdot )$ is chosen such that it takes real values on the positive real axis. Then we deduce that $\mathbf {w}_+$ is a bijection. From the process, we see that both the mapping $\mathbf {w}_+$ and its inverse are differentiable. Then the proposition follows.
7.3 Convergence of height fluctuations to GFF
Splitting the sum of the RHS of (6.23) into those depending on $\chi $ and those independent of $\chi $ , we obtain
Let $\mathcal {S}$ be the set of all the zeros and poles of $\mathcal {G}_{\chi }$ that are independent of $\chi $ . Or equivalently, $\mathcal {S}$ is the set of all the zeros and poles of $R(w)$ . More precisely,
Then we have the following lemma.
Lemma 7.3. Each $u\in {\mathbb R}\setminus \mathcal {S}$ is a double root of (7.5) for a unique pair of $(\chi ,\kappa )\in {\mathbb R}^2$ .
Proof. Define
and
Then u is a double root for (6.13) for some $(\chi ,\kappa )\in [r^{(0)},l^{(0)}]\times {\mathbb R}$ if and only if
where $[\cdot ]^{\frac {1}{n}}$ is the branch that takes positive real value on the positive real axis. The function $f(s)$ is defined in ${\mathbb R}\setminus [\{-\tau _j\}_{j\in [n]:a_j=R}\cup \{\tau _j\}_{j\in [n],a_j=L}]$ . Suppose that we enumerate all the points in $\{-\tau _j\}_{j\in [n]:a_j=R}\cup \{\tau _j\}_{j\in [n],a_j=L}$ in the increasing order as follows:
Since for all $s\in {\mathbb R}\setminus [\{-\tau _j\}_{j\in [n]:a_j=R}\cup \{\tau _j\}_{j\in [n],a_j=L}]$ ,
we obtain
-
1. f is strictly increasing in each interval $(\alpha _i,\alpha _{i+1})$ , for $i\in [n_R-1]$ from $-\infty $ to $\infty $ ;
-
2. f is strictly increasing in each interval $(-d_{j+1},-d_{j})$ , for $j\in [n_L-1]$ from $-\infty $ to $\infty $ ;
-
3. f is strictly increasing in the interval $(-d_1,\alpha _1)$ from $-\infty $ to $\infty $ ;
-
4. f is strictly increasing in the interval $(\alpha _{n_R},\infty )$ from $-\infty $ to $0$ ;
-
5. f is strictly increasing in the interval $(-\infty ,\alpha _{n_L})$ from $0$ to $\infty $ .
Hence, for each $u\in {\mathbb R}$ and for each set
there is a unique $\chi $ such that (7.11) holds and $e^{\chi }u^{-1}\in \Delta $ .
For $j\in [n]$ , let
Again, we take the convention that the minimum (resp. maximum) of an empty set is $\infty $ ( $-\infty $ ) and assume for all $j\in [n]$ ,
From (7.7), we obtain
where $k\in {\mathbb Z}$ . Moreover,
The following cases might occur:
-
1. $u< 0$ . Then
(7.17) $$ \begin{align} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}= \frac{\pi}{n}\left|\{j\in[n]:a_j=R,b_{p_{j,R}+1,j}=+\}\right| \end{align} $$and
(7.18) $$ \begin{align} \lim_{\epsilon\rightarrow 0+}\arg [U_{\chi}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}&=\frac{\pi}{n}\left|\{j\in[n]:a_j=R, -\tau_j<e^{\chi}u^{-1}\}\right|. \end{align} $$It is straightforward to check that there exists a unique $\Delta $ satisfying (7.12), such that (7.17) and (7.18) are equal when $e^{\chi }u^{-1}\in \Delta $ .
-
2. $u\geq 0$ . Then
(7.19) $$ \begin{align} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}= \frac{\pi}{n}\left|\{j\in[n]:a_j=L,b_{p_{j,L}+1,j}=+\}\right| \end{align} $$and
(7.20) $$ \begin{align} \lim_{\epsilon\rightarrow 0+}\arg [U_{\chi}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}&=\frac{\pi}{n}\left|\{j\in[n]:a_j=L, e^{\chi}u^{-1}<\tau_j\}\right|. \end{align} $$It is straightforward to check that there exists a unique $\Delta $ satisfying (7.12), such that (7.19) and (7.20) are equal when $e^{\chi }u^{-1}\in \Delta $ .
Then we deduce that $u\in {\mathbb R}\setminus \mathcal {S}$ , there exists a unique $\chi $ such that (7.11) holds and (7.15) and (7.16) are equal. The condition that (7.15) and (7.16) are equal is equivalent to saying that the right-hand side of (7.10) is real and positive. When the right-hand side of (7.10) is positive, we obtain a unique $\kappa \in {\mathbb R}$ . Then the lemma follows.
Assumption 7.4. Let $i,j\in [n]$ and $p_1,p_2\in [m]$ . For $a_i=a_j$ and $\tau _i>\tau _j$ , it holds that
Remark 7.5. Under Assumption 7.4, if we order all the points in $\{-\tau _j\}_{j\in [n]:a_j=R}\cup \{\tau _j\}_{j\in [n],a_j=L}$ as follows:
then we can order all the points in
as follows:
Lemma 7.6. Suppose Assumption 7.4 holds. For $u\in {\mathbb H}\cup {\mathbb R}$ , let $(\chi _u,\kappa _u)\in {\mathbb R}^2$ such that
Assume one of the following two conditions holds:
-
1. $u\rightarrow e^{V_p}\tau _j^{-1}\in \mathcal {S}$ for some $p\in [0..m]$ , $j\in [n]$ and $a_j=L$ ;
-
2. $u\rightarrow -e^{V_p}\tau _j^{-1}\in \mathcal {S}$ for some $p\in [0..m]$ , $j\in [n]$ and $a_j=R$ ;
then $\chi _u\rightarrow V_p$ .
Proof.
-
1. We first consider case (1).
-
(a) Assume that $u\rightarrow e^{V_p}\tau _j^{-1}\in \mathcal {S}$ for some $p\in [m-1]$ , $j\in [n]$ and $a_j=L$ . Let $\delta>0$ be positive and small. By (7.13), under Assumption 7.4, we obtain that for $i\in [n]$ , $a_i=L$ ,
-
• if $u=e^{V_p}\tau _j^{-1}-\delta $ ,
$$ \begin{align*} p_{i,L}=\begin{cases}-\infty &\mathrm{If}\ \tau_i<\tau_j\\ p-1 &\mathrm{If}\ \tau_i=\tau_j\\ m &\mathrm{If}\ \tau_i>\tau_j \end{cases} \end{align*} $$ -
• if $u=e^{V_p}\tau _j^{-1}+\delta $ ,
$$ \begin{align*} p_{i,L}=\begin{cases}-\infty &\mathrm{If}\ \tau_i<\tau_j\\ p&\mathrm{If}\ \tau_i=\tau_j\\ m &\mathrm{If}\ \tau_i>\tau_j. \end{cases} \end{align*} $$
By (7.19), we have
(7.21) $$ \begin{align} \lim_{[u\rightarrow e^{V_p}\tau_j^{-1}-]} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}} =\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i>\tau_j\}\right|+\mathbf{1}_{b_{p,i}=+} \end{align} $$and(7.22) $$ \begin{align} \lim_{[u\rightarrow e^{V_p}\tau_j^{-1}+]} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}} =\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i>\tau_j\}\right|+\mathbf{1}_{b_{p+1,i}=+}. \end{align} $$Note also that
$$ \begin{align*} \lim_{[u\rightarrow e^{V_p}\tau_j^{-1}-]} ug(u) =\begin{cases} +\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}<\mathbf{1}_{b_{p,j}=+}\\ -\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}>\mathbf{1}_{b_{p,j}=+}\\ \mathrm{a\ finite\ real\ number}&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}=\mathbf{1}_{b_{p,j}=+} \end{cases} \end{align*} $$and$$ \begin{align*} \lim_{[u\rightarrow e^{V_p}\tau_j^{-1}+]} ug(u) =\begin{cases} -\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}<\mathbf{1}_{b_{p,j}=+}\\ +\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}>\mathbf{1}_{b_{p,j}=+}\\ \mathrm{a\ finite\ real\ number}&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}=\mathbf{1}_{b_{p,j}=+}. \end{cases} \end{align*} $$Since $e^{V_p}\tau _j^{-1}\in \mathcal {S}$ , we obtain that $b_{p,j}\neq b_{p+1,j}$ . We obtain that when $u\rightarrow e^{V_p}\tau _j^{-1}+$ or $u\rightarrow e^{V_p}\tau _j^{-1}-$ , by (7.11), $e^{\chi }u^{-1}$ approaches some $\tau _k$ for $a_k=L$ , $k\in [n]$ . Moreover,-
(i) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow e^{V_p}\tau _j^{-1}-$ , $e^{\chi }u^{-1}$ approaches $\tau _k$ from the left;
-
(ii) If $\mathbf {1}_{b_{p,j}}<\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow e^{V_p}\tau _j^{-1}-$ , $e^{\chi }u^{-1}$ approaches $\tau _k$ from the right;
-
(iii) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow e^{V_p}\tau _j^{-1}+$ , $e^{\chi }u^{-1}$ approaches $\tau _k$ from the right;
-
(iv) If $\mathbf {1}_{b_{p,j}}<\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow e^{V_p}\tau _j^{-1}+$ , $e^{\chi }u^{-1}$ approaches $\tau _k$ from the left.
By (7.20),
-
(i) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ ,
(7.23) $$ \begin{align} &&\lim_{[u\rightarrow e^{V_p}\tau_j^{-1}-]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i\geq \tau_k\}\right| \end{align} $$(7.24) $$ \begin{align} &&\lim_{[u\rightarrow e^{V_p}\tau_j^{-1}+]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i>\tau_k\}\right|. \end{align} $$ -
(ii) The case when $u\rightarrow e^{V_0}\tau _j^{-1}$ and $u\rightarrow e^{V_m}\tau _j^{-1}$ for some $j\in [n]$ , $a_j=L$ can be proved similarly.
(7.25) $$ \begin{align} &&\lim_{[u\rightarrow e^{V_p}\tau_j^{-1}-]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i> \tau_k\}\right| \end{align} $$(7.26) $$ \begin{align} &&\lim_{[u\rightarrow e^{V_p}\tau_j^{-1}+]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=L; \tau_i\geq \tau_k\}\right|. \end{align} $$
In either case, to make (7.23)–(7.26) equal to the corresponding arguments in (7.21), (7.22), we must have $\tau _k=\tau _j$ .
-
-
(b) The case $u\rightarrow e^{V_0}\tau _j^{-1}$ or $u\rightarrow e^{V_0}\tau _j^{-1}$ for some $j\in [n]$ and $a_j=L$ can be proved similarly.
-
-
2. Now we consider case (2).
-
(a) Assume that $u\rightarrow -e^{V_p}\tau _j^{-1}$ for some $p\in [m-1]$ , $j\in [n]$ and $a_j=R$ . Let $\delta>0$ be positive and small. By (7.14), under Assumption 7.4, we obtain that for $i\in [n]$ , $a_i=R$ ,
-
• if $u=-e^{V_p}\tau _j^{-1}-\delta $ ,
$$ \begin{align*} p_{i,R}=\begin{cases}-\infty &\mathrm{If}\ \tau_i<\tau_j\\ p &\mathrm{If}\ \tau_i=\tau_j\\ m &\mathrm{If}\ \tau_i>\tau_j \end{cases} \end{align*} $$ -
• if $u=-e^{V_p}\tau _j^{-1}+\delta $ ,
$$ \begin{align*} p_{i,R}=\begin{cases}-\infty &\mathrm{If}\ \tau_i<\tau_j\\ p-1&\mathrm{If}\ \tau_i=\tau_j\\ m &\mathrm{If}\ \tau_i>\tau_j. \end{cases} \end{align*} $$
By (7.17), we have
(7.27) $$ \begin{align} \lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}-]} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}} =\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i>\tau_j\}\right|+\mathbf{1}_{b_{p+1,i}=+} \end{align} $$and(7.28) $$ \begin{align} \lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}+]} \lim_{\epsilon\rightarrow 0+}\arg [R(u+\mathbf{i}\epsilon)]^{\frac{1}{n}} =\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i>\tau_j\}\right|+\mathbf{1}_{b_{p,i}=+}. \end{align} $$Note also that$$ \begin{align*} \lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}-]} ug(u) =\begin{cases} +\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}<\mathbf{1}_{b_{p,j}=+}\\ -\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}>\mathbf{1}_{b_{p,j}=+}\\ \mathrm{a\ finite\ real\ number}&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}=\mathbf{1}_{b_{p,j}=+} \end{cases} \end{align*} $$and$$ \begin{align*} \lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}+]} ug(u) =\begin{cases} -\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}<\mathbf{1}_{b_{p,j}=+}\\ +\infty&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}>\mathbf{1}_{b_{p,j}=+}\\ \mathrm{a\ finite\ real\ number}&\mathrm{if}\ \mathbf{1}_{b_{p+1,j}=+}=\mathbf{1}_{b_{p,j}=+}. \end{cases} \end{align*} $$Since $-e^{V_p}\tau _j^{-1}\in \mathcal {S}$ , we obtain that $b_{p,j}\neq b_{p+1,j}$ . We obtain that when $u\rightarrow -e^{V_p}\tau _j^{-1}+$ or $u\rightarrow -e^{V_p}\tau _j^{-1}-$ , by (7.11), $e^{\chi }u^{-1}$ approaches some $-\tau _k$ for $a_k=R$ , $k\in [n]$ . Moreover,-
(i) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow -e^{V_p}\tau _j^{-1}-$ , $e^{\chi }u^{-1}+\tau _k$ approaches $0$ from the left;
-
(ii) If $\mathbf {1}_{b_{p,j}}<\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow -e^{V_p}\tau _j^{-1}-$ , $e^{\chi }u^{-1}+\tau _k$ approaches $0$ from the right;
-
(iii) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow -e^{V_p}\tau _j^{-1}+$ , $e^{\chi }u^{-1}+\tau _k$ approaches $0$ from the right;
-
(iv) If $\mathbf {1}_{b_{p,j}}<\mathbf {1}_{b_{p+1,j}}$ , as $u\rightarrow -e^{V_p}\tau _j^{-1}+$ , $e^{\chi }u^{-1}+\tau _k$ approaches $0$ from the left.
By (7.18),
-
(i) If $\mathbf {1}_{b_{p,j}}>\mathbf {1}_{b_{p+1,j}}$ ,
(7.29) $$ \begin{align} &&\lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}-]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i> \tau_k\}\right| \end{align} $$(7.30) $$ \begin{align} &&\lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}+]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i\geq\tau_k\}\right|. \end{align} $$ -
(ii) If $\mathbf {1}_{b_{p,j}}<\mathbf {1}_{b_{p+1,j}}$ ,
(7.31) $$ \begin{align} &&\lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}-]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i\geq\tau_k\}\right| \end{align} $$(7.32) $$ \begin{align} &&\lim_{[u\rightarrow -e^{V_p}\tau_j^{-1}+]}\lim_{\epsilon\rightarrow 0+}\arg [U_{\chi_u}(u+\mathbf{i}\epsilon)]^{\frac{1}{n}}=\frac{\pi}{n}\left|\{i\in[n]:a_i=R; \tau_i> \tau_k\}\right|. \end{align} $$
In either case, to make (7.29)–(7.32) equal to the corresponding arguments in (7.27), (7.28), we must have $\tau _k=\tau _j$ .
-
-
(b) The case when $u\rightarrow -e^{V_0}\tau _j^{-1}$ or $u\rightarrow -e^{V_m}\tau _j^{-1}$ for some $j\in [n]$ , $a_j=R$ can be proved similarly.
-
Theorem 7.7. Let $\{RYG(l^{(\epsilon )},r^{(\epsilon )}, \underline {a}^{(\epsilon )}, \underline {b}^{(\epsilon )})\}_{\epsilon>0}$ be a sequence of rail-yard graphs satisfying Assumptions 5.1, 6.2(2)(3) and 7.4. Let $\mathbf {w}_+:\mathcal {L}\rightarrow {\mathbb H}$ be the diffeomorphism from the liquid region to the upper half plane which maps each point $(\chi ,\kappa )$ in the liquid region to the unique root of (6.13) in the upper half plane ${\mathbb H}$ . Then as $\epsilon \rightarrow 0$ , the height function of pure dimer coverings on $\{RYG(l^{(\epsilon )},r^{(\epsilon )}, \underline {a}^{(\epsilon )}, \underline {b}^{(\epsilon )})\}_{\epsilon>0}$ in the liquid region converges to the $\mathbf {w}_+$ -pullback of GFF in the sense that for any $(\chi ,\kappa )\in \mathcal {L}$ , $\chi \notin \{V_p\}_{p=0}^{m}$ and positive real number $\alpha $ ,
in distribution.
Proof. Let $\chi \in [r^{(0)},l^{(0)}]$ and k be a positive integer. By (2.12) and Assumption 5.1, we have
where $\chi =2m-\frac {1}{2}$ . By Theorem 5.5, we obtain that for
and positive integers $k_1,\ldots ,k_s$ ,
converges to the Gaussian vector with covariance
Under Assumption 6.2, we deform the integral contour $\mathcal {C}_w$ to $\widetilde {\mathcal {C}}_w$ such that
-
1. $\widetilde {\mathcal {C}}_w=C_{w,1}\cup C_{w,2}$ ;
-
2. $C_{w,1}$ lies in the upper half plane except two endpoints along the real axis;
-
3. $C_{w,2}$ is the reflection of $C_{w,1}$ along the real axis;
-
4. $[\mathbf {w}_+]^{-1}(C_{w,1})$ is the vertical line in $\mathcal {L}$ passing through $(\chi _j,0)$ .
Similarly, we deform the integral contour $\mathcal {C}_z$ to $\widetilde {\mathcal {C}}_z$ such that
-
1. $\widetilde {\mathcal {C}}_z=C_{z,1}\cup C_{z,2}$ ;
-
2. $C_{z,1}$ lies in the upper half plane except two endpoints along the real axis;
-
3. $C_{z,2}$ is the reflection of $C_{z,1}$ along the real axis;
-
4. $[\mathbf {w}_+]^{-1}(C_{z,1})$ is the vertical line in $\mathcal {L}$ passing through $(\chi _i,0)$ .
Then making a change of variables from $(z,w)\in {\mathbb C}^2$ to $((\chi _1,\kappa _1),(\chi _2,\kappa _2))\in \mathcal {L}^2$ by $[\mathbf {w}_+]^{-1}\times [\mathbf {w}_+]^{-1}$ and the corresponding complex conjugates, we obtain
Integrating by parts, we obtain that
Then the proposition follows.
8 Examples
In this section, we discuss specific examples of the rail yard graph, known as pyramid partitions and pure steep tilings. The limit shape and height fluctuations of perfect matchings on these graphs can be obtained by the technique developed in the paper.
8.1 Pyramid partitions
A fundamental pyramid partition is a heap of square bricks such that
-
• each square brick is of size $2\times 2$ and has a central line dividing it into two equal-size rectangular parts; hence, the direction of the central line determines the direction of the square brick,
-
• each square brick lies upon two side-by-side square bricks and is rotated 90 degrees from the bricks immediately below it, and
-
• there is a unique brick on the top.
A pyramid partition is obtained from the fundamental pyramid partition by removing finitely many square bricks, such that if a square brick is removed, then all the square bricks above it are also removed. See the first figure in the Introduction.
Let s be a fixed positive integer which is odd. Let $\Lambda _s$ be the set of pyramid partitions that can be obtained from the fundamental partition where the center of the square brick on the top is $(0,0)$ and where we can only take off bricks that lie inside the strip $-s-1\leq x-y\leq s+1$ .
Looking from the top, each pyramid partition corresponds to a domino tiling of the square grid. See the second figure in the Introduction. From a pyramid partition, we can obtain a pure dimer covering on a rail yard graph by the following steps:
-
1. rotate the pyramid partition clockwise by 45 degrees,
-
2. for each blue vertex $v_b$ , assume it has four incident edges $e_1,e_2,e_3,e_4$ . Assume that $e_1$ and $e_2$ (resp. $e_3$ and $e_4$ ) are to the left (resp. right) of $v_b$ . Split each blue vertex $v_b$ of the dual graph into three vertices, $v_{b_1}$ , $v_{b_2}$ , $v_{b_3}$ such that $v_{b_1}$ and $v_{b_3}$ are blue vertices, while $v_{b_2}$ is a red vertex. The red vertex $v_{b_2}$ has exactly two incident edges joining it to $v_{b_1}$ and $v_{b_3}$ , respectively. $v_{b_1}$ has three incident edges $e_1 e_2$ and $(v_{b_1},v_{b_2})$ , while $v_{b_3}$ has three incident edges $e_3 e_4$ and $(v_{b_3},v_{b_2})$ .
-
3. If one of $e_1,e_2$ (resp. $e_3,e_4$ ) is in the dimer covering, while neither $e_3$ nor $e_4$ (resp. neither $e_1$ nor $e_2$ ) are in the dimer covering, make $(v_{b_2},v_{b_3})$ (resp. $(v_{b_1},v_{b_2})$ ) present in the dimer covering and $(v_{b_1},v_{b_2})$ (resp. $(v_{b_2},v_{b_3})$ ) absent in the dimer covering.
See the third and fourth figures in the Introduction for the pure dimer covering on a rail yard graph corresponding to the pyramid partitions given as the examples.
Proposition 8.1. There is a one-to-one correspondence between pyramid partitions in $\Lambda _s$ and pure dimer coverings on the rail yard graph such that for $i\in [-s..s-1]$ ,
Equivalently, there is a bijection between pyramid partitions in $\Lambda _s$ and sequences of partitions $(\lambda ^{(-s)},\lambda ^{(-s+1)},\ldots ,\lambda ^{(0)},\lambda ^{(1)},\ldots ,\lambda ^{(s)})$ such that
Proof. See Lemma 5.9 of [Reference Young38] and Proposition 8 of [Reference Bouttier, Chapuy and Corteel9].
The formula to compute partition function of pyramid partitions was conjectured in [Reference Kenyon20; Reference Szendroi36] and proved in [Reference Young39; Reference Young38].
Consider the pure dimer coverings on rail yard graphs corresponding to pyramid partitions. Then we have $m=2$ , $V_1=0$ and $V_0=-V_2$ . Assume that the model is periodic with $n=2$ .
Recall that $\mathcal {G}_{\chi }$ is defined by (5.9). Then the frozen boundary has the following parametric equation (parametrized by w):
where
and
-
• $w< 0$ . Then
$$ \begin{align*} \lim_{\epsilon\rightarrow 0+}\arg [R(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}= \frac{\pi}{2}\mathbf{1}_{b_2(p_{2,R},p_{2,R}+1)=+} \end{align*} $$and$$ \begin{align*} \lim_{\epsilon\rightarrow 0+}\arg [U_{\chi}(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}&=\frac{\pi}{2}\mathbf{1}_ {-\tau_2<e^{\chi}w^{-1}}. \end{align*} $$ -
• $w\geq 0$ . Then
$$ \begin{align*} \lim_{\epsilon\rightarrow 0+}\arg [R(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}= \frac{\pi}{2}\mathbf{1}_{b_1(p_{1,L},p_{1,L}+1)=+} \end{align*} $$and$$ \begin{align*} \lim_{\epsilon\rightarrow 0+}\arg [U_{\chi}(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}&= \mathbf{1}_{e^{\chi}w^{-1}<\tau_1}. \end{align*} $$In order to make$$ \begin{align*} \lim_{\epsilon\rightarrow 0+}\arg [R(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}= \lim_{\epsilon\rightarrow 0+}\arg [U_{\chi}(w+\mathbf{i}\epsilon)]^{\frac{1}{2}}, \end{align*} $$we have-
1. If $w>e^{V_2}\tau _1^{-1}$ , $e^{\chi }w^{-1}\in (0,\tau _1)$ ;
-
2. If $w\in (e^{V_1}\tau _1^{-1},e^{V_2}\tau _1^{-1})$ , $e^{\chi }w^{-1}\in (\tau _1,\infty )$ ;
-
3. If $w\in (e^{V_0}\tau _1^{-1},e^{V_1}\tau _1^{-1})$ , $e^{\chi }w^{-1}\in (0,\tau _1)$ ;
-
4. If $w\in (0,e^{V_0}\tau _1^{-1})$ , $e^{\chi }w^{-1}\in (\tau _1,\infty )$ ;
-
5. If $w<-e^{V_2}\tau _2^{-1}$ , $e^{\chi }w^{-1}\in (-\tau _2,0)$ ;
-
6. If $w\in (-e^{V_2}\tau _2^{-1},-e^{V_1}\tau _2^{-1})$ , $e^{\chi }w^{-1}\in (-\infty ,-\tau _2)$ ;
-
7. If $w\in (-e^{V_1}\tau _2^{-1},-e^{V_0}\tau _2^{-1})$ , $e^{\chi }w^{-1}\in (-\tau _2,0)$ ;
-
8. If $w\in (-e^{V_0}\tau _2^{-1},0)$ , $e^{\chi }w^{-1}\in (-\infty ,-\tau _2)$ .
-
Hence, for each $w\in \mathbb {R}\setminus \{\pm e^{V_p}\tau _j^{-1},0\}_{p\in \{0,1,2\},j\in \{1,2\}}$ , we can find a unique $\chi $ satisfying (1)–(8) and $f(e^{\chi }w^{-1})=wg(w)$ . Then knowing w and $\chi $ , we can find a unique $\kappa $ by $\frac {U_{\chi }(w)}{R(w)}=e^{-n\kappa }$ . See Figure 5 from the Introduction for the frozen boundary of pyramid partitions.
8.2 Steep tilings
A domino is a $2\times 1$ (horizontal domino) or $1\times 2$ (vertical domino) rectangle whose corners have integer coordinates. Let s be a fixed positive integer. An oblique strip of width $2s$ is the region of the Cartesian plane between the lines $y=x$ and $y=x-2s$ . A tiling of an oblique strip is a set of dominoes whose interiors are disjoint, and whose union is the tiled region R satisfying
A horizontal (resp. vertical) domino is called north-going (resp. east-going) if the sum of the coordinates of its top left corner is odd, and south-going (resp. west-going) otherwise. A tiling of an oblique strip is called steep if moving towards infinity in the northeast (resp. southwest) direction. Eventually there are only north- or east-going (resp. south- or west-going) dominoes.
For each given sequence $(b_1,\ldots ,b_{2s})\in \{\pm 1\}^{2s}$ , and each left and right boundary condition $\lambda ^{(0)}$ and $\lambda ^{(2s+1)}$ , there is a one-to-one correspondence between steep tilings in $\Lambda _s$ and pure dimer coverings on the rail yard graph such that for $i\in [1..2s]$ ,
-
1. $a_i=L$ if i is odd, and
-
2. $a_i=R$ if i is even.
The formula to compute the partition function of steep tilings was proved in [Reference Bouttier, Chapuy and Corteel9].
Example 8.2. (Aztec diamond with q-volume weights) The Aztec diamond is a special case of the steep tiling (hence a special case of the rail yard graph) in which the a sequence satisfies Conditions (1) and (2), while the b sequence satisfies
-
• $b_i=+$ if i is odd, and
-
• $b_i=-$ if i is even.
In this case, we have
and
Then
Then the frozen boundary is given by the solution of the following system of equations:
See Figure 10 for the frozen boundary of the Aztec diamond with q-volume weights.
A
Here, we recall some facts about Macdonald polynomials and include some known technical results that were used in this paper.
Let $X=(x_1,\ldots ,x_n,\ldots )$ and $Y=(y_1,\ldots ,y_n,\ldots )$ be two countable sets of variables. Let $\Lambda _X$ be the algebra of symmetric functions of X over ${\mathbb C}$ . The power symmetric functions $\{p_{\lambda }(X)\}_{\lambda \in {\mathbb Y}}$ form a linear basis for $\Lambda _X$ , where
For each fixed pair of parameters $q,t\in (0,1)$ and $\lambda ,\mu \in {\mathbb Y}$ , define the scalar product $\langle \cdot ,\cdot \rangle : \Lambda _X\times \Lambda _X\rightarrow {\mathbb R}$ as a bilinear map such that
where $\delta _{\lambda \mu }=1$ if and only if $\lambda =\mu $ , and $m_j(\lambda )$ is the number of parts in $\lambda $ equal to j.
Macdonald symmetric functions $P_\lambda (X;q,t)$ and $Q_{\lambda }(X;q,t)$ – for the definition, see (4.7) and (4.12) in Chapter VI of [Reference Macdonald31] – form two bases $(P_{\lambda })$ and $(Q_\lambda )$ , which are dual to each other with respect to the above scalar product; that is,
Skew Macdonald symmetric functions are defined by the branching rules
When $q=t$ ,
It is known that (see Remarks 1 on Page 346 of [Reference Macdonald31]) for a single variable x,
where $\psi _{\lambda /\mu }(q,t)$ and $\phi _{\lambda /\mu }(q,t)$ are independent of x, and furthermore,
Definition A.1. Let $k\in \mathbb {Z}^{+}$ and $q,t\in \mathbb {R}^{+}$ be parameters. Let $D_{-k,X}$ be an operator acting on symmetric functions $\Lambda _X$ . For any analytic symmetric function $F(X)$ satisfying
where $c_{\lambda }$ ’s are complex coefficients, define $D_{-k,X;q,t}F\in \Lambda _{X}$ to be
Let $W=(w_1,\ldots ,w_k)$ be an ordered set of variables. Define
Recall that $H(W,X;q,t)$ was defined as in (4.2).
The following proposition is a slightly more general form of Proposition 4.10 of [Reference Gorin and Zhang16].
Proposition A.2. Assume one of the following two conditions holds:
-
1. $q\in (0,1)$ and $t\in (0,1)$ , or
-
2. $q\in (1,\infty )$ and $t\in (1,\infty )$ .
Let $f:{\mathbb C}\rightarrow {\mathbb C}$ be a function analytic in a neighborhood of 0, and $f(0)\neq 0$ . Let $g:{\mathbb C}\rightarrow {\mathbb C}$ be a function analytic in a neighborhood of 0 and
for z in a small neighborhood of $0$ . Then
where the contours of the integral satisfy the following conditions:
-
• all the contours are in the neighborhood of $0$ such that both f and g are analytic;
-
• each contour encloses $0$ and $\{qx_i\}_{x_i\in X}$ ;
-
• if case (1) holds, $|w_i|\leq |tw_{i+1}|$ for all $i\in [k-1]$ ;
-
• if case (2) holds, $|w_i|\leq \left |\frac {1}{q}w_{i+1}\right |$ for all $i\in [k-1]$ ;
$H(W,X;q,t)$ is given by (4.2), and $D(W;q,t)$ is given by (A.3).
Proof. When X consists of finitely many variables and when case (1) holds, the proposition was proved in Proposition 4.10 of [Reference Gorin and Zhang16]. It is straightforward to check the Proposition when case (2) holds by (4.5).
When X consists of countably many variables, the identity (A.4) holds formally, since its projection onto any finitely many variables $(x_1,\ldots ,x_n)$ by letting $x_{n+1}=x_{n+2}=\ldots =0$ holds.
Lemma A.3. Let $(a,q)_{\infty }=\prod _{r=0}^{\infty }(1-aq^r)$ and
Then
In particular, when $q=t$ , we obtain the Cauchy identities for Schur polynomials:
Proof. See (2.5), (4.13) and (5.4) in Section VI of [Reference Macdonald31].
Lemma A.4. Let $\Pi $ , $\Pi '$ , and H be as in (A.5) and (4.2). Then
Proof. The first identity follows from Page 310 of [Reference Macdonald31]. The other two follow from
Definition A.5. Let $\mathcal {A}$ be a graded algebra over a field F. For $a\in \mathcal {A}$ , define $\mathrm {ldeg}(a)$ to be the minimum degree of all the homogeneous components in a.
Lemma A.6. (Proposition 2.3 pf [Reference Borodin, Corwin, Gorin and Shakirov5]) Let $\{d_k\}_k \{u_k\}_k$ be two sequences of elements of graded algebras $\mathcal {A}$ and $\mathcal {B}$ . Assume $\lim _{k\rightarrow \infty }\mathrm {ldeg}(d_k)=\infty $ and $\lim _{k\rightarrow \infty }\mathrm {ldeg}(u_k)=\infty $ . For non-negative integer k, let $p_k$ be the power sum. Then
where $d_k$ , $u_k$ are independent of the variables in Y.
Definition A.7. Let $F\supset {\mathbb C}$ be a field. Let $\mathcal {A}$ be a ( ${\mathbb Z}_{\geq 0}$ -)graded algebra over F. For each non-negative integer n, let $\mathcal {A}_n$ denote the n-th homogeneous component of $\mathcal {A}$ .
The completion $\widehat {\mathcal {A}}$ consists of formal sums $\sum _{n=1}^{\infty }a_n$ , where $a_n\in \mathcal {A}_n$ . For two graded algebras $\mathcal {A}$ , $\mathcal {A}'$ over F, let $\mathcal {A}\otimes _F\mathcal {A}'$ be a graded algebra over F such that for $a\in \mathcal {A}_m$ and $a'\in \mathcal {A}^{\prime }_n$ , $a\otimes a'\in (\mathcal {A}\otimes _F{A}')_{m+n}$ . Let $\mathcal {A}\widehat {\otimes }_F\mathcal {A}'$ be the completion of $\mathcal {A}\otimes _{F}\mathcal {A}'$ .
If $\mathcal {B}$ is a graded algebra over ${\mathbb C}$ , let $\mathcal {B}_F$ be the graded algebra $\mathcal {B}\otimes _{{\mathbb C}}F$ over F (i.e., the extension of coefficients from ${\mathbb C}$ to F). Let $\Lambda _{X}[F]$ denote the F-algebra of symmetric functions in $X=\{x_1,x_2,...\}$ , with coefficients in F.
Definition A.8. Let $\mathcal {A}$ and $\mathcal {A}'$ be graded algebras over ${\mathbb C}$ and $\{a_{n,j}\}_j$ be a basis for $\mathcal {A}_n$ for each $n\geq 0$ . We say that an element $f\in \mathcal {A}\widehat {\otimes }\mathcal {A}'[F]$ is $\mathcal {A}$ -projective if
such that $\lim _{n\rightarrow \infty }\min _j\mathrm {ldeg}(\alpha ^{\prime }_{n,j})=\infty .$ This property is independent of the choice of basis.
Definition A.9. Let $\mathcal {A}$ , $\mathcal {B}$ be graded algebras over ${\mathbb C}$ , and let $F\supset {\mathbb C}$ be a field. Define the Macdonald scalar product to be the bilinear map
such that
Definition A.10. Let $Z:=(z_{1},\ldots ,z_{k}),$ where k is a positive integer. Let $\mathcal {L}(Z)$ be the field of formal Laurent series in the variables
Let $\oint dZ:\mathcal {L}(Z)\rightarrow {\mathbb C}$ , such that for each Laurent series $f\in \mathcal {L}(Z)$ , $\oint f dZ$ is the coefficient of $\frac {1}{z_1\cdot \ldots \cdot z_k}$ in f.
The following lemma about the commutative properties of the residue operator and the Macdonald scalar product was proved in [Reference Ahn1].
Lemma A.11. (Lemma 3.8 in [Reference Ahn1]) Let $\mathcal {A}$ , $\mathcal {B}$ be graded algebras over ${\mathbb C}$ , and let $f\in \mathcal {A}\widehat {\otimes }\Lambda _X[\mathcal {L}(Z)]$ and $g\in \Lambda _X\widehat {\otimes }\mathcal {B}[L(W)]$ . If f is $\Lambda _X$ -projective, then
The following technical lemma is elementary, as proved in [Reference Ahn1].
Lemma A.12. (Lemma 5.7 of [Reference Ahn1]) Let $\theta \in (0,\pi )$ , and $\xi>0$ . Define
Let $\alpha>0$ and suppose $N(\epsilon )\in {\mathbb Z}>0$ such that $\limsup _{\epsilon \rightarrow 0}\epsilon N(\epsilon )>0$ as $\epsilon \rightarrow 0$ . Then for any fixed $\theta \in (0,\pi ), \xi>0$ , we have
uniformly for $z\in {\mathbb C}\setminus R_{\epsilon ,\theta ,\xi }$ and $\epsilon $ arbitrarily small. Here, the notation $(z;e^{-\epsilon })_{N(\epsilon )}$ is defined as in (5.8).
Lemma A.13. (Corollary A.2 in [Reference Gorin and Zhang16]) Let $d,h,k$ be positive integers. Let f, $g_1$ ,…, $g_d$ be meromorphic functions with possible poles at ${z_1,...,z_h}$ . Then for $k\geq 2$ ,
where the contours contain $\{z_1,...,z_h\}$ , and on the left side, we require that the $v_i$ -contour is contained in the $v_j$ -contour whenever $i < j$ .
Competing interest
The authors have no competing interest to declare.
Financial support
This material is based upon work supported by the National Science Foundation under Grant No. DMS-1928930 while ZL and MV participated in a program hosted by the Mathematical Sciences Research Institute in Berkeley, California, during the fall 2021 semester. ZL acknowledges support from National Science Foundation DMS1608896 and Simons Foundation grant 638143.