Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-11T08:23:32.319Z Has data issue: false hasContentIssue false

Asymptotics of pure dimer coverings on rail yard graphs

Published online by Cambridge University Press:  10 October 2023

Zhongyang Li
Affiliation:
Department of Mathematics, University of Connecticut, 341 Mansfield Road, Unit 1009, Storrs, CT 06269, USA; E-mail: zhongyang.li@uconn.edu
Mirjana Vuletić
Affiliation:
Department of Mathematics, University of Massachusetts Boston, 100 William T. Morrissey Boulevard, Boston, MA, 02125, USA; E-mail: mirjana.vuletic@umb.edu

Abstract

We study the asymptotic limit of random pure dimer coverings on rail yard graphs when the mesh sizes of the graphs go to 0. Each pure dimer covering corresponds to a sequence of interlacing partitions starting with an empty partition and ending in an empty partition. Under the assumption that the probability of each dimer covering is proportional to the product of weights of present edges, we obtain the limit shape (law of large numbers) of the rescaled height functions and the convergence of the unrescaled height fluctuations to a diffeomorphic image of the Gaussian free field (Central Limit Theorem), answering a question in [7]. Applications include the limit shape and height fluctuations for pure steep tilings [9] and pyramid partitions [20; 36; 39; 38]. The technique to obtain these results is to analyze a class of Macdonald processes which involve dual partitions as well.

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press
Figure 0

Figure 1 Pyramid partitions.

Figure 1

Figure 2 Domino tilings corresponding to pyramid partitions.

Figure 2

Figure 3 Dimer covering on a rail yard graph corresponding to the pyramid partition in the left graph of Figure 1.

Figure 3

Figure 4 Dimer covering on a rail yard graph corresponding to the pyramid partition in the right graph of Figure 1.

Figure 4

Figure 5 Frozen boundary of pyramid partitions with transition points $V_0=-1$, $V_1=0$, $V_2=1$. The left graph has $\tau _1=\tau _2=1$, and the right graph has $\tau _1=10,\tau _2=1/10$. If we consider the frozen boundaries as curves in the $(\chi ,\kappa )$ plane, in both cases, frozen boundaries have $\chi =0$ as an asymptotic line.

Figure 5

Figure 6 A rail yard graph with LR sequence $ \underline {a}=\{L,R,R,L\}$ and sign sequence $ \underline {b}=\{+,+,-,-\}$. Odd vertices are represented by red points, and even vertices are represented by blue points. Dark lines represent a pure dimer covering. Assume that above the horizontal line $y=4$, only horizontal edges with an odd vertex on the left are present in the dimer configuration, and below the horizontal line $y=-4$, only horizontal edges with an even vertex on the left are present in the dimer configuration. The corresponding sequence of partitions (from the left to the right) is given by $\emptyset \prec (2,0,\ldots )\prec ' (3,1,1,\ldots )\succ '(2,0,\ldots )\succ \emptyset $.

Figure 6

Figure 7 Flip of dimer configurations on a face between two columns. Left: $(L-,L-)$, $(L-,R-)$, $(L-,L+)$,$(L-,R+) (R+,L+)$, $(R+,L-)$, $(R+,R-)$, $(R+,R+)$. Right: $(L+,L-)$, $(L+,L+)$, $(L+,R+)$, $(L+,R-)$, $(R-,L+)$, $(R-,L-)$, $(R-,R+)$, $(R-,R-)$.

Figure 7

Figure 8 Poles, represented with crosses, and zeros, represented with dots, of $\mathcal {G}_\chi $. Satisfied for Assumption 6.2 where (6.11) holds.

Figure 8

Figure 9 Poles, represented with crosses, and zeros, represented with dots, of $\mathcal {G}_\chi $. Satisfied for Assumption 6.2 where (6.12) holds.

Figure 9

Figure 10 Frozen boundary of the Aztec diamond with q-volume weights.