Generalized Friedland-Tverberg inequality: applications and extensions
Combinatorics
2007-05-23 v2 Mathematical Physics
math.MP
Abstract
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in -regular bipartite graphs. It is shown that some of these bounds are asymptotically sharp. We improve the known lower bound for the three dimensional monomer-dimer entropy. We present Ryser-like formulas for computations of matchings in bipartite and general graphs. Additional algorithmic applications are given.
Cite
@article{arxiv.math/0603410,
title = {Generalized Friedland-Tverberg inequality: applications and extensions},
author = {Shmuel Friedland and Leonid Gurvits},
journal= {arXiv preprint arXiv:math/0603410},
year = {2007}
}
Comments
21 pages, 2 figures