On a strange observation in the theory of the dimer problem
Abstract
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.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- January 1998
- DOI:
- 10.48550/arXiv.math/9801094
- arXiv:
- arXiv:math/9801094
- Bibcode:
- 1998math......1094J
- Keywords:
-
- Combinatorics;
- 05B45(Primary);
- 05A15;
- 05C70(Secondary)
- E-Print:
- 8 pages, LaTeX. Submitted to Discrete Mathematics