AbstractA recursion for determining exact numbers μ(m, n) of monomer-dimer configurations on m × n rectangular boards is established. For large m and n close approximations to μ(m, n) are obtained. The methods may be extended to the case of a given fixed number of dimers
National Natural Science Foundation of China [11271307, 11061027]We consider the monomer-dimer (MD) ...
A theoretical approach, based on exact calculations of configurations on finite rectangular cells, i...
Given a 2^k×2^k chessboard in which all white squares lie in the upper half and all black squares li...
AbstractA recursion for determining exact numbers μ(m, n) of monomer-dimer configurations on m × n r...
The paper studies the problem of counting the number of coverings of a d-dimensional rectangular la...
Abstract The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted ...
In this paper we study the number M_{m,n} of ways to place nonattacking pawns on an m×n chessboard. ...
AbstractFor fixed k let An denote the number of dimer coverings of a k × n rectangle. Various proper...
AbstractExact enumerations are given for the number of arrangements of q dimers on regular two- and ...
AbstractFor a unified approach to the study of the distributions of like objects on chessboards, the...
AbstractWe prove that the number of monomer-dimer tilings of an n×n square grid, with m<n monomers i...
The properties of monomer-dimer tilings of planar regions has been a focused area of study in the ma...
We outline the most recent theory for the computation of the exponential growth rate of the number ...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
In this present work, some classical results of the pfaffian theory of the dimer model based on the ...
National Natural Science Foundation of China [11271307, 11061027]We consider the monomer-dimer (MD) ...
A theoretical approach, based on exact calculations of configurations on finite rectangular cells, i...
Given a 2^k×2^k chessboard in which all white squares lie in the upper half and all black squares li...
AbstractA recursion for determining exact numbers μ(m, n) of monomer-dimer configurations on m × n r...
The paper studies the problem of counting the number of coverings of a d-dimensional rectangular la...
Abstract The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted ...
In this paper we study the number M_{m,n} of ways to place nonattacking pawns on an m×n chessboard. ...
AbstractFor fixed k let An denote the number of dimer coverings of a k × n rectangle. Various proper...
AbstractExact enumerations are given for the number of arrangements of q dimers on regular two- and ...
AbstractFor a unified approach to the study of the distributions of like objects on chessboards, the...
AbstractWe prove that the number of monomer-dimer tilings of an n×n square grid, with m<n monomers i...
The properties of monomer-dimer tilings of planar regions has been a focused area of study in the ma...
We outline the most recent theory for the computation of the exponential growth rate of the number ...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
In this present work, some classical results of the pfaffian theory of the dimer model based on the ...
National Natural Science Foundation of China [11271307, 11061027]We consider the monomer-dimer (MD) ...
A theoretical approach, based on exact calculations of configurations on finite rectangular cells, i...
Given a 2^k×2^k chessboard in which all white squares lie in the upper half and all black squares li...
DOI
Add to ORKG