Lozenge tilings of hexagons with cuts and asymptotic fluctuations: a new universality class
Mark Adler, Kurt Johansson, Pierre van Moerbeke

TL;DR
This paper studies the asymptotic behavior of lozenge tilings in non-convex hexagons with cuts, revealing a new universality class through a novel kernel that describes fluctuations as the region size grows.
Contribution
It introduces a new kernel characterizing the asymptotic fluctuations of lozenge tilings in non-convex regions with cuts, expanding universality classes in tiling models.
Findings
Discovery of a new kernel for non-convex tilings
Identification of a new universality class
Asymptotic fluctuation behavior near cuts
Abstract
This paper investigates lozenge tilings of non-convex hexagonal regions and more specifically the asymptotic fluctuations of the tilings within and near the strip formed by opposite cuts in the regions, when the size of the regions tend to infinity, together with the cuts. It leads to a new kernel, which is expected to have universality properties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Lozenge tilings of hexagons with cuts and asymptotic fluctuations: a new universality class
Mark Adler Kurt Johansson Pierre van Moerbeke 2000 Mathematics Subject Classification. Primary: 60G60, 60G65, 35Q53; secondary: 60G10, 35Q58. Key words and Phrases:Lozenge tilings, non-convex polygons, kernels.
Department of Mathematics, Brandeis University, Waltham, Mass 02453, USA. E-mail: [email protected]. The support of a Simons Foundation Grant # 278931 is gratefully acknowledged. M.A. thanks the Simons Center for Geometry and Physics for its hospitality.Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden. E-mail: [email protected]. The support of the Swedish Research Council (VR) and grant KAW 2010.0063 of the Knut and Alice Wallenberg Foundation are gratefully acknowledged. Department of Mathematics, Université de Louvain, 1348 Louvain-la-Neuve, Belgium and Brandeis University, Waltham, Mass 02453, USA. E-mail: [email protected] . The support of a Simons Foundation Grant # 280945 is gratefully acknowledged. PvM thanks the Simons Center for Geometry and Physics, Stony Brook, and the Kavli Institute of Physics, Santa Barbara, for their hospitality.
Abstract
This paper investigates lozenge tilings of non-convex hexagonal regions and more specifically the asymptotic fluctuations of the tilings within and near the strip formed by opposite cuts in the regions, when the size of the regions tend to infinity, together with the cuts. It leads to a new kernel, which is expected to have universality properties.
Contents
- 1 Introduction and main results
- 2 Revisiting the -process of red dots
- 3 An identity along boundary points of
- 4 The -kernel is the inverse of the Kasteleyn matrix and deriving the -kernel of blue dots
- 5 Scaling and moving contours in the -kernel
- 6 Formal asymptotics of the main ingredients
- 7 The steepest descent analysis
1 Introduction and main results
The work of MacMahon on the number of tilings of hexagons has gained a considerable interest in the physics community in the 50-60’s, thinking of the work of Kaufman and Onsager[30] on the spontaneous magnetization of the square-lattice Ising model, thinking of the Kac-Ward formula [23] for the partition function of the Ising model on planar graphs and thinking of Kasteleyn’s work [24, 25] on a full covering of a two-dimensional planar lattice with dimers, for which he computed the entropy.
This last quarter of a century Random Matrix activity has given us new tools and techniques to get insights in tiling problems, their phase transitions, their critical behaviors and this from both, the macroscopic and the microscopic point of view. Many of these models show two phases (liquid and solid) and some of them three phases (gaseous, liquid and solid)[11, 5]. Indeed, experience has shown that the statistical fluctuations of the tiles near the singularities obey new probability laws, which tend to have a universal character. Tiling models are a rich source of new phenomena: they have sufficient complexity to have interesting features, and yet are simple enough to be tractable! For an overview, see [19].
Tiling of non-convex domains were investigated by Okounkov-Reshetikhin [29] and Kenyon-Okounkov [26] from a macroscopic point of view. Further important phenomena for nonconvex domains appear in the work of Borodin, Gorin and Rains [7], Defosseux [12], Metcalfe [27], Petrov [31, 32], Gorin [22], Novak [28], Bufetov and Knizel [10], Duse and Metcalfe [14, 15], and Duse, Johansson and Metcalfe [13]; see also the recent paper by Betea, Bouttier, Nejjar and Vuletic [6].
This paper aims at lozenge tilings of non-convex polygonal regions and more specifically at the asymptotic fluctuations of the tilings near the non-convexities (cuts in the regions), when the size of the regions tend to infinity, together with one or several cuts. Do new statistical fluctuations appear near these cuts and are they universal?
Our work on random tilings of Aztec diamonds and double Aztec diamonds gave rise to such new fluctuations, leading to the tacnode-Airy [2] and the tacnode-GUE statistics[1, 4]; it should undoubtedly also lead to Pearcey statistics. Random lozenge tilings of polygons with cuts have led to the Cusp-Airy statistics [29, 13]. All of these phenomena appear as result of non-convexities or cuts in the regions. In [3] we obtained a kernel for the lozenge tilings of hexagons with several cuts along opposite sides. In this paper, we address the question of their asymptotics when the size of the polygon tends to infinity together with the cuts along opposite sides, while keeping certain geometric data fixed in order to guarantee interaction beyond the limit. It is our belief that this is universal statistics, more general than the tacnode-GUE statistics for overlapping Aztec diamonds and that a number of other statistics can be obtained from this one. There will be some indication of this later in this section.
\begin{array}[]{ccccc}&\mbox{discrete-tacnode kernel for}\\ &\mbox{non-convex hexagons}\end{array}
\begin{array}[]{ccccc}&\mbox{GUE-tacnode for}\\ &\mbox{double Aztec-diamonds}\end{array}
Cusp-Airy kernel
tacnode kernel
Pearcey kernel
Fig.1. Is the statistics associated with the discrete-tacnode kernel for non-convex hexagons universal ? Does it imply in some appropriate limit all these known statistics?
In this paper, we consider a hexagon with cuts as in Fig.3, and a tiling with lozenges of the shape as in Fig.2, colored blue, red and green. Notice there is an affine transformation from our tiles to the usual ones in the literature; see e.g. the simulation of Fig.5. The usual right-leaning blue tiles turn into our blue ones, the usual up-right red ones into our red ones and the usual left-leaning green tiles (30o) to our green tiles (45o), all as in Fig.2.
Two different determinantal discrete-time processes, a -process and an -process, will be considered, depending on the angle at which one looks at the polygons; south to north for the -process or south-west to north-east
Fig. 2. Three types of tiles, with a height function and with a level line.
Fig. 3. Tiling of a hexagon with two opposite cuts of equal size (Two-cut case), with red, blue and green tiles. Here , , and thus The -coordinates have their origin at the black dot and the -coordinates at the circle given by . Red tiles carry red dots on horizontal lines for (-process) and blue tiles blue dots on oblique lines for (-process). The left and right boundaries of the strip are given by the dotted oblique lines and . Asymptotics will be performed about the black dot in the middle of the hexagon.
Fig. 4. The polygon with two cuts of different sizes , satisfying and the quadrilateral .
Fig. 5. Computer simulation with , with and (upper-picture). Zooming into the intersection of the the two hexagons, with oblique lines , carrying blue tiles each (lower-picture). The lines for each carry blue tiles. (Courtesy of Antoine Doeraene)
for the -process, both as an evolution in time. Paper [3] focused on the -process, whereas this one on the -process and its asymptotic limit in the neighborhood and in between the non-convexities. In [3] we show the -process is determinantal and its kernel is given. We believe the -kernel is a master-kernel, from which many new and old statistics can be deduced after an appropriate asymptotic limits.
The multi-cut model is a general non-convex polygonal region consisting of taking a hexagon where two opposite edges have cuts cut out of the upper-part (of sizes ) and cuts cut out of the lower-part (of sizes ); let . Introduce the coordinates , where and refer to the lower and upper sides of the polygon, with being the running variable along the lines integer. Let and be the “cuts” corresponding to the two triangles added to the left and the right of P and let be the size of the lower-oblique side. Then is the distance between the lower and upper edges. The intervals separating the upper-cuts (resp. lower-cuts) are denoted by (resp. ) and we require them to satisfy , which is equivalent to . Define to be the quadrilateral (with two parallel sides) obtained by adding triangles to , as in Fig.4. The vertices of and and its tiles all belong to the vertical lines of the grid (in Figs. 3 and 4).
The integer points in are labeled by . We complete that set with the integer points to the left of along ; they are labeled by and we set and . Similarly, the integer points are labeled by . For more details on the multi-cut model111We assume that for all , and that y_{d}\notin\{\mbox{x-coordinates of an upper-cut}\}., see [3].
The two-cut model is a special case where two opposite edges have one cut each (), both of same size . Referring to Fig.3, we define and so . The upper-cut is at distances from the extremities of the upper-edge and the lower-cut at distances from those of the lower-edge. The integers and determine the sizes of the two triangles which complete the figure into a quadrilateral (with two parallel sides) , as in Fig. 4. In other terms, the polygon is now a hexagon with edges of size with two cuts, one below and one above, both of same size , satisfying .
Assuming
[TABLE]
define polynomials222 For any integers and we have and .:
[TABLE]
The choice of origin implies that the left most and right most points of the hexagon for the two-cut case along are given by and respectively. The left-most point of the lower cut and of the upper-cut are located at and respectively. Fig. 3 is such an example, which is covered by tiles of the three shapes. Note that the right-most point in the lower-cut will play an important role!
Besides the -coordinates, another set of coordinates will be used throughout (see Fig. 3):
[TABLE]
The and -processes. Given a covering of this polygonal shape with tiles of three shapes, colored in red, blue and green tiles, as in Figs. 2 and 3, put a red dot in the middle of the red tiles and a blue dot in the middle of the blue tiles. The red dots belong to the intersections of the vertical lines integers and the horizontal lines ; they define a point process , which was called the -process in [3]. The initial condition at the bottom is given by the fixed red dots at integer locations in the lower-cut, whereas the final condition at the top is given by the fixed red dots in the upper-cut, including the red dots to the left and to the right of the figure, all at integer locations. Notice that the process of red dots on form an interlacing set of integers starting from fixed dots (contiguous for the two-cut and non-contiguous for the multi-cut model) and growing linearly to end up with a set of (non-contiguous) fixed dots. This can be viewed as a “truncated” Gel’fand-Zetlin cone!
The blue dots belong to the intersection of the parallel oblique lines with the horizontal lines for ; in terms of the coordinates (3), the blue dots are parametrized by , with as above. It follows that the -coordinates of the blue dots satisfy . This point process defines the -process, as was also discussed in [3]. The blue dots on the oblique lines also interlace, going from left to right, but their numbers go up, down, up and down again, with a special feature, which will be explained later.
In the two-cut model, two strips within will play a role (see Fig.3):
(i) an oblique strip extending the oblique segments of the upper- and lower-cuts; that is the region between the lines or what is the same for . The strip has width
[TABLE]
and assume .
(ii) a vertical strip extending the vertical segments of the upper- and lower-cuts; that is the region between the lines and The strip has width (again same notation for the name and the width of the strip!)
[TABLE]
this inequality follows from (1).
It is natural to assume that the strips (respectively ) have no point in common with the vertical parts (respectively oblique parts) of the boundary .
As shown in [3], the integer
[TABLE]
equals the number of blue dots on the oblique lines for ; see Fig. 3. It will play a crucial role in this paper.
In [3], we obtained the -kernel. It is not clear how to obtain the -kernel from scratch, due to the intricacy of the interlacing pattern, mentioned earlier. Therefore one must first compute the -kernel and then one hopes to compute the -kernel by an alternative method. Indeed, we check that the inverse Kasteleyn matrix of the dimers on the associated bipartite graph dual to coincides with the -kernel. This leads us to the first main statement of the paper.
Theorem 1.1
For the multi-cut case, the -process of blue dots and the -process of red dots have kernels related as follows:
[TABLE]
*where and are the same geometric points as and , expressed in the new coordinates (3); see Fig. 6. *
\begin{aligned} \mbox{Fig. 6.}&~{}\mbox{The {\mathbb{L}}{\mathbb{K}}-kernel of}\\ &\mbox{neighbouring red dots.}\end{aligned}
Before stating the next main Theorem of the paper (in the two-cut case) and assuming even, we denote by the Vandermonde determinant, we define the Heaviside function for ,
[TABLE]
and a new kernel, the discrete Tacnode kernel , for . It is a sum of a Heaviside function and four double integrals depending themselves on multiple integrals , defined below. The integrations are along upwards oriented vertical lines to the right of a (counterclock) contour about the origin:
[TABLE]
where
[TABLE]
We now state the second main Theorem:
Theorem 1.2
(Two-cut case) Keeping fixed and letting the size of the two cuts go to , consider the following rescaling of the geometric variables of the polygon , in terms of and new parameters , , , ,
[TABLE]
The variables with get rescaled into new variables , having their origin at the halfway point along the left boundary of the strip , shifted by :
[TABLE]
With this scaling and after a conjugation, the kernel (7) of the -process tends to the new kernel , as in (9), depending only on the width of the strip , the number of blue dots on the oblique lines in the strip and the parameter
[TABLE]
to be precise333It was noticed earlier that odd, and thus the blue dots belonging to levels take on even or odd values of , implying that the “discrete differential” . In the scaling limit this discrete differential will turn into a continuous differential.,
[TABLE]
The kernel satisfies the following involution:
[TABLE]
This involution exchanges , with being self-involutive for . Also has support on , has support on and on .
Remark:* The condition just above (11) is essential. When moves to , it turns out that, under the scaling (11), the point moves from to . Thus, outside the range , the geometric condition on the model , as in (1), would be violated.*
The main Theorem 1.2 assumes equal sizes for the two cuts on the opposite sides. The next statement shows it does not need to be so:
Theorem 1.3
For a hexagon with edges with two cuts of sizes and , as in Fig. 4, satisfying and and , the same limit (14) holds. Here also the limiting kernel , as in (9), only depends on the width of the oblique strip formed by the two cuts, the number of dots on each oblique line in the strip , and as in (13),where
[TABLE]
Remark:* The scaling in Theorem 1.3 is given by the following recipe. Setting , we define a new hexagon with edges , and with two equal cuts of size , where*
[TABLE]
with and . Substituting the formulas (15) in the scaling (11) gives the correct scaling for the model of Theorem 1.3.
Given the kernel (9) it is very natural to ask for the (joint) density of blue dots along oblique levels . A sample of these results is stated here; their proofs will appear elsewhere. For an illustration, see Fig. 5.
Corollary 1.4
(Density of blue dots along oblique lines). Given two oblique lines (levels) to the right of the strip (as in lower Fig.5), each carrying blue dots (tiles) at locations , with . Setting for , the joint density of blue tiles can be expressed as :
[TABLE]
where is a normalization constant and where is the volume of the truncated cone:
[TABLE]
Density (16) contains, besides a regular Vandermonde , a determinant of a matrix of size :
\begin{aligned} &\widetilde{\Delta}_{n_{1}}({\boldsymbol{\theta}}):=\det\left(\begin{array}[]{ccccc}&1&\dots&1\\ &{\theta}_{1}&\dots&\theta_{n_{1}}\\ &\vdots&&\vdots\\ &\theta_{1}^{\tau-\rho-1}&\dots&\theta_{n_{1}}^{\tau-\rho-1}\\ \\ &p_{-\tau}(\tfrac{\beta-\theta_{1}}{2})&\dots&p_{-\tau}(\tfrac{\beta-\theta_{n_{1}}}{2})\\ &\vdots&&\vdots\\ &p_{-\tau+\rho-1}(\tfrac{\beta-\theta_{1}}{2})&\dots&p_{-\tau+\rho-1}(\tfrac{\beta-\theta_{n_{1}}}{2})\\ &p_{-\tau+\rho}(\tfrac{\beta-\theta_{1}}{2})&\dots&p_{-\tau+\rho}(\tfrac{\beta-\theta_{n_{1}}}{2})\\ &\vdots&&\vdots\\ &p_{r-1-\tau}(\tfrac{\beta-\theta_{1}}{2})&\dots&p_{r-1-\tau}(\tfrac{\beta-\theta_{n_{1}}}{2})\end{array}\right)\!\!\!\!\!\!\vspace*{-6.4cm}\begin{aligned} &\left.\begin{array}[]{cccc}\\ \\ \\ \\ \end{array}\right\}\tau-\rho\\ \\ &\left.\begin{array}[]{cccc}\\ \\ \\ \\ \end{array}\right\}\rho\\ &\left.\begin{array}[]{cccc}\\ \\ \\ \\ \end{array}\right\}(r-\rho)_{{}_{\geq 0}}\end{aligned}\end{aligned}*
with and as in (12) and (13); see also (9). The Vandermonde-like above contains the integrals , taken along the line ; for they are Hermite polynomials and for truncated normal moments:*
[TABLE]
Similar densities can be written down for the case of two levels within and below the strip . Given blue tiles at levels , the blue tiles along the lines in between are uniformly distributed (extension of Baryshnikov property to truncated cones).
The one-level density at level is given by formula (16), with and the volume .
Notice that for , one has and the joint density (16) coincides with the corresponding density for the GUE-tacnode for overlapping Aztec-diamonds [1, 4]; its proof will appear elsewhere. For , the one-level density coincides (visually) with the one-level density (19) in [4] for the GUE-tacnode, after some minor change of variables. This is a very strong indication -although no proof- that the GUE-tacnode kernel of [1, 4] is a special instance of the kernel (9). Visually these two kernels look entirely different.
2 Revisiting the -process of red dots
This section contains a brief summary of the results obtained in **[3]** necessary for this paper. We begin with the two-cut model. The assumptions (1), (5) and the one formulated just below (5) imply the following inequalities:
[TABLE]
It will be clear that all these conditions are satisfied given the scaling (11).
The line contains three separate sets of contiguous integers : a (eft) region, an upper-(ut)-region and the (ight) region, containing respectively and integers; in total integers; to wit:
[TABLE]
We define two other sets of contiguous integers on the line , related to the strips and :
[TABLE]
The inequalities (17) imply that each of the sets and form a contiguous set of integers, such that each of the three sets are completely separated: and .
From the polynomials and of degree and , defined in (2), we define other polynomials:
[TABLE]
where are monic polynomials whose roots are given by the sets and , repectively. Later we will represent them as ratios of -functions444using .; see (78) and (79) later.
Referring to contour integration in this paper, the notation will denote a contour encompassing the points in question and no other poles of the integrands; e.g., contours like
[TABLE]
For notational simplicity, we set
[TABLE]
which appear crucially in the kernel below and in the following -fold contour integral555Set . A shorthand notation for the Vandermonde is .* for , (see (20))*
[TABLE]
Be aware of the slightly different notation, in comparison with **[3]**!
Theorem 2.1
For the two-cut model and for and , the determinantal process of red dots is given by the kernel below, involving at most -fold integrals, with , defined in (6), being the number of blue dots along the oblique lines within the strip ,
[TABLE]
[TABLE]
where
[TABLE]
The relationship between the and -kernels, stated in Theorem 1.1 for the multi-cut model, will be established by showing that the kernel is the inverse of the Kasteleyn matrix; this will be done in sections 3 and 4. To do so, we use the very general form of the -kernel, given in (29) for the multi-cut model; see **[3]**. Incidentally, obtaining the asymptotics for the kernel (29) would be awkward, in view of expression (29) involving -fold integrals. In the two-cut case formula (29) reduces to (23).
The set in the multi-cut model is to be defined as . It reduces to the definition (18) of for the two-cut model, using the geometric condition (1). Setting for any ,
[TABLE]
we have for and integer the following identity,
[TABLE]
Setting for brevity ), define and
**
\widetilde{\Delta}_{d}^{({\bf y}_{\mbox{\tiny cut}})}(w;u_{2},\dots,u_{d}):=\det\left(\begin{array}[]{cccccccc}w^{y_{1}}\!\!\!\!\!\!&\dots\!\!\!\!\!\!&\!\!\!\!\!\!w^{y_{d}}\\ \\ &\left(\frac{(u_{\alpha}-y_{\beta}+1)_{N-1}}{(N-1)!}\right)_{{2\leq\alpha\leq d}\atop{1\leq\beta\leq d}}\end{array}\right)* =\left(\prod_{\alpha=2}^{d}\oint_{\Gamma_{0}}\frac{dw_{\alpha}}{2\pi{\rm i}S^{(N)}_{u_{\alpha}}(w_{\alpha})}\right)D_{d}^{({\bf y}_{\mbox{\tiny cut}})}(w)\Bigr{|}_{w_{1}=w}.*
[TABLE]
Indeed, using (27), the integral expressions are valid, since for all and the lower-cut, we have .
Proposition 2.2
The kernel for the multi-cut model has the following form for , and , :
[TABLE]
where and are multiple integrals666where for , as before, and for ,
[TABLE]
containing the expressions and in (28) and the polynomial as in (2).
3 An identity along boundary points of
In this section, we prove an identity valid near boundary points (multi-cut model). Using the notation (30) in Proposition 2.2, we state the following:
Proposition 3.1
For red dots in the sets
[TABLE]
we have777E.g., in -coordinates, the upper oblique lines in the two-cut case (as in Figure 3) correspond to and .
[TABLE]
Refering to the kernel in the notation of (29) (multi-cut model), this proposition leads to the following:
Corollary 3.2
For , we have
[TABLE]
*We will need the following: *
Lemma 3.3
For , the sum over the roots of equals:
[TABLE]
Proof: Using the fact that and consequently that the roots of are roots of , implies that the left hand side equals:
[TABLE]
Proof of Proposition 3.1: The form (29) of the kernel will be most convenient here: it contains the expressions and and an integral of ; so, inserting (28) into them, one finds:
[TABLE]
and
[TABLE]
Notice that in all can be taken distinct, because of the presence of the Vandermonde .
The -integral in the -part of the kernel contains an expression of the following type:
[TABLE]
For any , the roots of the -polynomial are roots of the polynomial as well. So, for , the expression (37) has simple poles at those , for which and no poles at the ’s such that . Therefore we shall distinguish between the case and .
At first, assume . The multiple sum in can be decomposed as follows and rewritten, taking into account the fact above and removing the noncontributing part of the sum,
[TABLE]
It is then useful to re-express the following Vandermonde’s in terms of lower-degree Vandermonde’s; namely, for every , we have
[TABLE]
Then
[TABLE]
For fixed , and using identity (34) in Lemma 3.3, the sum of the residues on the second line above equals
[TABLE]
Observe that all such that , with , figure in the list of , since the upper-cuts do not contain . So, the above sum is valid.
Notice that the new expression for the right hand side of (38), is independent of the value of . Moreover the multiple sum in the expression above is, in reality, a free sum over indices , with playing no role in neither of the Vandermonde’s. Also, we can remove the constraint in the sum, because if two or more , then we get zero by the Vandermonde and if exactly one , then the skew-symmetry of in in (38) will kill expression (38). So its right hand side can be rewritten:
[TABLE]
Each one of terms in the sum is independent of ; so we may rename the variables in each of the terms:
[TABLE]
and accordingly
[TABLE]
With this renaming each term in the sum will be the same. So, we conclude that, the expression (38), upon using (39) and (28), equals
[TABLE]
This establishes identity (32) for .
The case * is easier, because each of the terms in (32) vanishes. Indeed, in that case the expression (37) has no poles and thus the first integral in (32) vanishes. The points such that belong automatically to the inside of an upper-dent, and so . But by assumption in the multi-cut case; see the paragraph before (26)) and so . This implies that for , implying in turn that*
[TABLE]
Thus performing the -integration on the first row of the determinant leads a zero integral, showing that the second integral in (32) vanishes. This ends the proof of Proposition 3.1.
Proof of Corollary 3.2: The expression in the kernel (29) contains a - integration along the contour ; in view of the integrand, this contour can be decomposed into . Identity (32) then tells us that for ,
[TABLE]
for this last integral, see Petrov **[32*]**. This ends the proof of formula (33) in Corollary 3.2. ** *
4 The -kernel is the inverse of the Kasteleyn matrix and deriving the -kernel of blue dots
In this section we show that, for the multi-cut model, the inverse of the Kasteleyn matrix equals the -kernel (Theorem 4.2 below), from which the proof of Theorem 1.1 is an easy consequence.
Fig. 7 & 8.: The three dimers on the honeycomb lattice corresponding to the three types of lozenges. Changing the coordinates by moving the white circles to the middle upper-part of the triangle and the black dots to the middle of the lower-part of the shaded triangle.
Fig. 9. The boundaries at which the -kernel vanishes.
The lozenge tilings of the hexagon is equivalent to dimers on its dual graph, a honeycomb graph (bipartite), consisting of black dots, alternating with white circles; see Fig. 7 above. The black dots correspond to the shaded triangles and the white circles to white triangles. Only one segment emanates out of each vertex, as shown in Figs. 7 and 8. The Kasteleyn matrix for this honeycomb graph is the adjacency matrix and is given by:
[TABLE]
in terms of the dimers (i), (ii) and (iii) given in Fig. 8. Typically the vertices would belong to the middle of the black and white triangles, as in the left Fig. 8. However, the -coordinates of our problem correspond to the integer points coinciding with the middle of the lower-edge of the squares, which is the middle of the lower-edge of the shaded triangles in the right Fig. 8 above. In order to make the two figures match, one moves the dots in the white triangles to the top-edge and the circles in the shaded triangles to the lower-edge. Thus the Kasteleyn matrix in the new coordinates (i’), (ii’), (iii’) reads
[TABLE]
with vanishing boundary conditions along three of the six types of boundaries appearing in the hexagon . The Kasteleyn matrix vanishes there, as indicated in Fig. 9, since the corresponding dimer traverses the boundary in (b), (d) and (e), whereas in (a), (c) and (f), the shaded triangles are adjacent to white triangles, and thus no dimer crosses the boundary, leading to the non-vanishing of the Kasteleyn matrix.
Before proceeding, we prove a three-step relation for the kernel :
Lemma 4.1
The following formal identity involving integrals, is valid for all , including boundary888This is to say that the white triangles, corresponding to , and , can be outside .:
[TABLE]
Proof: To do so, use version (29) of the kernel , each piece being abbreviated as , with the -variables being implicit. So we check:
[TABLE]
At first:
[TABLE]
as for and , only the middle term in the equation above counts and contributes 1; otherwise the expression above vanishes.
To show that , we consider the part of the integrand containing only and check that
[TABLE]
whereas checking reduces to showing
[TABLE]
*ending the proof of Lemma 4.1. ** *
We now prove the first statement of this section:
Theorem 4.2
For the multi-cut case, the -kernel is the inverse of the . To be precise:
[TABLE]
Proof: It suffices to prove that
[TABLE]
I*. **For a fixed black triangle belonging to the interior of the hexagon or to any of the boundary types (a), (c), (f) *** of Fig. 9 (i.e., lower cuts, lower boundaries or top horizontal boundary) the Kasteleyn matrix takes on three non-zero values as in (40), and thus formula (44) reduces to the three-step relation (41) in Lemma 4.1.
**II. Bottom boundary of , away from the lower-cuts of type (d) **: Putting the boundary condition into identity (44) reduces to proving
[TABLE]
and, upon subtracting (41) from this equation, it suffices to show :
[TABLE]
* is automatic, since for , since both . To show , we evaluate the behavior of the -integrand at ; i.e.,*
[TABLE]
which has zero residue at . Finally, because the -integration in acting on the first row of , as given in (28) (see (30) and (26)), involves the following integral, which is for all ,
[TABLE]
thus establishing (45).
III. Upper-vertical boundaries of of type (e), as in Fig. 9 : Inserting into equation (44), it suffices to prove that for the points adjacent to the upper-vertical boundaries, we have:
[TABLE]
Again subtracting the three-step relation (41), it thus suffices to prove for the as above; then, we have that and thus from Corollary 3.2 we have the first equality below, at these points,
[TABLE]
Equality is automatic for . For , we consider two cases:
(i) left-vertical boundary. Then it must be that , if is to remain within the polygon; but then both sides of equality in (47) equal [math].
(ii) vertical boundary of upper-cut. Then if is to remain within the polygon, then either , or . In the first case, both sides of in (47) vanish, for the same reason as (i), and in the second case, the left hand side vanishes, because: , since and and so does the right hand side of , because . Then one notices that the expression in equals . To conclude, we have along the upper-vertical boundaries.
IV. Upper-oblique boundaries of of type (b), as in Fig. 9 : Inserting in equation (44), it suffices to prove that for the points adjacent to the upper-oblique boundaries, one has:
[TABLE]
Again subtracting the three-step relation (41), one needs to prove . For in the locus above, we have that , and thus applying again Corollary 3.2,
[TABLE]
*It remains to prove equality , which is automatic for , whereas for , the right hand side vanishes. Then for to belong to the hexagon, we must have, if for , that . Then , since , implying the left hand side of vanishes. This ends the proof that and the proof of Theorem 4.2. ** *
Before proving Theorem 1.1, we need Kenyon’s proposition:
Proposition 4.3
(Kenyon, ’97) Suppose that are a collection of distinct dimer edges of a bipartite graph , with , where and denote black and white vertices and let be the associated Kasteleyn matrix. The dimers form a determinantal point process on the edges of with correlation kernel given by
[TABLE]
where and
Proof of Theorem 1.1: At first observe that for ,
[TABLE]
as illustrated in Fig. 8, where the is represented by a blue dot. Applying Kenyon’s Theorem, for and with , we find for the kernel of blue dots, expressed in the -coordinates, using Proposition 4.3, the following:
[TABLE]
It will be more convenient to reexpress the kernel of blue dots in the -coordinates999using the change of coordinates (3) on both and ; namely and ., with and and performing a conjugation. The -process of blue dots is thus expressed by the following kernel:
[TABLE]
*leading to the result in Theorem 1.1. ** *
5 Scaling and moving contours in the -kernel
In this section, entirely devoted to the two-cut model, we will prepare the -kernel (52) of blue dots in order to do the asymptotics in the neighborhood of the strip . While the lines carrying the blue dots will be kept as such, the (discrete) running variable along those lines will be rescaled into a continuous variable. In view of the integrands in the -kernel and the related -kernel as in (23), it will be necessary to move the integration contours into an appropriate position vis-à-vis the saddle points, to be given later in Proposition 5.3.
From (52) and using the usual map as in footnote 9, the -kernel of blue dots along oblique lines reads in some new notation:
[TABLE]
giving rise to a map , defined by
[TABLE]
In (53), we use the kernel of red dots along horizontal lines, as given by (23):
[TABLE]
It is worth paying attention to the parameter appearing in the contour in formula (23) for , which here is given by
[TABLE]
In the rest of this section we omit the primes in (53) and (54); that is to say that henceforth will be defined by the map (54), without the primes.
Proposing a scaling*. Assuming even, the asymptotics will be performed about the black dot in the middle of Fig. 3, namely the point*
[TABLE]
We now propose the following scaling of the geometric variables of the figure, with fixed and getting large, and still satisfying ,
[TABLE]
together with the following scaling of the coordinates and the integration variables in the kernel , as in (23), leading respectively to new variables and new integration variables :
[TABLE]
throughout we set .
For future use, consider a map on the variables in (54) as below; it translates into a map on the -variables and further into a map on the new variables:
[TABLE]
Constraints on the geometry*. Given the scaling (57) of the geometric variables, the inequalities (17) lead to the positivity of the following expressions for large ,*
[TABLE]
and thus we must assume for ,
[TABLE]
Using the map (54) and the formula (56) for , combined with the scaling (57) and (58), and using the identities in Fig. 3, leads to the following behavior for the variables involved:
[TABLE]
From (61), it follows that for large enough , the - and -variables are asymptotically related to the geometrical points of the polygon as follows (on the first line the respective order of the and does not matter):
[TABLE]
The kernel as in (23) involves three contours (24). In particular, for the contour and from (62 ) and (62), we have, asymptotically, that , that and that can be written as
[TABLE]
Also, from (62()), it follows that the left-most roots of the polynomials and are given by and , where is the left-most integer in the upper-cut; see Fig. 3.
*Poles of the integrands of the kernel : *** Using the identities (62) and inequalities (63), the functions (21), defined in terms of the polynomials as in (19), have the following poles, where , appearing under the bracket, denotes a contour containing exactly those poles, written in ascending order,
[TABLE]
Two useful Lemmas* will be needed:*
Lemma 5.1
([3], section 8) Given a rational function with possibly poles within a contour and a point not within , not a pole of . Then for , we have (the notation refers to the contour , deformed so as to contain )
[TABLE]
In particular for ,
[TABLE]
Lemma 5.2
The -fold -integral about , not containing , can be expressed as the same -fold integral , with containing , by adding the -fold integral and , to wit:
[TABLE]
*Proof: Apply (66) with , with and . ** *
*Preparing the kernel, by moving contours: *** It will turn out that the saddle points for the various integrands will all coincide and will belong to the upper-cut, namely to the interval ; this will enable us to perform steepest descent analysis on the kernel . Before doing this analysis, we will need to move contours, so as to tailor the contours to the integrands. Of course, moving those contours will be at the expense of adding extra-terms; that will depend on the pole structure (64) of the functions (21). We now rewrite the -kernel as follows, remembering the notation in (23):
Proposition 5.3
Using the map as in (54), the kernel (as in (53) and (55)) in the range , can now be written as101010For and , the symbol , which coincides with the usual definition for .
[TABLE]
where the and were given in (22). The contours are all spelled out in (64); see also Fig. 10. The contour refers to containing the point as well; i.e., sits inside . The functions involve integrations along . Similarly, the functions refer to integrating along -contours.
Proof: Referring to the kernel in (23), each will be prepared separately:
(i) Preparing in (23),
[TABLE]
with -contour (blue in Fig. 11.I), -contour (red) and -contour (green). Since the degree in of the integrand of the first expression above (using (21) and (22)) equals
[TABLE]
one can move the (blue) -contour on the Riemann sphere across , leading to equality below; indeed given the poles (64(ii)) of , the -contour in Figure 11.I gets replaced by three other -contours (contour about , containing the -variables of ) and a little contour about , as in Fig. 11.II. The latter can be evaluated using the Residue Theorem, yielding:
[TABLE]
Next, due to the poles (64(v)) of , we can shrink the -contour of the first integral to . Also, in view of the poles (64(iii)) of , and since has no -poles, the -contour of the double integral in can be reduced to and a small circle about ; the latter leading to another residue term in , which integrated over gives the second single integral in , with -contours in the double integral as in Fig. 11.III,
[TABLE]
Fig. 10. The contours for the -kernel, with blue -, red - and green -contours.
Fig. 11. The changes of contours for integral .
The two single - and -integrals can be combined in one, with removed, because of (64(v)). Also the -integral in the double integral can be split as a sum of two, yielding:
[TABLE]
In we interchange the -contour with all -contours in the first double integral only, which leads to an extra-contribution as given by identity (67) in Lemma 5.2, leading to:
[TABLE]
Moreover, in view of the poles (64(iii)) of , it is legitimate to add to the -integration in the first double integrals in the contour , since , i.e., far away from . In the last double integral, one may also add to the -integral a contour smaller than , (i.e., not containing ); that contour can be enlarged so as to contain the -contour , at the expense of an extra-residue term. The last double integral in the formula below comes from the second part in the double integral of (V) above, thus yielding:
[TABLE]
with an obvious cancellation of the two single - integrals. The sum of the three double integrals equals in that order, as in (68); the contours are as in Fig. 10. The single integrals will be dealt with in (iii) below.
(ii) Preparing in (23): At first, since the -degree of the integrand of is also , one can move the -contour of the -integral across , giving . This case is simpler, since the term is now missing in . Then one takes the ’s outside the contour, yielding an extra-contribution in , again using formula (67):
[TABLE]
This leads to in (68), in that order.
(iii) Combining in (23) with the sum of the single integrals in (69). Remember and use the notation,
[TABLE]
Using (62(**)), we set
[TABLE]
we now prove the following formulas:
[TABLE]
Moreover
[TABLE]
Indeed, * the formula (73) of is straightforward; for the proof of the identity (73) involving , see Petrov**[32]**. We now evaluate the second integral for ; otherwise (73) is trivially satisfied. Given the definition (72) of , we have that , since on the one hand , and on the other hand the latter is valid asymptotically; see (63). The contour encloses the points*
[TABLE]
In order to apply the residue Theorem, we need to evaluate the polynomial numerators of and at those points, using the identity for . Indeed,
[TABLE]
Using the residue theorem and the evaluations (75) above, one finds (the integral only exists for or what is the same ):
[TABLE]
using on the last line the combinatorial identity below, setting and , valid for :
[TABLE]
We now prove (74). Using the identity prior to (75) again, the following holds :
[TABLE]
Using the above (77) in , we have
[TABLE]
The equality holds, because the -terms readily vanish. The last equality holds; indeed can be omitted, since and implies . Finally, in the second term of , can be omitted, because otherwise that term would automatically vanish, yielding (74).
*Finally, combining the three contributions (69), (70) and (74) leads to formula (68), ending the proof of Proposition 5.3. ** *
6 Formal asymptotics of the main ingredients
The integrands in the kernel as in (68) contain the functions and combinations thereof, besides ascending factorials; see (21). This section does the formal asymptotics of these functions, given the scaling (58).
*Scaling of the integrands: *** The map (54), combined with the scaling (58) to the new variables , and upon using the map as in (59), leads to the following expressions111111using .,
[TABLE]
Notice that, upon using (54) and (58) as before, the depend on the geometric variables (see (19)) and the new running variables and as well, whereas purely depends on the geometry of the polygon; the different -function ratios will be combined appropriately, as follows:
\begin{array}[]{ ccccccccccccccccccccccccccccc}&&&&&&&&{{{[x_{c+d},x_{c+d}+\tau_{1}-\rho-1]}}\atop{\mbox{\tiny finite interval}}}\atop{\downarrow}&&&&{[x_{c+1},x]}\atop{\downarrow}&&&&{{\cal R}}\atop{\downarrow}\end{array}**
[TABLE]
and
\begin{array}[]{ccccccccccccccccccccccccccccccccccc}&&&&&&{{\cal R}}\atop{\downarrow}&&&&&{{\cal L}}\atop{\downarrow}&&&&&{\mbox{\tiny\Sigma-strip}}\atop{\downarrow}&&&&&{{{\mbox{\tiny[x_{c+d}-\rho,x_{c+d}-1] }}\atop{\mbox{\tiny finite interval}}}}\atop{\downarrow}\end{array}**
[TABLE]
One checks the following expressions, useful later on:
[TABLE]
It implies that the first fraction of and the last one of play a special role, because their numerator and denominator differ by a constant only. This had to be so, because they correspond to finite intervals of width and , as seen from (78) and (79).
Formal limits and the saddle point*. In view of Stirling’s formula , we expand the following expression in powers of for :*
[TABLE]
It follows that
[TABLE]
and similarly upon taking the product ; in that case the sums get replaced by . Then goes with , whereas goes with . Given an interval , introduce the functions
[TABLE]
Given any of the functions in (62), refers to their leading terms. The same for the leading terms of the boundary of the intervals, corresponding to , and the strip . Then the expressions appearing in the asymptotics are as follows:
[TABLE]
*The following derivatives vanish, *
[TABLE]
when the linear expressions and respectively; this is so for
[TABLE]
Considering the kernel (23), the variables in the multiple integral interact with -variables in the first part of the kernel through the ratios . So the scaling for and must be, at least to first order, the same as the scaling for the ’s. This is to say that the two roots of and must be the same, and so we must have . One then further computes:
[TABLE]
This suggests the change of variables and, for later use, a similar change from to , and from to , together with the map in (58)
[TABLE]
Again, using the scaling (58) and the further transformation (85), one checks
[TABLE]
In this new variable,
[TABLE]
*Further, we have *
[TABLE]
Similarly
[TABLE]
and so for ,
[TABLE]
Next we deal with the first factor in (78) and the last factor in (79). Since from (80), we have , we fix the saddle so as to remove the lead--term in the -functions; so for as in (84); this is so, when . With this substitution and setting , all the expressions above simplify to
[TABLE]
with new parameters, expressed in terms of the appearing in the scaling for the , (see (57))
[TABLE]
Later, it will be convenient to define new , as follows,
[TABLE]
from which, upon using the value (88) of above, one checks
[TABLE]
It remains to check the validity of the inequalities (61) with the values given in (88); indeed for , we have
[TABLE]
Setting as in (85), and taking into account the fact that for , we check that the arguments of the -functions for (first factor in (78) and last factor in (79))
[TABLE]
and so we have for , using the ’s from (80):
[TABLE]
This implies that the “finite interval”-terms in and do not enter into the saddle argument, but merely will give rise to rational functions in the final integrand.
Estimating . and and are the only terms in depending on the new variables . Then, taking on the convention that the dots below refer to terms independent of and , but dependent on all the other variables, we have that the first line in the exponential of (81) reads, using (87), (88), the comments right above (88) and in :
[TABLE]
The second line* of (81) reads, noticing that and using ,*
[TABLE]
and the last line reads, using (80),
[TABLE]
Finally (91) for reads,
[TABLE]
Estimating . Since, as pointed out before, is independent of the coordinates, it does not contain any of the variables . Therefore the only contribution will come form the first line of (81), but calculated for , namely, using again (87), (88) and right above it, compute
[TABLE]
and from (91),
[TABLE]
Combining (92), (93), (94), (96), one finds
[TABLE]
where
[TABLE]
are functions not depending on the new variables and .
Also, the product of the functions above behaves as
[TABLE]
Using the map (59) on formulas (97) and (99), as in the expression (79) for , one also checks
[TABLE]
7 The steepest descent analysis
Since , we have for fixed that , and so, from the scaling (86) it follows that
[TABLE]
For convenience, we will denote the integrand of , the integrand of , etc…
**Asymptotics of the -term **.Then the leading term in , as in (68), reads (using: according to (62)))
[TABLE]
where
[TABLE]
Asymptotics of the factorial*. We have, using (62) and Stirling’s formula,*
[TABLE]
Asymptotics of the -integrands*: We now define the following integrands:*
[TABLE]
Then remembering the form (22) of and using the asymptotics (97) for , one finds, setting , as in (86),
[TABLE]
and so
[TABLE]
**Asymptotics of the -integrands **. Using (103), (97), (100), (101), using the first line of (86) and , as in (85), using the translation as in (85) and using the new in the last equality below (see (89) and (90)), the terms in (68) read as follows:
[TABLE]
and
[TABLE]
with (using (90))
[TABLE]
Steepest descent analysis*: We will now be working in the scale. The geometric points in Fig.1 in the new scale are denoted by . That is: , using (85). Fig. 14. gives a line with the respective positions of the geometric points , corresponding to the . As before set for the leading term of . Then, it follows from the definition (82) and (83) that*
[TABLE]
Setting , the function (82),
[TABLE]
has and thus it has a local maximum at the mid-point , and so the smooth deformation has a local maximum for some . It behaves asymptotically for as
[TABLE]
Setting , the functions and are symmetric about the -axis and behave, for as
[TABLE]
using for the fact that (notice )
[TABLE]
Using the behavior of the above and the formal Taylor expansion (87), the properties of the , setting , are summarized in Fig. 12121212Set , , , . . Knowing the type of saddle point for each of the and the location of the maxima and minima, it is easily seen that the behaves exactly as in the 3-dimensional plots of Fig. 15, with the level profile as indicated just below, at least for . Fig. 14 contains all the geometric points expressed in the scale ; e.g., , , …. Notice that for , the saddle point as in (88) would go to infinity and for , the geometric condition on the model would be violated.
Fig. 12. Behavior of , and .
Fig. 13. List of expressions in the integrands of the kernel , their contribution to the exponentials, the corresponding -functions and contours, and the limiting contours in the -variables. Here \Gamma_{0}:=\{\mbox{circle about 0L_{0-}:=0_{-}+{\rm i}{\mathbb{R}}}.
Fig. 14. The formulas above give the coordinates of the points below, with being the origin , with and being the running variables and assuming and large enough.
\begin{picture}(0.0,30.0)\par\par\put(1.0,0.0){\makebox(0.0,0.0)[]{\mbox{\begin{picture}(0.0,30.0)\put(0.0,0.0){\makebox(0.0,0.0)[]{\rotatebox{0.0}{\includegraphics[width=156.49014pt,height=156.49014pt]{S1Curve.pdf} }}} \par\put(-59.6,-20.0){{\color[rgb]{1.00,1.00,1.00}\definecolor[named]{pgfstrokecolor}{rgb}{1.00,1.00,1.00}\line(0,1){80.0}}} \end{picture} } }} \par\par\put(100.0,0.0){\makebox(0.0,0.0)[]{\mbox{\begin{picture}(0.0,30.0)\put(0.0,0.0){\makebox(0.0,0.0)[]{\rotatebox{0.0}{\includegraphics[width=156.49014pt,height=156.49014pt]{S1plusS2Curve.pdf} }}} \put(-59.6,-20.0){{\color[rgb]{1.00,1.00,1.00}\definecolor[named]{pgfstrokecolor}{rgb}{1.00,1.00,1.00}\line(0,1){80.0}}} \par\end{picture}}} } \par\par\put(200.0,0.0){\makebox(0.0,0.0)[]{ \mbox{\begin{picture}(0.0,30.0)\put(0.0,0.0){\makebox(0.0,0.0)[]{\rotatebox{0.0}{\includegraphics[width=156.49014pt,height=156.49014pt]{S2Curve.pdf} }}} \put(-59.7,-20.0){{\color[rgb]{1.00,1.00,1.00}\definecolor[named]{pgfstrokecolor}{rgb}{1.00,1.00,1.00}\line(0,1){80.0}}} \end{picture}}} } \par\end{picture}
Fig. 15. For : (For the level lines, dark=low, white=high)
[TABLE]
\begin{picture}(-50.0,0.0)\par\put(125.0,-70.0){\makebox(0.0,0.0)[]{\rotatebox{0.0}{\includegraphics[width=284.52756pt,height=512.1496pt]{ContourminS1.pdf} }}} \par\put(255.0,-20.0){\makebox(0.0,0.0)[]{}} \put(20.0,-13.0){\makebox(0.0,0.0)[]{}} \end{picture}
-\Re S_{1}$$\leftarrow~{}\mbox{up}*
\begin{picture}(-50.0,0.0)\par\put(125.0,-70.0){\makebox(0.0,0.0)[]{\rotatebox{0.0}{\includegraphics[width=284.52756pt,height=512.1496pt]{ContourplusS1Left.pdf} }}} \par\put(255.0,-20.0){\makebox(0.0,0.0)[]{}} \put(7.0,-14.0){\makebox(0.0,0.0)[]{}} \par\put(29.0,17.0){\makebox(0.0,0.0)[]{}} \par\centering@add@centering\end{picture}
\Re S_{1}$$\leftarrow~{}\mbox{down}
Fig. 16. Separatrices (blue) and level lines (red) for and , including the steep descent curves (black).
The analysis*. We assume throughout that . In a sufficiently small neighborhood of the saddle point of the functions , the Taylor series (87) of is convergent. To be precise, setting , we have that for some compact subset and for ,*
[TABLE]
Given , and for large enough , a ball about the saddle point contains the following contours involved in the integrations, expressed here in the -scale (explaining why putting a tilde)131313In (108), , for , denotes an interval of integers and if . ; this uses (62) and (64):
[TABLE]
These are contours about the point , all of width . Then in the -scale, and thus the Taylor expansion (107) in converges, since the error has order
[TABLE]
Moreover on the boundary of the ball , we also have
[TABLE]
Case 1: First consider the \left\{\begin{array}[]{lllllll}\mbox{v{\mathbb{L}}{1},{\mathbb{L}}{4}}\\ \mbox{z{\mathbb{L}}{2},{\mathbb{L}}{4},{\mathbb{L}}^{\prime}_{4}}\end{array}\right\} . When , these contours about the intervals (108) above get squeezed in the -scale (resp. -scale) to the point and thus the contours turn into a loop around , which in the -scale (resp. -scale) becomes a loop about the origin.
Case 2: Next consider the -contours in . In the -scale, this is a loop surrounding the intervals and (108*). The function is a deformation of about a small neighborhood of the saddle point , and has a maximum in the interval and a minimum in ; see Fig. 12. The level curve (red in Fig. 16)*
[TABLE]
for the level profile of is, for small enough, a loop (black in Fig. 16) inside the separatrix (blue in Fig. 16), whose left-most point belongs to the region , at least for large enough. Then, for close enough to the saddle point [math] and large enough, the function will be decreasing in , even a little beyond the intersection of the line with the separatrix , as follows from the type of the saddle.
*Consider now the curve (black in Fig. 16) formed by *
(i)* the vertical segment of , up to the point of intersection with a level curve for small enough , and *
(ii)* the part of the level curve , starting form the intersection points with the vertical segments and winding around the minimum of .*
The curve is indeed a loop about the intervals (108*) and , along which the function will be decreasing, starting from the point and constant all along .*
For and small enough, the segment will belong to the ball of convergence (for ) of the Taylor series (107) about the saddle point. So, there the intersection point is of order , which in the -scale has order . Moreover the value of along is given by (109), i.e.,
[TABLE]
so one is at the boundary of the ball in the -scale.
Finally, the interval (108*) above gets multiplied with , which contracts the interval to the point , whereas the interval gets send to infinity; see Fig. 14. This implies that in this limit, and since in the -scale the ball of convergence has order , the small neighborhood along the vertical segment gets blown up to an imaginary line in the -scale and thus the line in the -scale. In view of (110), the integral in the -scale about the curve in -scale will be in absolute value*
[TABLE]
and thus exponentially small.
Case 3. Consider the \left\{\begin{array}[]{lllllll}\mbox{v{\mathbb{L}}{2},{\mathbb{L}}{3}}\\ \mbox{u\Omega{\mathbb{L}}{1},{\mathbb{L}}^{\prime}{1},{\mathbb{L}}{4},{\mathbb{L}}^{\prime}{4}}\end{array}\right\} . Here we are dealing with the functions and , which to the left of the have a similar behavior, with a maximum along . Therefore the contours can be deformed to a loop consisting of a vertical segment passing through the saddle point, which is continued symmetrically by a level curve about the interval . This a steep descent path and, as in Case 2, the segment can be made to belong to the neighborhood where the Taylor series argument is valid. So, the rest of the argument proceeds as in Case 2 and the segment gets blown up to the imaginary line in the -scale (resp. )and thus the line in the -scale.
Case 4. For the -contours in , we deform this contour such that the right-most point belongs to the ball of convergence of the Taylor series and such that the contour traverses the level lines as in second part of Fig. 16. This will be a curve of steep descent, such that at the right-most point we have
[TABLE]
This implies that the integral about will satisfy
[TABLE]
which tends to [math] for .
From (104) and (105), and the four cases above, we thus have:
[TABLE]
Finally, multiply (111) by the conjugation and set and , and exchanging in the second double integral. This maps and . It also changes the signs of the double integrals, except for the last one. One also sets and remember . This leads to the kernel , as in (9), and with and , defined by
[TABLE]
which gives exactly formula (10). This ends the proof of the main statement, namely Theorem 1.2.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Mark Adler, Sunil Chhita, Kurt Johansson and Pierre van Moerbeke: Tacnode GUE-minor processes and double Aztec diamonds , Probab. Theory Related Fields 162 , no. 1-2, 275-325 (2015)
- 2[2] Mark Adler, Kurt Johansson and Pierre van Moerbeke: Double Aztec diamonds and the tacnode process . Adv. Math. 252 (2014), 518-571.
- 3[3] Mark Adler, Kurt Johansson and Pierre van Moerbeke: Tilings of non-convex Polygons, skew-Young Tableaux and determinantal Processes .
- 4[4] Mark Adler and Pierre van Moerbeke: Coupled GUE-minor Processes . Intern Math Research Notices, 21 (2015), 10987-11044 (ar Xiv:1312.3859)
- 5[5] Vincent Beffara, Sunil Chhita and Kurt Johansson: Airy point process at the liquid-gas boundary . (ar Xiv:1606.08653)
- 6[6] Dan Betea, J. Bouttier, P. Nejjar and M. Vuletic: The free boundary Schur process and applications . (ar Xiv:1704.05809)
- 7[7] A. Borodin, V. Gorin and E. M. Rains, q 𝑞 q -Distributions on boxed plane partitions , Selecta Math. 16 (2010), 731-789.
- 8[8] Alexei Borodin, Eric M. Rains: Eynard-Mehta theorem, Schur process, and their Pfaffian analogs J. Stat. Phys. 121 (2005), no. 3-4, 291-317. (ar Xiv:math-ph/0409059)
