An improved upper bound for the \(3\)-dimensional dimer problem
type: Item
instance of: scholarly article
title: An improved upper bound for the \(3\)-dimensional dimer problem
zbMATH Open document ID: 0939.05024
DOI: 10.1215/S0012-7094-98-09401-7
author: Mihai Ciucu
published in: Duke Mathematical Journal
publication date: 2000-03-27T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 82B20
zbMATH DE Number: 1425137
zbMATH Keywords: dimer tilings of a plane
zbMATH Keywords: number of tilings
reviewed by: H. N. V. Temperley
MaRDI profile type: Publication
cites work: Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
cites work: Q5543146
cites work: Q5537646
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: An upper bound for the multidimensional dimer problem
cites work: An asymptotic solution of the multidimensional dimer problem
cites work: Q3897156
cites work: Q3748279
cites work: Dimer problem in statistical mechanics-an exact result
Recommended article: Dimer problem for some three dimensional lattice graphs
Recommended article: An improved bound for \(k\)-sets in three dimensions
Recommended article: An asymptotically improved upper bound on the diameter of polyhedra
Recommended article: Improving bounds on the diameter of a polyhedron in high dimensions
Recommended article: An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
Recommended article: An improved bound on the number of point-surface incidences in three dimensions
Recommended article: Improved bounds on the diameter of lattice polytopes
Recommended article: Q5748883
Recommended article: On the dimer problem of the vertex-edge graph of a cubic graph
Recommended article: An improved upper bound on the growth constant of polyominoes
description: scientific article; zbMATH DE number 1425137