Related papers: Perfect t-embeddings of uniformly weighted Aztec d…
In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…
This paper explores the connection between perfect t-embeddings and the octahedron equation in the setting of the two-periodic Aztec diamond. In particular, we show that the positions of both the t-embedding and the corresponding origami…
We study the large-scale geometry of t-surfaces -- pairs of perfect t-embeddings and their associated origami maps -- arising from dimer models on Aztec diamonds with periodic edge weights. We prove that these t-surfaces converge to…
We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of 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,…
We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid $G_n$ of order $n$ is similar to the disjoint union of two copies of the quartered Aztec diamond $QAD_{n-1}$ of order $n-1$…
We consider asymtotics of a domino tiling model on a class of domains which we call rectangular Aztec diamonds. We prove the Law of Large Numbers for the corresponding height functions and provide explicit formulas for the limit. For a…
This is the second paper in the series devoted to the study of the dimer model on t-embeddings of planar bipartite graphs. We introduce the notion of perfect t-embeddings and assume that the graphs of the associated origami maps converge to…
We study the asymptotic behavior of random dimer coverings of the one-periodic Aztec diamond in random environment. We investigate quenched limit theorems for the height function and we extend annealed limit theorems that were recently…
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and…
We analyze height fluctuations in Aztec diamond dimer models with nearly arbitrary periodic edge weights. We show that the centered height function approximates the sum of two independent components: a Gaussian free field on the multiply…
In this paper we consider domino tilings of the Aztec diamond with doubly periodic weightings. In particular a family of models which, for any $ k \in \mathbb{N} $, includes models with $ k $ smooth regions is analyzed as the size of the…
The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between…
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
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 describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…
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 present a general approach for the study of dimer model limit shape problems via variational and integrable systems techniques. In particular we deduce the limit shape of the Aztec diamond and the hexagon for quasi-periodic weights…
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…
We prove a conjecture of Sintiari and Trotignon that every even-hole-free graph of sufficiently large treewidth contains a four-vertex induced subgraph with at least five edges (that is, either the four-vertex complete graph or the unique…