Hitting matrix and domino tiling with diagonal impurities
From MaRDI portal
(Redirected from Publication:359577)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- A bijection theorem for domino tilings with diagonal impurities
- A random tiling model for two dimensional electrostatics
- Boundary partitions in trees and dimers
- Combinatorics of tripartite boundary connections for trees and dimers
- Domino tilings with one diagonal impurity
- Lectures on Dimers
- Local move connectedness of domino tilings with diagonal impurities
- Loop-erased walks and total positivity
- The interaction of a gap with a free boundary in a two dimensional dimer system
- The scaling limit of the correlation of holes on the triangular lattice with periodic boundary conditions
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)