Related papers: A generalization of Aztec diamond theorem, part I
We compute the probability of any local pattern at an arbitrary position in a random dimer configuration in a square grid with an Aztec-diamond boundary.
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we obtain solutions to problems 1, 2, and 10 in James Propp's…
We review the connections between the octahedral recurrence, $\lambda$-determinants and tiling problems. This provides in particular a direct combinatorial interpretation of the $\lambda$-determinant (and generalizations thereof) of an…
This paper deals with two GUE-matrices, coupled together through some inequalities between the spectra of the first few (small) principal minors. The main results of the paper is to show that the spectra of the principal minors of these…
In 2003, Ciucu presented a unified way to enumerate tilings of lattice regions by using a certain Reduction Theorem (Ciucu, Perfect Matchings and Perfect Powers, Journal of Algebraic Combinatorics, 2003). In this paper we continue this line…
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
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…
We consider uniform random domino tilings of the restricted Aztec diamond which is obtained by cutting off an upper triangular part of the Aztec diamond by a horizontal line. The restriction line asymptotically touches the arctic circle…
Random domino tilings of the Aztec diamond shape exhibit interesting features and some of the statistical properties seen in random matrix theory. As a statistical mechanical model it can be thought of as a dimer model or as a certain…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
We introduce a new determinantal method to count cycle systems in a directed graph that generalizes Gessel and Viennot's determinantal method on path systems. The method gives new insight into the enumeration of domino tilings of Aztec…
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 compute 2-enumerations of certain halved alternating sign matrices. In one case the enumeration equals the number of perfect matchings of a halved Aztec diamond. In the other case the enumeration equals the number of perfect matchings of…
Links between uniform Aztec diamonds and random matrices are numerous in the literature. In particular \cite{johansson2006eigenvalues,Forrester} established that, under correct rescaling, the probability density function of a certain…
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…
We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem,…
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
Kenyon and Wilson showed how to test if a circular planar electrical network with $n$ nodes is well-connected by checking the positivity of $\binom{n}{2}$ central minors of the response matrix. Their test is based on the fact that any…
We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…