Compression of transfer matrices

@article{Lundow2001CompressionOT,
  title={Compression of transfer matrices},
  author={Per H{\aa}kan Lundow},
  journal={Discrete Mathematics},
  year={2001},
  volume={231},
  pages={321-329}
}
Abstract 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 × C 4 × P n can be reduced from order 65536 to 402 simply due to the 384 automorphisms of C 4 × 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… CONTINUE READING
BETA

Topics from this paper.

Similar Papers

Loading similar papers…