Change search
ReferencesLink to record
Permanent link

Direct link
Compression of transfer matrices
Umeå University, Department of Mathematics.
2001 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 231, no 03-jan, 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.

Place, publisher, year, edition, pages
2001. Vol. 231, no 03-jan, 321-329 p.
Keyword [en]
transfer matrix, enumeration, independent sets, matchings, 3D dimer constant, polygraph
URN: urn:nbn:se:kth:diva-20498ISI: 000167835300030OAI: diva2:339193
QC 20100525Available from: 2010-08-10 Created: 2010-08-10 Last updated: 2011-11-17Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lundow, Per Håkan
In the same journal
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

Total: 28 hits
ReferencesLink to record
Permanent link

Direct link