Lower bounds for partial matchings in regular bipartite graphs and applications to the monomer-dimer entropy

Combinatorics Probability and Computing

Volumn 17, Issue 3, 2008, Pages 347-361

  Friedland, Shmuel ^a   Gurvits, Leonid ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; DIMERS; ENTROPY; MONOMERS; POLYNOMIALS;

BIPARTITE GRAPHS; MONOMER DIMER ENTROPY; POSITIVE HYPERBOLIC POLYNOMIALS;

GRAPH THEORY;

EID: 42249111044     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008747     Document Type: Article

References (23)

1. Baxter, R. J. (1968) Dimers on a rectangular lattice. J. Math. Phys. 9 650-654.
2. Bregman, L. M. (1973) Some properties of nonnegative matrices and their permanents. Soviet Math. Dokl. 14 945-949.
3. Egorichev, G. P. (1981) Proof of the van der Waerden conjecture for permanents. Siberian Math. J. 22 854-859.
4. Erdos, P. and Rényi, A. (1968) On random matrices II. Studia Math. Hungar. 3 459-464.
5. Falikman, D. I. (1981) Proof of the van der Waerden conjecture regarding the permanent of doubly stochastic matrix. Math. Notes Acad. Sci. USSR 29 475-479.
6. Friedland, S. (1979) A lower bound for the permanent of doubly stochastic matrices. Ann. of Math. 110 167-176.
7. Friedland, S. (1982) A proof of a generalized van der Waerden conjecture on permanents. Linear Multilinear Algebra 11 107-120.
8. Friedland, S. and Gurvits, L. (2006) Generalized Friedland-Tverberg inequality: Applications and extensions. arXivtraath/0603410 v2.
9. Friedland, S., Krop, E., Lundow, P. H. and Markstrom, K. (2007) Validations of the asymptotic matching conjectures. arXiv:math.CO/0603001 v1.
10. Friedland, S., Krop, E. and Markstrom, K. Enumerating matchings in regular graphs, in preparation.
11. Friedland, S. and Peled, U. N. (2005) Theory of computation of multidimensional entropy with an application to the monomer-dimer problem. Adv. Appl. Math. 34 486-522.
12. Friedland, S. and Peled, U. N. The pressure associated with multidimensional SOFT. In preparation.
13. Gurvits, L. (2004) Combinatorial and algorithmic aspects of hyperbolic polynomials. arXIv: math.CO/0404474.
14. Gurvits, L. (2006) Hyperbolic polynomials approach to van der Waerden/Schrijver-Valiant like conjectures: Sharper bounds, simpler proofs and algorithmic applications. In STOC'06: Proc. 38th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 417-426. arXIv: math.CO/0510452 (2005).
15. Hammersley, J. M. (1966) Existence theorems and Monte Carlo methods for the monomer-dimer problem. In Research Papers in Statistics: Festschrift for J. Neyman (F. N. David, ed.), Wiley, London, pp. 125-146.
16. Heilmann, O. J. and Lieb, E. H. (1972) Theory of monomer-dimer systems. Comm. Math. Phys. 25 190-232.
17. Lovász, L. and Plummer, M. D. (1986) Matching Theory, Vol. 121 of North-Holland Mathematical Studies, North-Holland, Amsterdam.
18. Schrijver, A. (1998) Counting 1-factors in regular bipartite graphs. J. Combin. Theory Ser. B 72 122-135.
19. Schrijver, A. and Valiant, W. G. (1980) On lower bounds for permanents. Indagationes Mathematicae 42 425-427.
20. Sinkhorn, R. (1964) A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist. 35 876-879.
21. Tverberg, H. (1963) On the permanent of bistochastic matrix. Math. Scand. 12 25-35.
22. van der Waerden, B. L. (1926) Aufgabe 45. Jahresber. Deutsch. Math.-Verein. 35 117.
23. k. Linear Algebra Appl. 373 153-167.