Theory of computation of multidimensional entropy with an application to the monomer-dimer problem

DOI10.1016/j.aam.2004.08.005zbMath1076.82009arXivmath/0402009OpenAlexW2092704115MaRDI QIDQ2568107

Shmuel Friedland, Uri N. Peled

Publication date: 7 October 2005

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

Full work available at URL: https://arxiv.org/abs/math/0402009

zbMATH Keywords

transfer matrixtopological entropysubshifts of finite typeMonomer-dimet

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

On the connectivity of spaces of three-dimensional domino tilings, Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs, Transfer-matrix methods meet Ehrhart theory, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, A complete proof that square ice entropy is, Asymptotic expansions for \(\lambda _{d }\) of the dimer and monomer-dimer problems, Statistical Matching Theory, Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy, Monomer-dimer problem on random planar honeycomb lattice, An asymptotic expansion and recursive inequalities for the monomer-dimer problem, A characterization of the entropies of multidimensional shifts of finite type, Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs, On the validations of the asymptotic matching conjectures, Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms, Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension, Sequential cavity method for computing free energy and surface pressure, Flip invariance for domino tilings of three-dimensional regions with two floors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Counting 1-factors in regular bipartite graphs
• A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
• Approximating the number of monomer-dimer coverings of a lattice.
• An improved upper bound for the \(3\)-dimensional dimer problem
• Theory of monomer-dimer systems
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• A proof of a generalized van der Waerden conjecture on permanents
• The topological entropy of cellular automata is uncomputable
• The Number of Independent Sets in a Grid Graph
• The capacity and coding gain of certain checkerboard codes
• Entropy bounds for constrained two-dimensional random fields
• Capacity bounds for the three-dimensional (0,1) run length limited channel
• The undecidability of the domino problem
• A Lower Bound for the Monomer-Dimer Problem
• Compression of transfer matrices