On a strange observation in the theory of the dimer problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
8 pages, LaTeX. Submitted to Discrete Mathematics

Keywords

Combinatorics, 05B45(Primary);05A15;05C70(Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/76518

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9801094
 http://arxiv.org/abs/math/9801094

Collections

arXiv