Compression of transfer matrices

Discrete Mathematics

Volumn 231, Issue 1-3, 2001, Pages 321-329

  Lundow, Per Håkan ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

3D dimer constant; Enumeration; Independent sets; Matchings; Transfer matrix

Indexed keywords

EID: 0035962019     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00329-0     Document Type: Article

References (8)

1. D. Babic et al., The matching polynomial of a polygraph, Discrete Appl. Math. 15 (1986) 11-24.
2. H.J. Broersma, Li Xueliang, On 'The matching polynomial of a polygraph', Discrete Appl. Math. 46 (1993) 79-86.
3. M. Ciucu, An improved upper bound for the three dimensional dimer problem, Duke. Math. J. 94 (1998) 1-11.
4. F. Forbes, B. Ycart, Counting stable sets on Cartesian products of graphs, Discrete Math. 186 (1998) 105-116.
5. J.M. Hammersley, Existence theorems and Monte Carlo methods for the monomer-dimer problem, in: F.N. David, E. Fix (Eds.), Research Papers in Statistics (festschrift for J. Neyman), Wiley, London, 1966.
6. P. Lancaster, M. Tismenetsky, The Theory of Matrices, Academic Press, New York, 1985.
7. P.H. Lundow, Computation of matching polynomials and the number of 1-factors in polygraphs, Research Reports, No. 12, 1996, Department of Mathematics, Umeå University.
8. P.H. Lundow, K. Markström, Manuscript in preparation.