相关论文: Tiling enumeration of doubly-intruded halved hexag…
The expanded Aztec diamond is a generalized version of the Aztec diamond, with an arbitrary number of long columns and long rows in the middle. In this paper, we count the number of domino tilings of the expanded Aztec diamond. The exact…
We introduce a new method for studying gap probabilities in a class of discrete determinantal point processes with double contour integral kernels. This class of point processes includes uniform measures of domino and lozenge tilings as…
We consider a generating function of the domino tilings of an Aztec rectangle with several boundary unit squares removed. Our generating function involves two statistics: the rank of the tiling and half number of vertical dominoes as in the…
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…
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…
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the…
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…
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…
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…
In their unpublished work, Jockusch and Propp showed that a 2-enumeration of antisymmetric monotone triangles is given by a simple product formula. On the other hand, the author proved that the same formula counts the domino tilings of the…
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a fern removed from its center. The proof is based on a variant of Kuo's graphical condensation method. An unexpected connection with the total number of…
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…
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…
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…
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…
Fairly shortly after the publication of the Aztec diamond theorem of Elkies, Kuperberg, Larsen and Propp in 1992, interest arose in finding the number of domino tilings of an Aztec diamond with an ``Aztec window,'' i.e.\ a hole in the shape…
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.
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…
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…
We investigate a new family of regions that is the universal generalization of three well-known region families in the field of enumeration of tilings: the quasi-regular hexagons, the semi-hexagons, and the halved hexagons. We prove a…