Related papers: Domino tilings of generalized Aztec triangles
P. Di Francesco first introduced the "Aztec triangle" in his study of the relationship between the twenty-vertex model and domino tilings. He conjectured an exact formula for the number of tilings of the Aztec triangle, and it has since…
We show that the number of configurations of the 20 Vertex model on certain domains with domain wall type boundary conditions is equal to the number of domino tilings of Aztec-like triangles, proving a conjecture from [P. Di Francesco 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…
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…
A recent conjecture of Di Francesco states that the number of domino tilings of a certain family of regions on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign matrices. These…
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…
In this paper, we give inductive sum formulas to calculate the number of diagonally symmetric, and diagonally \& anti-diagonally symmetric domino tilings of Aztec Diamonds. As a byproduct, we also find such a formula for the unrestricted…
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…
We consider the triangular lattice ice model (20-Vertex model) with four types of domain-wall type boundary conditions. In types 1 and 2, the configurations are shown to be equinumerous to the quarter-turn symmetric domino tilings of an…
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…
Helfgott and Gessel gave the number of domino tilings of an Aztec Rectangle with defects of size one on the boundary of one side. In this paper we extend this to the case of domino tilings of an Aztec Rectangle with defects on all boundary…
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…
We study $k$-tilings ($k$-tuples of domino tilings) of the Aztec diamond of rank $m$. We assign a weight to each $k$-tiling, depending on the number of dominos of certain types and the number of "interactions" between the tilings. Employing…
In this article we define a generalization of the domino shuffling algorithm for tilings of the Aztec diamond to the interacting $k$-tilings recently introduced by S. Corteel, A. Gitlin, and the first author. We describe the algorithm both…
In his work on the twenty vertex model, Di Francesco [Electron. J. Combin. 28(4) (2021), Paper No. 4.38] found a determinant formula for the number of configurations in a specific such model, and he conjectured a closed form product formula…
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights…
We study domino tilings of certain regions $R_\lambda$, indexed by partitions $\lambda$, weighted according to generalized area and dinv statistics. These statistics arise from the $q,t$-Catalan combinatorics and Macdonald polynomials. We…
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…
We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the…
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond at random according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of…