An improved upper bound for the 3-dimensional dimer problem
The authors quote various known lower and upper bounds for the number of ``dimer tilings of a \(3\)-dimensional cuboid. The known number of dimer tilings of a plane clearly gives a crude lower bound, and several improvements of this are quoted. An upper bound is found in this paper by assuming the brick is divided into layers and considering the situation when \(\ell\) dimers have one end in each layer. A graph \(S\) is defined for each such choice of \(\ell\) dimers, and the number of tilings of the whole is related to the number of closed walks on \(S\) appropriately weighted. An ingenious group theoretical argument then makes it possible to estimate the desired number of tilings. The result is reasonably close to the best known lower bound.
- 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
- scientific article; zbMATH DE number 4182820
- On the dimer problem of the vertex-edge graph of a cubic graph
- An improved upper bound on the growth constant of polyominoes
- An asymptotic solution of the multidimensional dimer problem
- An upper bound for the multidimensional dimer problem
- Dimer problem in statistical mechanics-an exact result
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3704754 (Why is no real title available?)
- scientific article; zbMATH DE number 3248840 (Why is no real title available?)
- scientific article; zbMATH DE number 3257906 (Why is no real title available?)
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
- On the validations of the asymptotic matching conjectures
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- Several constants arising in statistical mechanics
- Dimer problem for some three dimensional lattice graphs
- Transfer-matrix methods meet Ehrhart theory
- Binomial ideals of domino tilings
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Flip invariance for domino tilings of three-dimensional regions with two floors
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Exact and approximate compression of transfer matrices for graph homomorphisms
- On the connectivity of spaces of three-dimensional domino tilings
- 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
- The channel capacity of read/write isolated memory
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)
