Height fluctuation for Lozenge Tilings of Polygons
Jiaoyang Huang
Resolves the general-polygon case of the 2007 Kenyon–Okounkov GFF conjecture with new reusable machinery, a landmark within integrable probability though confirmatory in outcome and confined to pure mathematics.
Abstract
We establish Gaussian free field fluctuations for uniformly random lozenge tilings of simply connected polygonal domains with sides whose directions cycle through the three lattice directions. More precisely, assuming that the liquid region is connected and that the boundary data do not force the height at any interior point, we prove that the fluctuations of centered height function converge to the Gaussian free field in the liquid region, confirming a prediction of Kenyon and Okounkov from 2007. We introduce a tiling action function that encodes the geometry of the limit shape through its critical points. The action function has a complex conjugate pair of critical points in the liquid region, repeated real critical points on the arctic boundary, and distinct real critical points in the frozen region. Using this tiling action function, we construct an approximation to the inverse Kasteleyn matrix in terms of explicit single-contour and double-contour integrals and prove that the approximation is uniform throughout the polygonal domain. The convergence to the Gaussian free field then follows from standard kernel computations.
AI Impact Assessments
(1 models)Scientific Impact Assessment
Paper type: Pure theoretical mathematics (probability theory / integrable probability / statistical mechanics).
1. Core Contribution
The paper establishes Gaussian free field (GFF) fluctuations for the centered height function of uniformly random lozenge tilings of *arbitrary* simply connected polygonal domains (with sides cycling through the three lattice directions), under the assumptions that the liquid region is connected and boundary data do not force interior heights. This confirms the 2007 Kenyon–Okounkov conjecture — one of the central open problems in the theory of random dimers/tilings — at a level of generality not previously achieved. Prior rigorous results were confined to special integrable geometries (Petrov's trapezoids, hexagons, single-horizontal-edge polygons, Aztec diamonds, cylinders), or used t-embeddings/Temperleyan or Schur-generating-function methods that required strong structural assumptions. The key technical innovation is a "tiling action function" that encodes the limit-shape geometry through its critical points, together with a construction of local single- and double-contour parametrices for the inverse Kasteleyn matrix that are proven uniform across the *entire* polygon — liquid, frozen, arctic, cusp, tangency, and 13 distinct geometric regimes — and then glued via compatibility estimates into a global approximation.
2. Methodological Rigor
The design is sound and the execution is exhaustive (≈280 pages). The strategy — reformulating the inverse Kasteleyn matrix as a discrete heat-type boundary-value problem, deriving the tiling action via a Cole–Hopf/complex-Burgers heuristic, then rigorously constructing parametrices and controlling their overlaps — is coherent and internally consistent. The steepest-descent analysis (Chapter 7 appendices) is meticulous, with careful branch/orientation conventions, nodal-length (Almgren frequency) bounds, and perturbation lemmas for the critical-point equations. The compatibility/Neumann-series argument yielding K⁻¹ from the glued parametrix is standard in spirit but demanding in execution. The reduction of GFF convergence to cumulant computations follows the established Kenyon/Petrov route. The main potential weakness is not correctness but scope: the two standing assumptions (connected liquid region, empty trivial set) are acknowledged, with the multiply-connected/discrete-Gaussian-component case deferred.
3. Potential Impact
Within integrable probability and mathematical physics this is a landmark: it closes the general-polygon case of a load-bearing conjecture and demonstrates emergent conformal invariance (the Kenyon–Okounkov complex structure) at full generality. The *uniform* inverse-Kasteleyn approximation across all geometric regimes is a reusable technical achievement — it should enable follow-up work on multiply connected domains, other global observables, mixed bulk/edge statistics, and possibly periodically weighted models. The framework is complementary to (and validates) the t-embedding and discrete-loop-equation programs. There is essentially no direct real-world/industrial application; impact is intellectual.
4. Timeliness & Relevance
Highly timely. Random tilings and the GFF are an extremely active area, with parallel programs (t-embeddings by Chelkak–Laslier–Russkikh, dynamical loop equations by Gorin–Huang, Borot–Gorin–Guionnet's recent β-ensemble theory, six-vertex GFF results). Resolving the general polygonal Kenyon–Okounkov conjecture addresses a recognized bottleneck that these competing methods had only partially reached.
5. Strengths & Limitations
Strengths: resolves a named 18-year-old conjecture in generality; introduces genuinely new, reusable tools (tiling action, global parametrix); exhaustive and self-contained; controls the notoriously delicate arctic/frozen transition regimes rather than restricting to compact liquid subsets. Limitations: restricted to simply connected liquid regions and non-degenerate (empty trivial set) domains; enormous length and technical density limit accessibility and independent verification; the outcome (GFF) is expected, so the contribution is confirmatory rather than paradigm-shifting; single-author work whose sheer volume makes refereeing burdensome. The result corroborates the predicted universal GFF behavior via a new, more general method — replication value beyond mere restatement, though it does not contest any prior claim.
Overall, this is a major, technically formidable contribution likely to become a standard reference for GFF fluctuations of tilings and a source of reusable machinery, tempered slightly by its confirmatory (non-surprising) nature and narrow applicability outside pure mathematics.
Generated Sep 7, 2026
Comparison History (0)
Resolves the general-polygon case of the 2007 Kenyon–Okounkov GFF conjecture with new reusable machinery, a landmark within integrable probability though confirmatory in outcome and confined to pure mathematics.