Hitting matrix and domino tiling with diagonal impurities
From MaRDI portal
Publication:359577
DOI10.1007/S10955-013-0744-6zbMATH Open1271.05023arXiv1211.5928OpenAlexW1989321965MaRDI QIDQ359577FDOQ359577
Authors: Fumihiko Nakano, Taizo Sadahiro
Publication date: 12 August 2013
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Abstract: As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the hitting matrix method[4]. (2) we have an alternative proof of the main result in [9] and result in (1) above using the formula by Kenyon-Wilson [6, 7] of counting the number of groves on the circular planar graph. (3) we study the behavior of the probability of finding the impurity at a given site when the size of the graph tends to infinity, as well as the scaling limit of those.
Full work available at URL: https://arxiv.org/abs/1211.5928
Recommendations
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Title not available (Why is that?)
- Lectures on Dimers
- The scaling limit of the correlation of holes on the triangular lattice with periodic boundary conditions
- A random tiling model for two dimensional electrostatics
- Loop-erased walks and total positivity
- Combinatorics of tripartite boundary connections for trees and dimers
- Domino tilings with one diagonal impurity
- Boundary partitions in trees and dimers
- The interaction of a gap with a free boundary in a two dimensional dimer system
- Local move connectedness of domino tilings with diagonal impurities
- A bijection theorem for domino tilings with diagonal impurities
Cited In (3)
This page was built for publication: Hitting matrix and domino tiling with diagonal impurities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359577)