Local move connectedness of domino tilings with diagonal impurities
نویسندگان
چکیده
منابع مشابه
Domino tilings with diagonal impurities
This paper studies the dimer model on the dual graph of the square-octagon lattice, which can be viewed as the domino tilings with impurities in some sense. In particular, under a certain boundary condition, we give an exact formula representing the probability of finding an impurity at a given site in a uniformly random dimer configuration in terms of simple random walks on the square lattice.
متن کاملDomino Tilings with Barriers
In this paper, we continue the study of domino-tilings of Aztec diamonds. In particular, we look at certain ways of placing ``barriers'' in the Aztec diamond, with the constraint that no domino may cross a barrier. Remarkably, the number of constrained tilings is independent of the placement of the barriers. We do not know of a simple combinatorial explanation of this fact; our proof uses the J...
متن کاملSpaces of Domino Tilings
We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...
متن کاملLocal Statistics for Random Domino Tilings of the Aztec Diamond
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of adjacent lattice squares. This formula quantiies the eeect of the dia-mond's boundary conditions on the behavior of typical tilings; in addition, it yields a new proof of ...
متن کاملIntersecting Domino Tilings
In this note we consider an Erdős-Ko-Rado analog of tilings. Namely given two tilings of a common region we say that they intersect if they have at least one tile in the same location. We show that for a domino tiling of the 2×n strip that the largest collection of tilings which pairwise intersect are counted by the Fibonacci numbers. We also solve the problem for tilings of the 3×(2n) strip us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.02.015