Mathematics – Combinatorics
Scientific paper
2006-03-16
Mathematics
Combinatorics
21 pages, 2 figures
Scientific paper
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 $r$-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.
Friedland Shmuel
Gurvits Leonid
No associations
LandOfFree
Generalized Friedland-Tverberg inequality: applications and extensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Generalized Friedland-Tverberg inequality: applications and extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Friedland-Tverberg inequality: applications and extensions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-80293