Generalized Friedland-Tverberg inequality: applications and extensions

Simple item page
dc.creatorFriedland, Shmuel
dc.creatorGurvits, Leonid
dc.date2006-03-16
dc.date2006-08-24
dc.date.accessioned2026-07-07T07:07:00Z
dc.date.available2026-07-07T07:07:00Z
dc.descriptionWe 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.
dc.description21 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0603410
dc.identifierhttp://arxiv.org/abs/math/0603410
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110232
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subject05A15, 05A16, 05C70, 05C80, 82B20
dc.titleGeneralized Friedland-Tverberg inequality: applications and extensions
dc.typetext

Files

Collections

arXiv