An improved upper bound for the 3-dimensional dimer problem
From MaRDI portal
Publication:1974841
DOI10.1215/S0012-7094-98-09401-7zbMATH Open0939.05024MaRDI QIDQ1974841FDOQ1974841
Publication date: 27 March 2000
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Recommendations
- Dimer problem for some three dimensional lattice graphs
- An improved bound for \(k\)-sets in three dimensions
- An asymptotically improved upper bound on the diameter of polyhedra
- Improving bounds on the diameter of a polyhedron in high dimensions
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- An improved bound on the number of point-surface incidences in three dimensions
- Improved bounds on the diameter of lattice polytopes
- Publication:5748883
- On the dimer problem of the vertex-edge graph of a cubic graph
- An improved upper bound on the growth constant of polyominoes
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Combinatorial aspects of packing and covering (05B40)
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Title not available (Why is that?)
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- Title not available (Why is that?)
- An asymptotic solution of the multidimensional dimer problem
- Title not available (Why is that?)
- An upper bound for the multidimensional dimer problem
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
Cited In (16)
- Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms
- Flip invariance for domino tilings of three-dimensional regions with two floors
- Approximating the permanent via importance sampling with application to the dimer covering problem
- On the validations of the asymptotic matching conjectures
- Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
- On the connectivity of spaces of three-dimensional domino tilings
- Dimer problem for some three dimensional lattice graphs
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Binomial ideals of domino tilings
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- Transfer-matrix methods meet Ehrhart theory
- The channel capacity of read/write isolated memory
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Several constants arising in statistical mechanics
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
This page was built for publication: An improved upper bound for the \(3\)-dimensional dimer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974841)
