A $q$-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary
Tri Lai
备注：
30 pages. Title is changed from "A q-enumeration of generalized plane partitions" to "A q-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary"
MacMahon proved a simple product formula for the generating function of plane partitions fitting in a given box. The theorem implies a $q$-enumeration of lozenge tilings of a semi-regular hexagon on the triangular lattice. In this paper we generalize MacMahon's classical theorem by $q$-enumerating lozenge tilings of a new family of hexagons with four adjacent triangles removed from their boundary.
This article addresses the problem of enumerating the tilings of a plane by lozenges, under the restriction that these tilings be doubly periodic. Kasteleyn's Pfaffian method is applied to compute the generating function of those permutations. The monomials of this function represent the different types of tilings, grouping them according to the number of lozenges in each orientation. We present an alternative approach to compute these types. Finally, two additional classes of tilings are proposed as open enumeration problems.
The work of Mills, Robbins, and Rumsey on cyclically symmetric plane partitions yields a simple product formula for the number of lozenge tilings of a regular hexagon, which are invariant under roation by $120^{\circ}$. In this paper we generalize this result by enumerating the cyclically symmetric lozenge tilings of a hexagon in which four triangles have been removed in the center.
Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi recently extended this tiling enumeration to a halved hexagon with a triangle removed from the boundary. In this paper we prove a generalization of the results of Proctor and Rohatgi by enumerating lozenge tilings of a halved hexagon in which an array of adjacent triangles has been removed from the boundary.
We $q$-enumerate lozenge tilings of a hexagon with three bowtie-shaped regions have been removed from three non-consecutive sides. The unweighted version of the result generalizes a problem posed by James Propp on enumeration of lozenge tilings of a hexagon of side-lengths $2n,2n+3,2n,2n+3,2n,2n+3$ (in cyclic order) with the central unit triangles on the $(2n+3)$-sides removed.
We study the weighted partition function for lozenge tilings, with weights given by multivariate rational functions originally defined by Morales, Pak and Panova (2019) in the context of the factorial Schur functions. We prove that this partition function is symmetric for large families of regions. We employ both combinatorial and algebraic proofs.
We consider incomplete tilings of the equilateral triangle of edge length n that is subdivided into n^2 regular equilateral smaller unit triangles. Pairs of the unit triangles that share a side may be converted into lozenges, leaving some subset of the unit triangles untouched. We count numerically these coverings by lozenges and unit triangles for edge lengths n <= 6: the total and the detailed refinement as a function of the number of lozenges.
In a recent paper, Lai and Rohatgi proved a "shuffling theorem" for lozenge tilings of a hexagon with "dents" (i.e., missing triangles). Here, we shall point out that this follows immediately from the enumeration of Gelfand--Tsetlin patterns with given bottom row. This observation is also contained in a recent preprint of Byun.
It has been proven that the lozenge tilings of a quartered hexagon on the triangular lattice are enumerated by a simple product formula. In this paper we give a new proof for the tiling formula by using Kuo's graphical condensation. Our result generalizes a Proctor's theorem on enumeration of plane partitions contained in a "maximal staircase".
We give a formula for the number of lozenge tilings of a hexagon on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent, non-opposite sides. Our formula implies that for certain families of such regions, the ratios of their numbers of tilings are given by simple product formulas.
We use the subgraph replacement method to prove a simple product formula for the tilings of an 8-vertex counterpart of Propp's quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999), called quasi-octagon.
Motivated by a conjecture posed by Fulmek and Krattenthaler, we provide product formulas for the number of lozenge tilings of a semiregular hexagon containing a horizontal intrusion. As a direct corollary, we obtain a product formula for the number of boxed plane partitions with a certain restriction. We also investigate the asymptotic behavior of the ratio between the number of lozenge tilings of a semiregular hexagon containing a horizontal intrusion and that of a semiregular hexagon without an intrusion.
The enumeration of lozenge tilings of hexagons with holes has received much attention during the last three decades. One notable feature is that a lot of the recent development involved Kuo's graphical condensation. Motivated by Ciucu, Lai and Rohatgi's work on tilings of hexagons with a removed triad of bowties, in this paper, we show that the ratio of numbers of lozenge tilings of two more general regions is expressed as a simple product formula. Our proof does not involve the graphical condensation method. The proof is short and direct. We also provide a corresponding formula for cyclically…
We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{λ/μ}$, where $f^{λ/μ}$ is the number of standard Young tableaux of skew shape $λ/μ$ which have stable limit shape under the $1/\sqrt{n}$ scaling. The proof is based on the variational principle on the partition function of certain weighted lozenge tilings.
In a recent preprint, Lai worked out the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents" which differ only in width. Lai achieved this by using "graphical condensation" (i.e., application of a certain Pfaffian identity to the weighted enumeration of matchings). The purpose of this note is to exhibit how this can be done by the Lindström--Gessel--Viennot method for nonintersecting lattice paths in a quite simple way. Basically the same observation, but restricted to mere enumeration (i.e., all weights of lozenge tilings are equal to $1$), i…
Proctor proved a formula for the number of lozenge tilings of a hexagon with side-lengths $a,b,c,a,b,c$ after removing a "maximal staircase." Ciucu then presented a weighted version of Proctor's result. Here we present weighted and unweighted formulas for a similar region which has an additional unit triangle removed. We use Kuo's graphical condensation method to prove the results. By applying the factorization theorem of Ciucu, we obtain a formula for the number of lozenge tilings of a hexagon with three holes on consecutive edges.
We generalize a special case of a theorem of Proctor on the enumeration of lozenge tilings of a hexagon with a maximal staircase removed, using Kuo's graphical condensation method. Additionally, we prove a formula for a weighted version of the given region. The result also extends work of Ciucu and Fischer. By applying the factorization theorem of Ciucu, we are also able to generalize a special case of MacMahon's boxed plane partition formula.
We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec diamond are always enumerated by a simple product formula. This result generalizes the previous work of Ciucu (1997) and Yang (1992) about symmetric tilings of the Aztec diamond. We also use our method to prove a closed-form product formula for the number of centrally symmetric tilings of a quasi-hexagon.
Eisenk"olbl gave a formula for the number of lozenge tilings of a hexagon on the triangular lattice with three unit triangles removed from along alternating sides. In earlier work, the first author extended this to the situation when an arbitrary set of unit triangles is removed from along alternating sides of the hexagon. In this paper we address the general case when an arbitrary set of unit triangles is removed from along the boundary of the hexagon.
We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every third diagonal drawn in. We also obtain a generalization of Douglas' Theorem on the number of tilings of a family of regions of the square lattice with every second diagonal drawn in.
In a recent preprint, Lai showed that the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents", which differ only in width, factors nicely, and the same is true for the quotient of generating functions of weighted lozenge tilings of two "quarter hexagons with lateral dents". Lai achieved this by using "graphical condensation" (i.e., application of a certain Pfaffian identity to the weighted enumeration of matchings). The purpose of this note is to exhibit how this can be done by the Lindström--Gessel--Viennot method for nonintersecting lattice …
In a recent preprint, Lai and Rohatgi compute the generating functions of lozenge tilings of "quartered hexagons with dents" by applying the method of "graphical condensation". The purpose of this note is to exhibit how (a generalization of) Theorems 2.1 and 2.2 in Lai and Rohatgi's preprint can be achieved by the Lindström--Gessel--Viennot method of non--intersecting lattice paths and a certain determinant evaluation.
Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the boundary. In the previous paper, the author proved a common generalization of Proctor's and Rohatgi's results by enumerating lozenge tilings of a halved hexagon in the case an array of an arbitrary number of triangles has been removed from a non-staircase side. In this paper, we consider the other case when the array of triangles has been removed from the staircase…
We give a formula for the number of symmetric tilings of hexagons on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent non-opposite sides. We show that for certain families of such regions, the ratios of their numbers of symmetric tilings are given by simple product formulas. We also prove that for certain weighted regions which arise when applying Ciucu's Factorization Theorem, the formulas for the weighted and unweighted counts of tilings have a simple explicit relationship.
In their paper about a dual of MacMahon's classical theorem on plane partitions, Ciucu and Krattenthaler proved a closed form product formula for the tiling number of a hexagon with a "shamrock", a union of four adjacent triangles, removed in the center (Proc. Natl. Acad. Sci. USA 2013). Lai later presented a $q$-enumeration for lozenge tilings of a hexagon with a shamrock removed from the boundary (European J. Combin. 2017). It appears that the above are the only two positions of the shamrock hole that yield nice tiling enumerations. In this paper, we show that in the case of symmetric hexago…
It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more general than hexagons. They are obtained by further removing upward-pointing triangles. We call the resulting shapes triangular regions. We establish signed versions of the latter three bijections for triangular regions. We first investigate the tileability of triangular regions by lozenges. Then we use perfect matchings and families of non-intersecting latti…
In their 2002 paper, Ciucu and Krattenthaler proved several product formulas for the number of lozenge tilings of various regions obtained from a centrally symmetric hexagon on the triangular lattice by removing maximal staircase regions from two non-adjacent corners. For the case when the staircases are removed from adjacent corners of the hexagon, they presented two conjectural formulas, whose proofs, as they remarked, seemed at the time "a formidable task". In this paper we prove those two conjectures. Our proofs proceed by first generalizing the conjectures, and then proving them by induct…
MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for tilings of a dented semihexagon via semi-strict Gelfand--Tsetlin patterns. In this paper, we prove a natural hybrid of the two theorems for hexagons with an arbitrary set of unit triangles removed along a horizontal axis. In particular, we show that the `shuffling' of removed unit triangles only changes the tiling number of the region by a simple multiplicative factor. Our main result generalizes a number of known enume…
Motivated in part by Propp's intruded Aztec diamond regions, we consider hexagonal regions out of which two horizontal chains of triangular holes (called ferns) are removed, so that the chains are at the same height, and are attached to the boundary. By contrast with the intruded Aztec diamonds (whose number of domino tilings contain some large prime factors in their factorization), the number of lozenge tilings of our doubly-intruded hexagons turns out to be given by simple product formulas in which all factors are linear in the parameters. We present in fact $q$-versions of these formulas, w…
Ciucu showed that the number of lozenge tilings of a hexagon in which a chain of equilateral triangles of alternating orientations, called a `\emph{fern}', has been removed in the center is given by a simple product formula (Adv. Math. 2017). In this paper, we present a multi-parameter generalization of this work by giving an explicit tiling enumeration for a hexagon with three ferns removed, besides the middle fern located in the center as in Ciucu's region, we remove two additional ferns from two sides of the hexagon. Our result also implies a counterpart of MacMahon's classical formula of b…
We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-Gessel-Viennot methodology to find the number of tilings of a quartered lozenge hexagon.
We obtain an explicit formula for a certain weighted enumeration of lozenge tilings of a hexagon with an arbitrary triangular hole. The complexity of our expression depends on the distance from the hole to the center of the hexagon. This proves and generalizes conjectures of Ciucu et al., who considered the case of plain enumeration when the triangle is located at or very near the center. Our proof uses Askey-Wilson polynomials as a tool to relate discrete and continuous Selberg-type integrals.
In this paper we study height fluctuations of random lozenge tilings of polygonal domains on the triangular lattice through nonintersecting Bernoulli random walks. For a large class of polygons which have exactly one horizontal upper boundary edge, we show that these random height functions converge to a Gaussian Free Field as predicted by Kenyon and Okounkov [28]. A key ingredient of our proof is a dynamical version of the discrete loop equations as introduced by Borodin, Guionnet and Gorin [5], which might be of independent interest.
We study lozenge tilings of a domain with partially free boundary. In particular, we consider a trapezoidal domain (half hexagon), s.t. the horizontal lozenges on the long side can intersect it anywhere to protrude halfway across. We show that the positions of the horizontal lozenges near the opposite flat vertical boundary have the same joint distribution as the eigenvalues from a Gaussian Unitary Ensemble (the GUE-corners/minors process). We also prove the existence of a limit shape of the height function, which is also a vertically symmetric plane partition. Both behaviors are shown to coin…
This paper establishes a universality result for scaling limits of uniformly random lozenge tilings of large domains. We prove that whenever a boundary of the domain has three adjacent straight segments inclined under 120 degrees to each other, the asymptotics of tilings near the middle segment is described by the GUE--corners process of random matrix theory. An important step in our argument is to show that fluctuations of the height function of random tilings on essentially arbitrary simply-connected domains of diameter $N$ have smaller magnitude than $N^{1/2}$.
In a recent paper, Byun presented nice formulas for the enumeration of lozenge tilings of certain hexagonal regions with intrusions. This paper attempts to generalise some of Byun's investigations.
We give a new proof of the fact that, near a turning point of the frozen boundary, the vertical tiles in a uniformly random lozenge tiling of a large sawtooth domain are distributed like the eigenvalues of a GUE random matrix. Our argument uses none of the standard tools of integrable probability. In their place, it uses a combinatorial interpretation of the Harish-Chandra/Itzykson-Zuber integral as a generating function for desymmetrized Hurwitz numbers.
We study large-scale height fluctuations of random stepped surfaces corresponding to uniformly random lozenge tilings of polygons on the triangular lattice. For a class of polygons (which allows arbitrarily large number of sides), we show that these fluctuations are asymptotically governed by a Gaussian free (massless) field. This complements the similar result obtained in Kenyon [Comm. Math. Phys. 281 (2008) 675-709] about tilings of regions without frozen facets of the limit shape. In our asymptotic analysis we use the explicit double contour integral formula for the determinantal correlatio…
Recently, Lai and Rohatgi discovered a shuffling theorem for lozenge tilings of doubly-dented hexagons, which generalized the earlier work of Ciucu. Later, Lai proved an analogous theorem for centrally symmetric tilings, which generalized some other previous work of Ciucu. In this paper, we give a unified proof of these two shuffling theorems, which also covers the weighted case. Unlike the original proofs, our arguments do not use the graphical condensation method but instead rely on a well-known tiling enumeration formula due to Cohn, Larsen, and Propp. Fulmek independently found a similar p…
We study asymptotics of $q$-distributed random lozenge tilings of sawtooth domains (equivalently, of random interlacing integer arrays with fixed top row). Under the distribution we consider each tiling is weighted proportionally to $q^{\mathsf{vol}}$, where $\mathsf{vol}$ is the volume under the corresponding 3D stepped surface. We prove the following Interlacing Central Limit Theorem: as $q\rightarrow1$, the domain gets large, and the fixed top row approximates a given nonrandom profile, the vertical lozenges are distributed as the eigenvalues of a GUE random matrix and of its successive pri…
In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such plane partitions for which the transpose is the same as the complement. We use the equivalent phrasing of this identity in terms of symmetry classes of lozenge tilings of a hexagon on the triangular lattice. Our generalization consists of allowing the hexagon have certain symmetrically placed holes along its horizontal symmetry axis. The special case when there …
Inspired by Propp's intruded Aztec diamond regions, we consider halved hexagons in which two aligned arrays of triangular holes have been removed from their boundaries. Unlike the intruded Aztec diamonds (whose numbers of domino tilings contain some large prime factors in their factorizations), the numbers of lozenge tilings of our doubly-intruded halved hexagons are given by simple product formulas in which all factors are linear in the parameters. In this paper, we present an extensive list of exact tiling enumerations of sixteen different types of doubly-intruded halved hexagons. We also pr…
We consider regions obtained from 120 degree rotationally invariant hexagons by removing a core and three equal satellites (all equilateral triangles) so that the resulting region is both vertically symmetric and 120 degree rotationally invariant, and give simple product formulas for the number of their lozenge tilings. We describe a new method of approach for proving these formulas, and give the full details for an illustrative special case. As a byproduct, we are also able to generalize this special case in a different direction, by finding a natural counterpart of a twenty year old formula …
We use the periodic Schur process, introduced in arXiv:math/0601019v1, to study the random height function of lozenge tilings (equivalently, dimers) on an infinite cylinder distributed under two variants of the $q^{\operatorname{vol}}$ measure. Under the first variant, corresponding to random cylindric partitions, the height function converges to a deterministic limit shape and fluctuations around it are given by the Gaussian free field in the conformal structure predicted by the Kenyon-Okounkov conjecture. Under the second variant, corresponding to an unrestricted dimer model on the cylinder,…
MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more general regions, called triangular regions, and establish signed versions of the latter three bijections. Indeed, we use perfect matchings and families of non-intersecting lattice paths to define two signs of a lozenge tiling. A combinatorial argument involving a new method, called resolution of a puncture, then shows that the signs are in fact equivalent. …
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We obtain an explicit double contour integral expression for the determinantal correlation kernel of this ensemble (and also of its q-deformation). This provides new tools for asymptotic analysis of uniformly random lozenge tilings of polygons on the triangular lattice; or, equivalently, of random stepped surfaces. We work with a class of polygons which allows…
