On a strange observation in the theory of the dimer problem
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
math.CO↗
arXiv subjects
Publications and source records attributed to Horst Sachs.
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.