Bounds on the permanent and some applications
Combinatorics
2014-08-06 v1
Abstract
We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor for the permanent. We also give a combinatorial application of the lower bound, proving S. Friedland's "Asymptotic Lower Matching Conjecture" for the monomer-dimer problem.
Cite
@article{arxiv.1408.0976,
title = {Bounds on the permanent and some applications},
author = {Leonid Gurvits and Alex Samorodnitsky},
journal= {arXiv preprint arXiv:1408.0976},
year = {2014}
}