Reconstruction of domino tilings -- combinatorial and probabilistic questions

DOI10.1016/j.dam.2015.06.015zbMath1357.05023OpenAlexW807844913MaRDI QIDQ897580

Daniel Berend, Yoav Bar-Sinai

Publication date: 7 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.015

zbMATH Keywords

combinatorial puzzle solvingdomino tiling reconstruction

Mathematics Subject Classification ID

Game theory (91A99) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Finding all maximally-matchable edges in a bipartite graph
• Enumeration of dimer (domino) configurations
• Trees and matchings
• Enumeration of hybrid domino-lozenge tilings
• How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
• Coupling functions for domino tilings of Aztec diamonds
• Poisson approximation for non-backtracking random walks
• Random sampling for the monomer–dimer model on a lattice
• Dimer problem in statistical mechanics-an exact result
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstruction of domino tilings -- combinatorial and probabilistic questions