相关论文: Enumeration of Hybrid Domino-Lozenge Tilings

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),…

Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…

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 generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions…

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…

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…

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…

We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.

Aztec dragons are lattice regions first introduced by James Propp, which have the number of tilings given by a power of $2$. This family of regions has been investigated further by a number of authors. In this paper, we consider a…

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…

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

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…

We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…

We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…

Propp conjectured that the number of lozenge tilings of a semiregular hexagon of sides $2n-1$, $2n-1$ and $2n$ which contain the central unit rhombus is precisely one third of the total number of lozenge tilings. Motivated by this, we…

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…

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…

In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge tilings of such general regions is not expected --- and…

Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign…

We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec…