Change search
ReferencesLink to record
Permanent link

Direct link
Compression of transfer matrices
Umeå University, Faculty of Science and Technology, Department of mathematics.
2001 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 231, no 1-3, 321-329 p.Article in journal (Refereed) Published
Abstract [en]

We present a method for reducing the size of transfer matrices by exploiting symmetry. For example, the transfer matrix for enumeration of matchings in the graph C-4 x C-4 x P-n can be reduced from order 65536 to 402 simply due to the 384 automorphisms of C-4 x C-4. The matrix for enumeration of perfect matchings can be still further reduced to order 93, all in a straightforward and mechanical way. As an application we report an improved upper bound for the three-dimensional dimer problem. (C) 2001 Elsevier Science B.V. All rights reserved.

Place, publisher, year, edition, pages
2001. Vol. 231, no 1-3, 321-329 p.
National Category
Discrete Mathematics
URN: urn:nbn:se:umu:diva-107771DOI: 10.1016/S0012-365X(00)00329-0ISI: 000167835300030OAI: diva2:851489
British Combinatorial Conference, Liverpool, England
Available from: 2015-09-05 Created: 2015-08-28 Last updated: 2015-09-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lundow, Per-Håkan
By organisation
Department of mathematics
In the same journal
Discrete Mathematics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link